./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi008.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/rfi008.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi008.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-cde23df-m [2024-06-14 15:43:38,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:43:39,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:43:39,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:43:39,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:43:39,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:43:39,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:43:39,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:43:39,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:43:39,093 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:43:39,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:43:39,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:43:39,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:43:39,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:43:39,096 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:43:39,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:43:39,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:43:39,097 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:43:39,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:43:39,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:43:39,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:43:39,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:43:39,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:43:39,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:43:39,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:43:39,098 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:43:39,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:43:39,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:43:39,099 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:43:39,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:43:39,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:43:39,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:43:39,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:43:39,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:43:39,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:43:39,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:43:39,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:43:39,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:43:39,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:43:39,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:43:39,102 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:43:39,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:43:39,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:43:39,103 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 15:43:39,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:43:39,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:43:39,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:43:39,364 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:43:39,365 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:43:39,366 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/rfi008.opt.yml/witness.yml [2024-06-14 15:43:39,511 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:43:39,512 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:43:39,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008.opt.i [2024-06-14 15:43:40,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:43:40,714 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:43:40,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.opt.i [2024-06-14 15:43:40,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc629212/47563f13216b4e69bc6755f3558eeec7/FLAG13c9dc7db [2024-06-14 15:43:40,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc629212/47563f13216b4e69bc6755f3558eeec7 [2024-06-14 15:43:40,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:43:40,739 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:43:40,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:43:40,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:43:40,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:43:40,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:43:39" (1/2) ... [2024-06-14 15:43:40,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58b95854 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:43:40, skipping insertion in model container [2024-06-14 15:43:40,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:43:39" (1/2) ... [2024-06-14 15:43:40,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1f13466f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:43:40, skipping insertion in model container [2024-06-14 15:43:40,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:43:40" (2/2) ... [2024-06-14 15:43:40,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58b95854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:40, skipping insertion in model container [2024-06-14 15:43:40,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:43:40" (2/2) ... [2024-06-14 15:43:40,750 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:43:40,806 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:43:40,807 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] (((((((((((((((((! 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 )x >= 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_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (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 )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 )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 )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 )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 )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 )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 )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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (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 )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 )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 )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 )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 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 )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 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 )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 )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 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) && __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) && 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)))) && (! 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 || y$read_delayed == (_Bool)0) [2024-06-14 15:43:40,808 INFO L97 edCorrectnessWitness]: Location invariant before [L830-L830] (((((((((((((((((! 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 )x >= 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_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (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 )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 )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 )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 )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 )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 )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 )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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (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 )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 )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 )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 )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 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 )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 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 )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 )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 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) && __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) && 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)))) && (! 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 || y$read_delayed == (_Bool)0) [2024-06-14 15:43:40,808 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:43:40,809 INFO L106 edCorrectnessWitness]: ghost_update [L827-L827] multithreaded = 1; [2024-06-14 15:43:40,851 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:43:41,166 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:43:41,186 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:43:41,509 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:43:41,536 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:43:41,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:41 WrapperNode [2024-06-14 15:43:41,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:43:41,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:43:41,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:43:41,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:43:41,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:41" (1/1) ... [2024-06-14 15:43:41,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:41" (1/1) ... [2024-06-14 15:43:41,635 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-06-14 15:43:41,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:43:41,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:43:41,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:43:41,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:43:41,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:41" (1/1) ... [2024-06-14 15:43:41,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:41" (1/1) ... [2024-06-14 15:43:41,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:41" (1/1) ... [2024-06-14 15:43:41,693 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 15:43:41,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:41" (1/1) ... [2024-06-14 15:43:41,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:41" (1/1) ... [2024-06-14 15:43:41,721 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:41" (1/1) ... [2024-06-14 15:43:41,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:41" (1/1) ... [2024-06-14 15:43:41,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:41" (1/1) ... [2024-06-14 15:43:41,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:41" (1/1) ... [2024-06-14 15:43:41,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:43:41,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:43:41,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:43:41,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:43:41,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:41" (1/1) ... [2024-06-14 15:43:41,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:43:41,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:43:41,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 15:43:41,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 15:43:41,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:43:41,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:43:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:43:41,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:43:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:43:41,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:43:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:43:41,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:43:41,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:43:41,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:43:41,851 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:43:41,964 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:43:41,966 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:43:42,753 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:43:42,753 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:43:42,970 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:43:42,970 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:43:42,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:43:42 BoogieIcfgContainer [2024-06-14 15:43:42,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:43:42,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:43:42,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:43:42,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:43:42,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:43:39" (1/4) ... [2024-06-14 15:43:42,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52772187 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:43:42, skipping insertion in model container [2024-06-14 15:43:42,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:43:40" (2/4) ... [2024-06-14 15:43:42,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52772187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:43:42, skipping insertion in model container [2024-06-14 15:43:42,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:43:41" (3/4) ... [2024-06-14 15:43:42,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52772187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:43:42, skipping insertion in model container [2024-06-14 15:43:42,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:43:42" (4/4) ... [2024-06-14 15:43:42,985 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.opt.i [2024-06-14 15:43:42,998 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:43:42,999 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:43:42,999 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:43:43,070 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:43:43,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:43:43,146 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-14 15:43:43,147 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:43:43,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:43:43,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:43:43,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-14 15:43:43,163 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:43:43,170 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;@466a3f5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:43:43,170 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:43:43,177 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:43:43,177 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-14 15:43:43,177 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:43:43,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:43,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:43:43,178 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:43,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:43,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1642904383, now seen corresponding path program 1 times [2024-06-14 15:43:43,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:43,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171683537] [2024-06-14 15:43:43,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:43,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:47,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:47,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171683537] [2024-06-14 15:43:47,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171683537] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:47,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:47,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:43:47,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127861126] [2024-06-14 15:43:47,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:47,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:43:47,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:47,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:43:47,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:43:47,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-14 15:43:47,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:47,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:47,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-14 15:43:47,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:47,874 INFO L124 PetriNetUnfolderBase]: 131/262 cut-off events. [2024-06-14 15:43:47,874 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-14 15:43:47,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 262 events. 131/262 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1025 event pairs, 75 based on Foata normal form. 1/252 useless extension candidates. Maximal degree in co-relation 506. Up to 235 conditions per place. [2024-06-14 15:43:47,878 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 22 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-14 15:43:47,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 119 flow [2024-06-14 15:43:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:43:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:43:47,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-06-14 15:43:47,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-06-14 15:43:47,889 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 57 transitions. [2024-06-14 15:43:47,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 119 flow [2024-06-14 15:43:47,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 15:43:47,892 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-14 15:43:47,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-14 15:43:47,896 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-14 15:43:47,897 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-14 15:43:47,897 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-14 15:43:47,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:47,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:47,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:43:47,898 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:47,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:47,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1717139950, now seen corresponding path program 1 times [2024-06-14 15:43:47,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:47,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779491939] [2024-06-14 15:43:47,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:47,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:51,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:51,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779491939] [2024-06-14 15:43:51,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779491939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:51,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:51,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:43:51,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693670035] [2024-06-14 15:43:51,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:51,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:43:51,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:51,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:43:51,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:43:51,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:43:51,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:51,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:51,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:43:51,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:51,676 INFO L124 PetriNetUnfolderBase]: 186/342 cut-off events. [2024-06-14 15:43:51,677 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-06-14 15:43:51,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 342 events. 186/342 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1273 event pairs, 94 based on Foata normal form. 2/341 useless extension candidates. Maximal degree in co-relation 771. Up to 319 conditions per place. [2024-06-14 15:43:51,683 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 28 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-14 15:43:51,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 165 flow [2024-06-14 15:43:51,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:43:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:43:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-14 15:43:51,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2024-06-14 15:43:51,687 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 67 transitions. [2024-06-14 15:43:51,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 165 flow [2024-06-14 15:43:51,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:43:51,691 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-14 15:43:51,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-14 15:43:51,692 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-14 15:43:51,692 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-14 15:43:51,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:51,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:51,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:51,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:43:51,693 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:51,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1683688252, now seen corresponding path program 1 times [2024-06-14 15:43:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272247575] [2024-06-14 15:43:51,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:54,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:54,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272247575] [2024-06-14 15:43:54,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272247575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:54,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:54,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:43:54,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315031496] [2024-06-14 15:43:54,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:54,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:43:54,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:54,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:43:54,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:43:54,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:43:54,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 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-14 15:43:54,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:54,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:43:54,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:55,053 INFO L124 PetriNetUnfolderBase]: 183/337 cut-off events. [2024-06-14 15:43:55,053 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-06-14 15:43:55,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 337 events. 183/337 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1246 event pairs, 73 based on Foata normal form. 2/337 useless extension candidates. Maximal degree in co-relation 843. Up to 305 conditions per place. [2024-06-14 15:43:55,056 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 32 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-14 15:43:55,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 213 flow [2024-06-14 15:43:55,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:43:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:43:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-06-14 15:43:55,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50625 [2024-06-14 15:43:55,059 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 81 transitions. [2024-06-14 15:43:55,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 213 flow [2024-06-14 15:43:55,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 204 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 15:43:55,062 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-14 15:43:55,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-14 15:43:55,064 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-14 15:43:55,064 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-14 15:43:55,065 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-14 15:43:55,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:55,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:55,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:43:55,065 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:55,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:55,066 INFO L85 PathProgramCache]: Analyzing trace with hash 654729215, now seen corresponding path program 1 times [2024-06-14 15:43:55,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:55,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105834437] [2024-06-14 15:43:55,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:55,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:58,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:58,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105834437] [2024-06-14 15:43:58,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105834437] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:58,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:58,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:43:58,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169851516] [2024-06-14 15:43:58,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:58,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:43:58,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:58,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:43:58,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:43:58,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:43:58,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:58,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:58,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:43:58,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:59,315 INFO L124 PetriNetUnfolderBase]: 180/332 cut-off events. [2024-06-14 15:43:59,315 INFO L125 PetriNetUnfolderBase]: For 332/332 co-relation queries the response was YES. [2024-06-14 15:43:59,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 332 events. 180/332 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1216 event pairs, 52 based on Foata normal form. 2/332 useless extension candidates. Maximal degree in co-relation 910. Up to 291 conditions per place. [2024-06-14 15:43:59,317 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 9 changer transitions 0/48 dead transitions. [2024-06-14 15:43:59,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 261 flow [2024-06-14 15:43:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:43:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:43:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-14 15:43:59,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-06-14 15:43:59,321 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 6 states and 95 transitions. [2024-06-14 15:43:59,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 261 flow [2024-06-14 15:43:59,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 246 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 15:43:59,324 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 145 flow [2024-06-14 15:43:59,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2024-06-14 15:43:59,325 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-14 15:43:59,325 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 145 flow [2024-06-14 15:43:59,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:59,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:59,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:59,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:43:59,326 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:59,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:59,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1621724491, now seen corresponding path program 1 times [2024-06-14 15:43:59,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:59,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840143183] [2024-06-14 15:43:59,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:59,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:05,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:05,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840143183] [2024-06-14 15:44:05,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840143183] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:05,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:44:05,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841878119] [2024-06-14 15:44:05,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:05,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:44:05,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:05,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:44:05,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:44:05,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:44:05,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 145 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-14 15:44:05,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:05,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:44:05,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:05,360 INFO L124 PetriNetUnfolderBase]: 137/284 cut-off events. [2024-06-14 15:44:05,360 INFO L125 PetriNetUnfolderBase]: For 406/406 co-relation queries the response was YES. [2024-06-14 15:44:05,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 284 events. 137/284 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1111 event pairs, 42 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 816. Up to 243 conditions per place. [2024-06-14 15:44:05,362 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 27 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2024-06-14 15:44:05,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 229 flow [2024-06-14 15:44:05,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:44:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:44:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-06-14 15:44:05,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-06-14 15:44:05,364 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 145 flow. Second operand 5 states and 74 transitions. [2024-06-14 15:44:05,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 229 flow [2024-06-14 15:44:05,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 208 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:44:05,369 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 151 flow [2024-06-14 15:44:05,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2024-06-14 15:44:05,374 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2024-06-14 15:44:05,374 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 151 flow [2024-06-14 15:44:05,374 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-14 15:44:05,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:05,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:05,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:44:05,376 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:05,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:05,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2129581982, now seen corresponding path program 1 times [2024-06-14 15:44:05,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:05,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687303385] [2024-06-14 15:44:05,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:05,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:10,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:10,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687303385] [2024-06-14 15:44:10,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687303385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:10,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:10,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:44:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870337159] [2024-06-14 15:44:10,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:10,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:44:10,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:10,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:44:10,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:44:10,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:44:10,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 151 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:10,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:10,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:44:10,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:10,806 INFO L124 PetriNetUnfolderBase]: 174/321 cut-off events. [2024-06-14 15:44:10,806 INFO L125 PetriNetUnfolderBase]: For 646/646 co-relation queries the response was YES. [2024-06-14 15:44:10,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 321 events. 174/321 cut-off events. For 646/646 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1150 event pairs, 29 based on Foata normal form. 4/323 useless extension candidates. Maximal degree in co-relation 989. Up to 262 conditions per place. [2024-06-14 15:44:10,808 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 38 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2024-06-14 15:44:10,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 281 flow [2024-06-14 15:44:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:44:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:44:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-14 15:44:10,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-14 15:44:10,810 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 151 flow. Second operand 7 states and 104 transitions. [2024-06-14 15:44:10,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 281 flow [2024-06-14 15:44:10,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 270 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 15:44:10,811 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 154 flow [2024-06-14 15:44:10,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2024-06-14 15:44:10,812 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2024-06-14 15:44:10,812 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 154 flow [2024-06-14 15:44:10,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:10,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:10,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:10,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:44:10,813 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:10,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:10,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1276874622, now seen corresponding path program 1 times [2024-06-14 15:44:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:10,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548852851] [2024-06-14 15:44:10,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:10,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:18,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-14 15:44:18,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:18,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548852851] [2024-06-14 15:44:18,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548852851] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:18,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:18,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:44:18,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260406519] [2024-06-14 15:44:18,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:18,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:44:18,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:18,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:44:18,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:44:18,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:44:18,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 154 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-14 15:44:18,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:18,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:44:18,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:18,761 INFO L124 PetriNetUnfolderBase]: 131/271 cut-off events. [2024-06-14 15:44:18,761 INFO L125 PetriNetUnfolderBase]: For 682/682 co-relation queries the response was YES. [2024-06-14 15:44:18,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 271 events. 131/271 cut-off events. For 682/682 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1023 event pairs, 37 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 856. Up to 229 conditions per place. [2024-06-14 15:44:18,763 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 27 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2024-06-14 15:44:18,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 246 flow [2024-06-14 15:44:18,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:44:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:44:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-14 15:44:18,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2024-06-14 15:44:18,765 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 154 flow. Second operand 6 states and 85 transitions. [2024-06-14 15:44:18,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 246 flow [2024-06-14 15:44:18,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 220 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 15:44:18,767 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 161 flow [2024-06-14 15:44:18,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-06-14 15:44:18,768 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-14 15:44:18,768 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 161 flow [2024-06-14 15:44:18,768 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-14 15:44:18,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:18,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:18,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:44:18,769 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:18,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2075778054, now seen corresponding path program 1 times [2024-06-14 15:44:18,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:18,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143224846] [2024-06-14 15:44:18,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:18,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:24,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:24,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143224846] [2024-06-14 15:44:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143224846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:24,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:24,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:44:24,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24813837] [2024-06-14 15:44:24,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:24,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:44:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:24,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:44:24,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:44:24,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:44:24,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 161 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:24,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:24,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:44:24,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:24,400 INFO L124 PetriNetUnfolderBase]: 173/320 cut-off events. [2024-06-14 15:44:24,400 INFO L125 PetriNetUnfolderBase]: For 987/987 co-relation queries the response was YES. [2024-06-14 15:44:24,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 320 events. 173/320 cut-off events. For 987/987 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1136 event pairs, 44 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 1072. Up to 294 conditions per place. [2024-06-14 15:44:24,402 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 35 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-14 15:44:24,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 277 flow [2024-06-14 15:44:24,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:44:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:44:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-06-14 15:44:24,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:44:24,404 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 161 flow. Second operand 6 states and 78 transitions. [2024-06-14 15:44:24,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 277 flow [2024-06-14 15:44:24,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 260 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:44:24,405 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 177 flow [2024-06-14 15:44:24,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-06-14 15:44:24,407 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-14 15:44:24,407 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 177 flow [2024-06-14 15:44:24,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:24,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:24,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:24,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:44:24,408 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:24,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash 595932692, now seen corresponding path program 2 times [2024-06-14 15:44:24,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:24,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753959719] [2024-06-14 15:44:24,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:24,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:30,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:30,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753959719] [2024-06-14 15:44:30,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753959719] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:30,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:30,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:44:30,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452227948] [2024-06-14 15:44:30,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:30,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:44:30,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:30,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:44:30,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:44:30,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:44:30,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 177 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:30,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:30,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:44:30,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:30,530 INFO L124 PetriNetUnfolderBase]: 171/318 cut-off events. [2024-06-14 15:44:30,531 INFO L125 PetriNetUnfolderBase]: For 1232/1235 co-relation queries the response was YES. [2024-06-14 15:44:30,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 318 events. 171/318 cut-off events. For 1232/1235 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1155 event pairs, 48 based on Foata normal form. 3/318 useless extension candidates. Maximal degree in co-relation 1120. Up to 285 conditions per place. [2024-06-14 15:44:30,533 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 31 selfloop transitions, 11 changer transitions 0/45 dead transitions. [2024-06-14 15:44:30,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 287 flow [2024-06-14 15:44:30,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:44:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:44:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-06-14 15:44:30,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010416666666667 [2024-06-14 15:44:30,535 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 177 flow. Second operand 6 states and 77 transitions. [2024-06-14 15:44:30,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 287 flow [2024-06-14 15:44:30,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 270 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:44:30,538 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 203 flow [2024-06-14 15:44:30,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2024-06-14 15:44:30,539 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 19 predicate places. [2024-06-14 15:44:30,539 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 203 flow [2024-06-14 15:44:30,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:30,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:30,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:30,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:44:30,540 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:30,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:30,540 INFO L85 PathProgramCache]: Analyzing trace with hash -103213844, now seen corresponding path program 1 times [2024-06-14 15:44:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:30,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145326139] [2024-06-14 15:44:30,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:30,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:36,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:36,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145326139] [2024-06-14 15:44:36,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145326139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:36,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:36,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:44:36,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867559021] [2024-06-14 15:44:36,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:36,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:44:36,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:36,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:44:36,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:44:36,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:44:36,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 203 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-14 15:44:36,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:36,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:44:36,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:36,551 INFO L124 PetriNetUnfolderBase]: 189/352 cut-off events. [2024-06-14 15:44:36,551 INFO L125 PetriNetUnfolderBase]: For 1599/1599 co-relation queries the response was YES. [2024-06-14 15:44:36,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1327 conditions, 352 events. 189/352 cut-off events. For 1599/1599 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1305 event pairs, 44 based on Foata normal form. 2/352 useless extension candidates. Maximal degree in co-relation 1302. Up to 301 conditions per place. [2024-06-14 15:44:36,554 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 42 selfloop transitions, 16 changer transitions 0/61 dead transitions. [2024-06-14 15:44:36,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 405 flow [2024-06-14 15:44:36,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 15:44:36,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2024-06-14 15:44:36,556 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 203 flow. Second operand 8 states and 103 transitions. [2024-06-14 15:44:36,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 405 flow [2024-06-14 15:44:36,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 374 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 15:44:36,558 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 277 flow [2024-06-14 15:44:36,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=277, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-06-14 15:44:36,559 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2024-06-14 15:44:36,559 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 277 flow [2024-06-14 15:44:36,559 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-14 15:44:36,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:36,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:36,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:44:36,560 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:36,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:36,560 INFO L85 PathProgramCache]: Analyzing trace with hash 75241350, now seen corresponding path program 2 times [2024-06-14 15:44:36,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:36,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590871248] [2024-06-14 15:44:36,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:36,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:42,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:42,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590871248] [2024-06-14 15:44:42,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590871248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:42,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:42,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:44:42,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667426151] [2024-06-14 15:44:42,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:42,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:44:42,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:42,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:44:42,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:44:42,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:44:42,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 277 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-14 15:44:42,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:42,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:44:42,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:43,219 INFO L124 PetriNetUnfolderBase]: 195/364 cut-off events. [2024-06-14 15:44:43,219 INFO L125 PetriNetUnfolderBase]: For 2027/2027 co-relation queries the response was YES. [2024-06-14 15:44:43,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 364 events. 195/364 cut-off events. For 2027/2027 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1378 event pairs, 43 based on Foata normal form. 2/364 useless extension candidates. Maximal degree in co-relation 1451. Up to 303 conditions per place. [2024-06-14 15:44:43,223 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 42 selfloop transitions, 18 changer transitions 0/63 dead transitions. [2024-06-14 15:44:43,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 63 transitions, 453 flow [2024-06-14 15:44:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:44:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:44:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-14 15:44:43,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-14 15:44:43,224 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 277 flow. Second operand 7 states and 92 transitions. [2024-06-14 15:44:43,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 63 transitions, 453 flow [2024-06-14 15:44:43,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 429 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 15:44:43,227 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 318 flow [2024-06-14 15:44:43,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-06-14 15:44:43,228 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 29 predicate places. [2024-06-14 15:44:43,228 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 318 flow [2024-06-14 15:44:43,228 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-14 15:44:43,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:43,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:43,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:44:43,228 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:43,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:43,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1087392359, now seen corresponding path program 1 times [2024-06-14 15:44:43,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:43,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178763769] [2024-06-14 15:44:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:43,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:52,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:52,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178763769] [2024-06-14 15:44:52,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178763769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:52,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:52,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:44:52,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610770052] [2024-06-14 15:44:52,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:52,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:44:52,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:52,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:44:52,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:44:52,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:44:52,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 318 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-14 15:44:52,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:52,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:44:52,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:52,523 INFO L124 PetriNetUnfolderBase]: 198/369 cut-off events. [2024-06-14 15:44:52,523 INFO L125 PetriNetUnfolderBase]: For 2412/2412 co-relation queries the response was YES. [2024-06-14 15:44:52,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 369 events. 198/369 cut-off events. For 2412/2412 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1396 event pairs, 42 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 1548. Up to 330 conditions per place. [2024-06-14 15:44:52,525 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 47 selfloop transitions, 12 changer transitions 0/62 dead transitions. [2024-06-14 15:44:52,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 476 flow [2024-06-14 15:44:52,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:44:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:44:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2024-06-14 15:44:52,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2024-06-14 15:44:52,527 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 318 flow. Second operand 7 states and 88 transitions. [2024-06-14 15:44:52,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 476 flow [2024-06-14 15:44:52,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 62 transitions, 433 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 15:44:52,531 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 318 flow [2024-06-14 15:44:52,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-06-14 15:44:52,532 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2024-06-14 15:44:52,532 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 318 flow [2024-06-14 15:44:52,532 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-14 15:44:52,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:52,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:52,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:44:52,532 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:52,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:52,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1087392142, now seen corresponding path program 3 times [2024-06-14 15:44:52,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:52,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602025075] [2024-06-14 15:44:52,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:58,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:58,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602025075] [2024-06-14 15:44:58,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602025075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:58,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:58,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:44:58,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759340372] [2024-06-14 15:44:58,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:58,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:44:58,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:58,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:44:58,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:44:58,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:44:58,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 318 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-14 15:44:58,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:58,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:44:58,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:58,474 INFO L124 PetriNetUnfolderBase]: 204/381 cut-off events. [2024-06-14 15:44:58,474 INFO L125 PetriNetUnfolderBase]: For 2402/2402 co-relation queries the response was YES. [2024-06-14 15:44:58,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1599 conditions, 381 events. 204/381 cut-off events. For 2402/2402 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1460 event pairs, 44 based on Foata normal form. 2/381 useless extension candidates. Maximal degree in co-relation 1569. Up to 307 conditions per place. [2024-06-14 15:44:58,477 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 42 selfloop transitions, 20 changer transitions 0/65 dead transitions. [2024-06-14 15:44:58,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 65 transitions, 490 flow [2024-06-14 15:44:58,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:44:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:44:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-14 15:44:58,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-14 15:44:58,478 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 318 flow. Second operand 7 states and 92 transitions. [2024-06-14 15:44:58,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 65 transitions, 490 flow [2024-06-14 15:44:58,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 463 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:44:58,482 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 356 flow [2024-06-14 15:44:58,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-06-14 15:44:58,483 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 33 predicate places. [2024-06-14 15:44:58,483 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 356 flow [2024-06-14 15:44:58,483 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-14 15:44:58,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:58,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:58,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:44:58,483 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:58,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:58,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1294045799, now seen corresponding path program 2 times [2024-06-14 15:44:58,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:58,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74321128] [2024-06-14 15:44:58,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:58,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:06,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:06,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74321128] [2024-06-14 15:45:06,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74321128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:06,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:06,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:45:06,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533129168] [2024-06-14 15:45:06,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:06,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:45:06,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:06,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:45:06,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:45:06,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:45:06,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 356 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-14 15:45:06,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:06,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:45:06,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:06,751 INFO L124 PetriNetUnfolderBase]: 207/387 cut-off events. [2024-06-14 15:45:06,751 INFO L125 PetriNetUnfolderBase]: For 2859/2862 co-relation queries the response was YES. [2024-06-14 15:45:06,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1708 conditions, 387 events. 207/387 cut-off events. For 2859/2862 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1487 event pairs, 45 based on Foata normal form. 3/386 useless extension candidates. Maximal degree in co-relation 1677. Up to 339 conditions per place. [2024-06-14 15:45:06,754 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 46 selfloop transitions, 15 changer transitions 0/64 dead transitions. [2024-06-14 15:45:06,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 516 flow [2024-06-14 15:45:06,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:45:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:45:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-14 15:45:06,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38839285714285715 [2024-06-14 15:45:06,755 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 356 flow. Second operand 7 states and 87 transitions. [2024-06-14 15:45:06,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 516 flow [2024-06-14 15:45:06,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 467 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 15:45:06,758 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 360 flow [2024-06-14 15:45:06,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=360, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2024-06-14 15:45:06,759 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-14 15:45:06,759 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 360 flow [2024-06-14 15:45:06,793 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-14 15:45:06,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:06,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:06,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:45:06,793 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:06,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:06,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1294045582, now seen corresponding path program 4 times [2024-06-14 15:45:06,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:06,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994132478] [2024-06-14 15:45:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:13,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:13,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994132478] [2024-06-14 15:45:13,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994132478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:13,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:13,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:45:13,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441612129] [2024-06-14 15:45:13,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:13,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:45:13,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:13,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:45:13,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:45:13,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:45:13,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 360 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-14 15:45:13,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:13,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:45:13,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:13,380 INFO L124 PetriNetUnfolderBase]: 208/391 cut-off events. [2024-06-14 15:45:13,381 INFO L125 PetriNetUnfolderBase]: For 3213/3216 co-relation queries the response was YES. [2024-06-14 15:45:13,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 391 events. 208/391 cut-off events. For 3213/3216 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1517 event pairs, 50 based on Foata normal form. 2/388 useless extension candidates. Maximal degree in co-relation 1710. Up to 302 conditions per place. [2024-06-14 15:45:13,383 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 40 selfloop transitions, 24 changer transitions 0/67 dead transitions. [2024-06-14 15:45:13,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 534 flow [2024-06-14 15:45:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:45:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:45:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-14 15:45:13,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:45:13,385 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 360 flow. Second operand 7 states and 91 transitions. [2024-06-14 15:45:13,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 534 flow [2024-06-14 15:45:13,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 497 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 15:45:13,388 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 400 flow [2024-06-14 15:45:13,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=400, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2024-06-14 15:45:13,390 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 37 predicate places. [2024-06-14 15:45:13,390 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 400 flow [2024-06-14 15:45:13,390 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-14 15:45:13,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:13,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:13,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:45:13,391 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:13,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:13,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1294312709, now seen corresponding path program 3 times [2024-06-14 15:45:13,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:13,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434543282] [2024-06-14 15:45:13,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:13,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:20,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-14 15:45:20,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434543282] [2024-06-14 15:45:20,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434543282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:20,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:20,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:45:20,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436524247] [2024-06-14 15:45:20,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:20,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:45:20,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:20,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:45:20,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:45:20,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:45:20,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 400 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-14 15:45:20,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:20,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:45:20,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:20,891 INFO L124 PetriNetUnfolderBase]: 206/388 cut-off events. [2024-06-14 15:45:20,891 INFO L125 PetriNetUnfolderBase]: For 3553/3556 co-relation queries the response was YES. [2024-06-14 15:45:20,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 388 events. 206/388 cut-off events. For 3553/3556 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1506 event pairs, 45 based on Foata normal form. 3/387 useless extension candidates. Maximal degree in co-relation 1766. Up to 329 conditions per place. [2024-06-14 15:45:20,894 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 47 selfloop transitions, 20 changer transitions 0/70 dead transitions. [2024-06-14 15:45:20,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 586 flow [2024-06-14 15:45:20,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:45:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:45:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2024-06-14 15:45:20,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2024-06-14 15:45:20,895 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 400 flow. Second operand 7 states and 88 transitions. [2024-06-14 15:45:20,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 586 flow [2024-06-14 15:45:20,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 525 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 15:45:20,898 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 427 flow [2024-06-14 15:45:20,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=427, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2024-06-14 15:45:20,899 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 40 predicate places. [2024-06-14 15:45:20,899 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 427 flow [2024-06-14 15:45:20,899 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-14 15:45:20,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:20,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:20,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:45:20,900 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:20,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:20,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1294322629, now seen corresponding path program 1 times [2024-06-14 15:45:20,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:20,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617885244] [2024-06-14 15:45:20,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:20,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:28,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-14 15:45:28,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:28,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617885244] [2024-06-14 15:45:28,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617885244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:28,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:28,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:28,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284495447] [2024-06-14 15:45:28,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:28,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:28,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:28,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:28,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:29,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:45:29,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 427 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-14 15:45:29,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:29,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:45:29,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:29,330 INFO L124 PetriNetUnfolderBase]: 189/367 cut-off events. [2024-06-14 15:45:29,330 INFO L125 PetriNetUnfolderBase]: For 3712/3717 co-relation queries the response was YES. [2024-06-14 15:45:29,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 367 events. 189/367 cut-off events. For 3712/3717 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1461 event pairs, 43 based on Foata normal form. 6/370 useless extension candidates. Maximal degree in co-relation 1656. Up to 311 conditions per place. [2024-06-14 15:45:29,333 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 49 selfloop transitions, 12 changer transitions 0/72 dead transitions. [2024-06-14 15:45:29,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 72 transitions, 579 flow [2024-06-14 15:45:29,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:45:29,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:45:29,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-14 15:45:29,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-14 15:45:29,335 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 427 flow. Second operand 8 states and 102 transitions. [2024-06-14 15:45:29,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 72 transitions, 579 flow [2024-06-14 15:45:29,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 72 transitions, 549 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 15:45:29,339 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 440 flow [2024-06-14 15:45:29,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=440, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2024-06-14 15:45:29,339 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2024-06-14 15:45:29,340 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 440 flow [2024-06-14 15:45:29,340 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-14 15:45:29,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:29,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:29,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:45:29,340 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:29,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:29,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1962604071, now seen corresponding path program 1 times [2024-06-14 15:45:29,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:29,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056142114] [2024-06-14 15:45:29,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:29,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:35,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:35,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056142114] [2024-06-14 15:45:35,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056142114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:35,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:35,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:35,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659526452] [2024-06-14 15:45:35,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:35,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:35,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:35,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:35,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:35,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:45:35,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 440 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-14 15:45:35,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:35,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:45:35,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:35,643 INFO L124 PetriNetUnfolderBase]: 202/381 cut-off events. [2024-06-14 15:45:35,643 INFO L125 PetriNetUnfolderBase]: For 4016/4016 co-relation queries the response was YES. [2024-06-14 15:45:35,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 381 events. 202/381 cut-off events. For 4016/4016 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1474 event pairs, 40 based on Foata normal form. 1/380 useless extension candidates. Maximal degree in co-relation 1797. Up to 312 conditions per place. [2024-06-14 15:45:35,646 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 61 selfloop transitions, 18 changer transitions 0/82 dead transitions. [2024-06-14 15:45:35,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 82 transitions, 670 flow [2024-06-14 15:45:35,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:45:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:45:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-14 15:45:35,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:45:35,648 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 440 flow. Second operand 8 states and 104 transitions. [2024-06-14 15:45:35,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 82 transitions, 670 flow [2024-06-14 15:45:35,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 82 transitions, 621 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 15:45:35,652 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 460 flow [2024-06-14 15:45:35,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=460, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2024-06-14 15:45:35,653 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 46 predicate places. [2024-06-14 15:45:35,653 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 460 flow [2024-06-14 15:45:35,653 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-14 15:45:35,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:35,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:35,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:45:35,654 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:35,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:35,654 INFO L85 PathProgramCache]: Analyzing trace with hash -650753415, now seen corresponding path program 1 times [2024-06-14 15:45:35,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:35,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740826825] [2024-06-14 15:45:35,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:35,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:44,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:44,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740826825] [2024-06-14 15:45:44,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740826825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:44,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:44,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:44,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486491166] [2024-06-14 15:45:44,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:44,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:44,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:44,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:44,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:44,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:45:44,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 460 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-14 15:45:44,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:44,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:45:44,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:44,475 INFO L124 PetriNetUnfolderBase]: 208/391 cut-off events. [2024-06-14 15:45:44,475 INFO L125 PetriNetUnfolderBase]: For 4713/4713 co-relation queries the response was YES. [2024-06-14 15:45:44,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1929 conditions, 391 events. 208/391 cut-off events. For 4713/4713 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1525 event pairs, 39 based on Foata normal form. 2/391 useless extension candidates. Maximal degree in co-relation 1892. Up to 316 conditions per place. [2024-06-14 15:45:44,478 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 59 selfloop transitions, 21 changer transitions 0/83 dead transitions. [2024-06-14 15:45:44,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 83 transitions, 686 flow [2024-06-14 15:45:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:45:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:45:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 15:45:44,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2024-06-14 15:45:44,479 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 460 flow. Second operand 8 states and 103 transitions. [2024-06-14 15:45:44,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 83 transitions, 686 flow [2024-06-14 15:45:44,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 83 transitions, 633 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 15:45:44,484 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 486 flow [2024-06-14 15:45:44,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=486, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2024-06-14 15:45:44,484 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 48 predicate places. [2024-06-14 15:45:44,484 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 486 flow [2024-06-14 15:45:44,485 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-14 15:45:44,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:44,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:44,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:45:44,485 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:44,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:44,485 INFO L85 PathProgramCache]: Analyzing trace with hash -650580435, now seen corresponding path program 2 times [2024-06-14 15:45:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:44,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97621081] [2024-06-14 15:45:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:44,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:52,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:52,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97621081] [2024-06-14 15:45:52,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97621081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:52,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:52,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:52,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638892076] [2024-06-14 15:45:52,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:52,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:52,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:52,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:52,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:52,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:45:52,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 486 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-14 15:45:52,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:52,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:45:52,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:52,582 INFO L124 PetriNetUnfolderBase]: 214/401 cut-off events. [2024-06-14 15:45:52,582 INFO L125 PetriNetUnfolderBase]: For 5405/5405 co-relation queries the response was YES. [2024-06-14 15:45:52,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2059 conditions, 401 events. 214/401 cut-off events. For 5405/5405 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1595 event pairs, 41 based on Foata normal form. 2/401 useless extension candidates. Maximal degree in co-relation 2021. Up to 319 conditions per place. [2024-06-14 15:45:52,585 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 58 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2024-06-14 15:45:52,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 84 transitions, 716 flow [2024-06-14 15:45:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:45:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:45:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 15:45:52,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2024-06-14 15:45:52,588 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 486 flow. Second operand 8 states and 103 transitions. [2024-06-14 15:45:52,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 84 transitions, 716 flow [2024-06-14 15:45:52,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 84 transitions, 661 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-14 15:45:52,600 INFO L231 Difference]: Finished difference. Result has 81 places, 72 transitions, 519 flow [2024-06-14 15:45:52,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=519, PETRI_PLACES=81, PETRI_TRANSITIONS=72} [2024-06-14 15:45:52,601 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 50 predicate places. [2024-06-14 15:45:52,601 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 72 transitions, 519 flow [2024-06-14 15:45:52,601 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-14 15:45:52,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:52,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:52,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:45:52,602 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:52,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:52,602 INFO L85 PathProgramCache]: Analyzing trace with hash -650573925, now seen corresponding path program 3 times [2024-06-14 15:45:52,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:52,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071787437] [2024-06-14 15:45:52,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:52,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:59,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:59,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071787437] [2024-06-14 15:45:59,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071787437] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:59,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:59,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443464785] [2024-06-14 15:45:59,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:59,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:59,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:59,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:59,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:59,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:59,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 519 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:59,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:59,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:59,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:00,295 INFO L124 PetriNetUnfolderBase]: 217/406 cut-off events. [2024-06-14 15:46:00,295 INFO L125 PetriNetUnfolderBase]: For 5913/5913 co-relation queries the response was YES. [2024-06-14 15:46:00,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2158 conditions, 406 events. 217/406 cut-off events. For 5913/5913 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1603 event pairs, 41 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 2119. Up to 308 conditions per place. [2024-06-14 15:46:00,302 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 53 selfloop transitions, 29 changer transitions 0/85 dead transitions. [2024-06-14 15:46:00,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 85 transitions, 737 flow [2024-06-14 15:46:00,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-14 15:46:00,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37109375 [2024-06-14 15:46:00,304 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 519 flow. Second operand 8 states and 95 transitions. [2024-06-14 15:46:00,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 85 transitions, 737 flow [2024-06-14 15:46:00,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 85 transitions, 671 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 15:46:00,332 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 540 flow [2024-06-14 15:46:00,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=540, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2024-06-14 15:46:00,332 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 52 predicate places. [2024-06-14 15:46:00,332 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 540 flow [2024-06-14 15:46:00,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:00,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:00,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:00,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:46:00,333 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:00,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:00,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1957835527, now seen corresponding path program 1 times [2024-06-14 15:46:00,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:00,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076376002] [2024-06-14 15:46:00,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:00,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:07,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-14 15:46:07,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:07,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076376002] [2024-06-14 15:46:07,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076376002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:07,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:07,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:07,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927881169] [2024-06-14 15:46:07,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:07,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:07,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:07,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:07,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:07,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:46:07,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 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-14 15:46:07,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:07,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:46:07,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:07,960 INFO L124 PetriNetUnfolderBase]: 220/411 cut-off events. [2024-06-14 15:46:07,960 INFO L125 PetriNetUnfolderBase]: For 6359/6359 co-relation queries the response was YES. [2024-06-14 15:46:07,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 411 events. 220/411 cut-off events. For 6359/6359 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1621 event pairs, 38 based on Foata normal form. 1/410 useless extension candidates. Maximal degree in co-relation 2196. Up to 365 conditions per place. [2024-06-14 15:46:07,965 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 70 selfloop transitions, 14 changer transitions 0/87 dead transitions. [2024-06-14 15:46:07,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 87 transitions, 758 flow [2024-06-14 15:46:07,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 15:46:07,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2024-06-14 15:46:07,967 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 540 flow. Second operand 8 states and 98 transitions. [2024-06-14 15:46:07,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 87 transitions, 758 flow [2024-06-14 15:46:07,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 87 transitions, 687 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:46:07,974 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 524 flow [2024-06-14 15:46:07,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=524, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2024-06-14 15:46:07,975 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2024-06-14 15:46:07,975 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 524 flow [2024-06-14 15:46:07,975 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-14 15:46:07,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:07,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:07,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:46:07,975 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:07,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1785114997, now seen corresponding path program 2 times [2024-06-14 15:46:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:07,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754730434] [2024-06-14 15:46:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:07,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:16,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:16,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754730434] [2024-06-14 15:46:16,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754730434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:16,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:16,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:16,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230002069] [2024-06-14 15:46:16,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:16,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:16,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:16,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:16,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:16,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:46:16,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 524 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-14 15:46:16,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:16,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:46:16,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:16,551 INFO L124 PetriNetUnfolderBase]: 236/438 cut-off events. [2024-06-14 15:46:16,552 INFO L125 PetriNetUnfolderBase]: For 7672/7675 co-relation queries the response was YES. [2024-06-14 15:46:16,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2421 conditions, 438 events. 236/438 cut-off events. For 7672/7675 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1748 event pairs, 41 based on Foata normal form. 4/438 useless extension candidates. Maximal degree in co-relation 2380. Up to 342 conditions per place. [2024-06-14 15:46:16,555 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 66 selfloop transitions, 27 changer transitions 0/96 dead transitions. [2024-06-14 15:46:16,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 96 transitions, 902 flow [2024-06-14 15:46:16,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:46:16,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-14 15:46:16,559 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 524 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:46:16,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 96 transitions, 902 flow [2024-06-14 15:46:16,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 96 transitions, 863 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:46:16,565 INFO L231 Difference]: Finished difference. Result has 87 places, 82 transitions, 608 flow [2024-06-14 15:46:16,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=608, PETRI_PLACES=87, PETRI_TRANSITIONS=82} [2024-06-14 15:46:16,566 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-14 15:46:16,566 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 82 transitions, 608 flow [2024-06-14 15:46:16,566 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-14 15:46:16,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:16,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:16,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:46:16,567 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:16,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:16,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1785115245, now seen corresponding path program 4 times [2024-06-14 15:46:16,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:16,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261932830] [2024-06-14 15:46:16,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:16,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:24,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:24,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261932830] [2024-06-14 15:46:24,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261932830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:24,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:24,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:24,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661064109] [2024-06-14 15:46:24,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:24,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:24,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:24,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:24,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:24,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:46:24,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 82 transitions, 608 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-14 15:46:24,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:24,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:46:24,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:24,385 INFO L124 PetriNetUnfolderBase]: 244/451 cut-off events. [2024-06-14 15:46:24,385 INFO L125 PetriNetUnfolderBase]: For 8559/8562 co-relation queries the response was YES. [2024-06-14 15:46:24,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2606 conditions, 451 events. 244/451 cut-off events. For 8559/8562 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1811 event pairs, 47 based on Foata normal form. 1/447 useless extension candidates. Maximal degree in co-relation 2564. Up to 318 conditions per place. [2024-06-14 15:46:24,388 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 53 selfloop transitions, 41 changer transitions 0/97 dead transitions. [2024-06-14 15:46:24,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 97 transitions, 936 flow [2024-06-14 15:46:24,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-14 15:46:24,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:46:24,390 INFO L175 Difference]: Start difference. First operand has 87 places, 82 transitions, 608 flow. Second operand 8 states and 104 transitions. [2024-06-14 15:46:24,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 97 transitions, 936 flow [2024-06-14 15:46:24,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 97 transitions, 906 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 15:46:24,398 INFO L231 Difference]: Finished difference. Result has 93 places, 87 transitions, 759 flow [2024-06-14 15:46:24,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=759, PETRI_PLACES=93, PETRI_TRANSITIONS=87} [2024-06-14 15:46:24,399 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 62 predicate places. [2024-06-14 15:46:24,399 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 87 transitions, 759 flow [2024-06-14 15:46:24,399 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-14 15:46:24,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:24,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:24,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:46:24,400 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:24,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:24,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1469286547, now seen corresponding path program 3 times [2024-06-14 15:46:24,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:24,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179305035] [2024-06-14 15:46:24,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:24,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:31,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:31,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179305035] [2024-06-14 15:46:31,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179305035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:31,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:31,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:31,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162694561] [2024-06-14 15:46:31,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:31,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:31,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:31,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:31,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:31,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:46:31,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 87 transitions, 759 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-14 15:46:31,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:31,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:46:31,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:31,482 INFO L124 PetriNetUnfolderBase]: 240/444 cut-off events. [2024-06-14 15:46:31,483 INFO L125 PetriNetUnfolderBase]: For 9274/9274 co-relation queries the response was YES. [2024-06-14 15:46:31,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 444 events. 240/444 cut-off events. For 9274/9274 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1788 event pairs, 42 based on Foata normal form. 2/444 useless extension candidates. Maximal degree in co-relation 2693. Up to 400 conditions per place. [2024-06-14 15:46:31,486 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 80 selfloop transitions, 13 changer transitions 0/96 dead transitions. [2024-06-14 15:46:31,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 96 transitions, 971 flow [2024-06-14 15:46:31,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 15:46:31,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37890625 [2024-06-14 15:46:31,487 INFO L175 Difference]: Start difference. First operand has 93 places, 87 transitions, 759 flow. Second operand 8 states and 97 transitions. [2024-06-14 15:46:31,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 96 transitions, 971 flow [2024-06-14 15:46:31,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 905 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-14 15:46:31,496 INFO L231 Difference]: Finished difference. Result has 97 places, 87 transitions, 725 flow [2024-06-14 15:46:31,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=725, PETRI_PLACES=97, PETRI_TRANSITIONS=87} [2024-06-14 15:46:31,497 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 66 predicate places. [2024-06-14 15:46:31,497 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 87 transitions, 725 flow [2024-06-14 15:46:31,497 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-14 15:46:31,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:31,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:31,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:46:31,497 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:31,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:31,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1460708909, now seen corresponding path program 5 times [2024-06-14 15:46:31,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:31,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590017033] [2024-06-14 15:46:31,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:31,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:38,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:38,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590017033] [2024-06-14 15:46:38,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590017033] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:38,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:38,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:38,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521904990] [2024-06-14 15:46:38,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:38,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:38,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:38,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:38,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:39,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:46:39,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 87 transitions, 725 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-14 15:46:39,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:39,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:46:39,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:39,384 INFO L124 PetriNetUnfolderBase]: 241/447 cut-off events. [2024-06-14 15:46:39,384 INFO L125 PetriNetUnfolderBase]: For 9510/9513 co-relation queries the response was YES. [2024-06-14 15:46:39,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 447 events. 241/447 cut-off events. For 9510/9513 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1802 event pairs, 46 based on Foata normal form. 2/444 useless extension candidates. Maximal degree in co-relation 2682. Up to 352 conditions per place. [2024-06-14 15:46:39,389 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 69 selfloop transitions, 27 changer transitions 0/99 dead transitions. [2024-06-14 15:46:39,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 99 transitions, 995 flow [2024-06-14 15:46:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:39,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-14 15:46:39,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-14 15:46:39,391 INFO L175 Difference]: Start difference. First operand has 97 places, 87 transitions, 725 flow. Second operand 8 states and 102 transitions. [2024-06-14 15:46:39,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 99 transitions, 995 flow [2024-06-14 15:46:39,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 99 transitions, 964 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:39,401 INFO L231 Difference]: Finished difference. Result has 98 places, 89 transitions, 788 flow [2024-06-14 15:46:39,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=788, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2024-06-14 15:46:39,402 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-14 15:46:39,402 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 788 flow [2024-06-14 15:46:39,402 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-14 15:46:39,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:39,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:39,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:46:39,402 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:39,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1785345637, now seen corresponding path program 4 times [2024-06-14 15:46:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:39,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840773800] [2024-06-14 15:46:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:46,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:46,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840773800] [2024-06-14 15:46:46,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840773800] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:46,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:46,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:46,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641917873] [2024-06-14 15:46:46,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:46,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:46,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:46,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:46,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:46,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:46:46,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 788 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-14 15:46:46,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:46,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:46:46,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:47,248 INFO L124 PetriNetUnfolderBase]: 239/444 cut-off events. [2024-06-14 15:46:47,249 INFO L125 PetriNetUnfolderBase]: For 9709/9712 co-relation queries the response was YES. [2024-06-14 15:46:47,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 444 events. 239/444 cut-off events. For 9709/9712 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1797 event pairs, 41 based on Foata normal form. 3/443 useless extension candidates. Maximal degree in co-relation 2715. Up to 391 conditions per place. [2024-06-14 15:46:47,252 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 80 selfloop transitions, 17 changer transitions 0/100 dead transitions. [2024-06-14 15:46:47,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 100 transitions, 1032 flow [2024-06-14 15:46:47,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:47,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 15:46:47,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37890625 [2024-06-14 15:46:47,253 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 788 flow. Second operand 8 states and 97 transitions. [2024-06-14 15:46:47,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 100 transitions, 1032 flow [2024-06-14 15:46:47,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 100 transitions, 948 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-14 15:46:47,263 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 771 flow [2024-06-14 15:46:47,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=771, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2024-06-14 15:46:47,264 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 69 predicate places. [2024-06-14 15:46:47,264 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 771 flow [2024-06-14 15:46:47,264 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-14 15:46:47,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:47,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:47,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:46:47,264 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:47,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1785345885, now seen corresponding path program 6 times [2024-06-14 15:46:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:47,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067950962] [2024-06-14 15:46:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:47,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:54,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:54,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067950962] [2024-06-14 15:46:54,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067950962] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:54,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:54,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172133279] [2024-06-14 15:46:54,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:54,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:54,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:54,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:54,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:55,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:46:55,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 771 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-14 15:46:55,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:55,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:46:55,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:55,289 INFO L124 PetriNetUnfolderBase]: 237/441 cut-off events. [2024-06-14 15:46:55,290 INFO L125 PetriNetUnfolderBase]: For 9826/9829 co-relation queries the response was YES. [2024-06-14 15:46:55,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2693 conditions, 441 events. 237/441 cut-off events. For 9826/9829 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1799 event pairs, 46 based on Foata normal form. 1/437 useless extension candidates. Maximal degree in co-relation 2644. Up to 340 conditions per place. [2024-06-14 15:46:55,293 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 68 selfloop transitions, 30 changer transitions 0/101 dead transitions. [2024-06-14 15:46:55,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 101 transitions, 1015 flow [2024-06-14 15:46:55,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-14 15:46:55,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:46:55,295 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 771 flow. Second operand 8 states and 104 transitions. [2024-06-14 15:46:55,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 101 transitions, 1015 flow [2024-06-14 15:46:55,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 101 transitions, 964 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 15:46:55,304 INFO L231 Difference]: Finished difference. Result has 102 places, 91 transitions, 785 flow [2024-06-14 15:46:55,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=785, PETRI_PLACES=102, PETRI_TRANSITIONS=91} [2024-06-14 15:46:55,305 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 71 predicate places. [2024-06-14 15:46:55,305 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 91 transitions, 785 flow [2024-06-14 15:46:55,305 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-14 15:46:55,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:55,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:55,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:46:55,306 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:55,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:55,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1469297459, now seen corresponding path program 1 times [2024-06-14 15:46:55,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:55,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033852209] [2024-06-14 15:46:55,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:55,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:03,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:03,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033852209] [2024-06-14 15:47:03,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033852209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:03,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:03,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:47:03,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751075742] [2024-06-14 15:47:03,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:03,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:47:03,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:03,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:47:03,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:47:03,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:47:03,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 91 transitions, 785 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-14 15:47:03,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:03,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:47:03,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:03,654 INFO L124 PetriNetUnfolderBase]: 221/420 cut-off events. [2024-06-14 15:47:03,655 INFO L125 PetriNetUnfolderBase]: For 10219/10224 co-relation queries the response was YES. [2024-06-14 15:47:03,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2566 conditions, 420 events. 221/420 cut-off events. For 10219/10224 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1708 event pairs, 39 based on Foata normal form. 7/424 useless extension candidates. Maximal degree in co-relation 2516. Up to 344 conditions per place. [2024-06-14 15:47:03,658 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 72 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2024-06-14 15:47:03,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 100 transitions, 975 flow [2024-06-14 15:47:03,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:47:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:47:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-14 15:47:03,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-14 15:47:03,659 INFO L175 Difference]: Start difference. First operand has 102 places, 91 transitions, 785 flow. Second operand 8 states and 102 transitions. [2024-06-14 15:47:03,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 100 transitions, 975 flow [2024-06-14 15:47:03,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 100 transitions, 860 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:47:03,668 INFO L231 Difference]: Finished difference. Result has 102 places, 91 transitions, 698 flow [2024-06-14 15:47:03,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=698, PETRI_PLACES=102, PETRI_TRANSITIONS=91} [2024-06-14 15:47:03,669 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 71 predicate places. [2024-06-14 15:47:03,669 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 91 transitions, 698 flow [2024-06-14 15:47:03,670 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-14 15:47:03,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:03,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:03,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:47:03,670 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:03,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash -711182526, now seen corresponding path program 1 times [2024-06-14 15:47:03,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:03,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753155141] [2024-06-14 15:47:03,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:03,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:10,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:10,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753155141] [2024-06-14 15:47:10,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753155141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:10,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:10,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:10,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572832261] [2024-06-14 15:47:10,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:10,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:10,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:10,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:10,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:10,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:47:10,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 91 transitions, 698 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-14 15:47:10,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:10,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:47:10,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:10,826 INFO L124 PetriNetUnfolderBase]: 237/442 cut-off events. [2024-06-14 15:47:10,827 INFO L125 PetriNetUnfolderBase]: For 10347/10347 co-relation queries the response was YES. [2024-06-14 15:47:10,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2624 conditions, 442 events. 237/442 cut-off events. For 10347/10347 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1790 event pairs, 36 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 2574. Up to 368 conditions per place. [2024-06-14 15:47:10,830 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 87 selfloop transitions, 20 changer transitions 0/110 dead transitions. [2024-06-14 15:47:10,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 110 transitions, 994 flow [2024-06-14 15:47:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:47:10,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 15:47:10,832 INFO L175 Difference]: Start difference. First operand has 102 places, 91 transitions, 698 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:47:10,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 110 transitions, 994 flow [2024-06-14 15:47:10,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 110 transitions, 964 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:47:10,842 INFO L231 Difference]: Finished difference. Result has 105 places, 93 transitions, 749 flow [2024-06-14 15:47:10,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=749, PETRI_PLACES=105, PETRI_TRANSITIONS=93} [2024-06-14 15:47:10,843 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 74 predicate places. [2024-06-14 15:47:10,843 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 93 transitions, 749 flow [2024-06-14 15:47:10,843 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-14 15:47:10,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:10,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:10,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:47:10,843 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:10,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:10,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1301482177, now seen corresponding path program 1 times [2024-06-14 15:47:10,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:10,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050035042] [2024-06-14 15:47:10,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:10,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:17,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:17,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050035042] [2024-06-14 15:47:17,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050035042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:17,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:17,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:17,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753820515] [2024-06-14 15:47:17,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:17,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:17,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:17,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:17,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:18,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:47:18,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 93 transitions, 749 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-14 15:47:18,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:18,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:47:18,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:18,471 INFO L124 PetriNetUnfolderBase]: 249/462 cut-off events. [2024-06-14 15:47:18,472 INFO L125 PetriNetUnfolderBase]: For 12379/12379 co-relation queries the response was YES. [2024-06-14 15:47:18,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 462 events. 249/462 cut-off events. For 12379/12379 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1895 event pairs, 35 based on Foata normal form. 4/464 useless extension candidates. Maximal degree in co-relation 2758. Up to 373 conditions per place. [2024-06-14 15:47:18,475 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 85 selfloop transitions, 24 changer transitions 0/112 dead transitions. [2024-06-14 15:47:18,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 112 transitions, 1069 flow [2024-06-14 15:47:18,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-14 15:47:18,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3993055555555556 [2024-06-14 15:47:18,476 INFO L175 Difference]: Start difference. First operand has 105 places, 93 transitions, 749 flow. Second operand 9 states and 115 transitions. [2024-06-14 15:47:18,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 112 transitions, 1069 flow [2024-06-14 15:47:18,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 112 transitions, 1004 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 15:47:18,505 INFO L231 Difference]: Finished difference. Result has 107 places, 96 transitions, 784 flow [2024-06-14 15:47:18,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=784, PETRI_PLACES=107, PETRI_TRANSITIONS=96} [2024-06-14 15:47:18,506 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 76 predicate places. [2024-06-14 15:47:18,506 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 96 transitions, 784 flow [2024-06-14 15:47:18,506 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-14 15:47:18,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:18,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:18,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:47:18,507 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:18,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:18,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1162953810, now seen corresponding path program 2 times [2024-06-14 15:47:18,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:18,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609830424] [2024-06-14 15:47:18,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:18,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:28,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:28,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609830424] [2024-06-14 15:47:28,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609830424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:28,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:28,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:28,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396841949] [2024-06-14 15:47:28,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:28,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:28,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:28,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:28,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:28,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:47:28,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 784 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-14 15:47:28,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:28,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:47:28,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:29,208 INFO L124 PetriNetUnfolderBase]: 252/469 cut-off events. [2024-06-14 15:47:29,209 INFO L125 PetriNetUnfolderBase]: For 12264/12264 co-relation queries the response was YES. [2024-06-14 15:47:29,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2930 conditions, 469 events. 252/469 cut-off events. For 12264/12264 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1926 event pairs, 35 based on Foata normal form. 1/468 useless extension candidates. Maximal degree in co-relation 2878. Up to 387 conditions per place. [2024-06-14 15:47:29,212 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 87 selfloop transitions, 23 changer transitions 0/113 dead transitions. [2024-06-14 15:47:29,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 1098 flow [2024-06-14 15:47:29,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 15:47:29,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-14 15:47:29,213 INFO L175 Difference]: Start difference. First operand has 107 places, 96 transitions, 784 flow. Second operand 9 states and 113 transitions. [2024-06-14 15:47:29,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 1098 flow [2024-06-14 15:47:29,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 113 transitions, 1020 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 15:47:29,225 INFO L231 Difference]: Finished difference. Result has 109 places, 98 transitions, 799 flow [2024-06-14 15:47:29,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=799, PETRI_PLACES=109, PETRI_TRANSITIONS=98} [2024-06-14 15:47:29,226 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 78 predicate places. [2024-06-14 15:47:29,226 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 98 transitions, 799 flow [2024-06-14 15:47:29,226 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-14 15:47:29,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:29,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:29,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:47:29,227 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:29,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash -91168189, now seen corresponding path program 2 times [2024-06-14 15:47:29,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:29,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833628878] [2024-06-14 15:47:29,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:35,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:35,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833628878] [2024-06-14 15:47:35,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833628878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:35,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:35,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:35,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846047368] [2024-06-14 15:47:35,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:35,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:35,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:35,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:35,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:35,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:47:35,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 98 transitions, 799 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:35,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:35,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:47:35,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:36,304 INFO L124 PetriNetUnfolderBase]: 264/489 cut-off events. [2024-06-14 15:47:36,304 INFO L125 PetriNetUnfolderBase]: For 14537/14537 co-relation queries the response was YES. [2024-06-14 15:47:36,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3047 conditions, 489 events. 264/489 cut-off events. For 14537/14537 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2032 event pairs, 37 based on Foata normal form. 4/491 useless extension candidates. Maximal degree in co-relation 2994. Up to 391 conditions per place. [2024-06-14 15:47:36,308 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 86 selfloop transitions, 26 changer transitions 0/115 dead transitions. [2024-06-14 15:47:36,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 115 transitions, 1139 flow [2024-06-14 15:47:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-14 15:47:36,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3993055555555556 [2024-06-14 15:47:36,309 INFO L175 Difference]: Start difference. First operand has 109 places, 98 transitions, 799 flow. Second operand 9 states and 115 transitions. [2024-06-14 15:47:36,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 115 transitions, 1139 flow [2024-06-14 15:47:36,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 1062 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 15:47:36,324 INFO L231 Difference]: Finished difference. Result has 111 places, 101 transitions, 834 flow [2024-06-14 15:47:36,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=834, PETRI_PLACES=111, PETRI_TRANSITIONS=101} [2024-06-14 15:47:36,325 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 80 predicate places. [2024-06-14 15:47:36,325 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 101 transitions, 834 flow [2024-06-14 15:47:36,325 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-14 15:47:36,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:36,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:36,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:47:36,326 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:36,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash -91168406, now seen corresponding path program 3 times [2024-06-14 15:47:36,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:36,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956532670] [2024-06-14 15:47:36,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:36,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:46,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:46,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956532670] [2024-06-14 15:47:46,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956532670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:46,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:46,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:46,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680122786] [2024-06-14 15:47:46,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:46,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:46,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:46,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:46,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:46,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:47:46,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 101 transitions, 834 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-14 15:47:46,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:46,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:47:46,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:46,771 INFO L124 PetriNetUnfolderBase]: 267/496 cut-off events. [2024-06-14 15:47:46,772 INFO L125 PetriNetUnfolderBase]: For 14267/14267 co-relation queries the response was YES. [2024-06-14 15:47:46,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3161 conditions, 496 events. 267/496 cut-off events. For 14267/14267 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2073 event pairs, 37 based on Foata normal form. 1/495 useless extension candidates. Maximal degree in co-relation 3107. Up to 405 conditions per place. [2024-06-14 15:47:46,775 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 88 selfloop transitions, 25 changer transitions 0/116 dead transitions. [2024-06-14 15:47:46,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 116 transitions, 1168 flow [2024-06-14 15:47:46,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 15:47:46,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-14 15:47:46,777 INFO L175 Difference]: Start difference. First operand has 111 places, 101 transitions, 834 flow. Second operand 9 states and 113 transitions. [2024-06-14 15:47:46,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 116 transitions, 1168 flow [2024-06-14 15:47:46,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 116 transitions, 1078 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-14 15:47:46,791 INFO L231 Difference]: Finished difference. Result has 113 places, 103 transitions, 847 flow [2024-06-14 15:47:46,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=847, PETRI_PLACES=113, PETRI_TRANSITIONS=103} [2024-06-14 15:47:46,791 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 82 predicate places. [2024-06-14 15:47:46,791 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 103 transitions, 847 flow [2024-06-14 15:47:46,791 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-14 15:47:46,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:46,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:46,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:47:46,792 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:46,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:46,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1307046150, now seen corresponding path program 4 times [2024-06-14 15:47:46,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:46,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632251050] [2024-06-14 15:47:46,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:46,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:57,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:57,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632251050] [2024-06-14 15:47:57,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632251050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:57,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:57,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:57,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832927771] [2024-06-14 15:47:57,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:57,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:57,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:57,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:57,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:57,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:47:57,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 103 transitions, 847 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-14 15:47:57,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:57,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:47:57,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:57,876 INFO L124 PetriNetUnfolderBase]: 270/503 cut-off events. [2024-06-14 15:47:57,876 INFO L125 PetriNetUnfolderBase]: For 15090/15090 co-relation queries the response was YES. [2024-06-14 15:47:57,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3182 conditions, 503 events. 270/503 cut-off events. For 15090/15090 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2118 event pairs, 37 based on Foata normal form. 1/502 useless extension candidates. Maximal degree in co-relation 3127. Up to 388 conditions per place. [2024-06-14 15:47:57,880 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 81 selfloop transitions, 33 changer transitions 0/117 dead transitions. [2024-06-14 15:47:57,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 1169 flow [2024-06-14 15:47:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 15:47:57,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-14 15:47:57,881 INFO L175 Difference]: Start difference. First operand has 113 places, 103 transitions, 847 flow. Second operand 9 states and 113 transitions. [2024-06-14 15:47:57,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 1169 flow [2024-06-14 15:47:57,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 117 transitions, 1082 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-14 15:47:57,897 INFO L231 Difference]: Finished difference. Result has 115 places, 105 transitions, 883 flow [2024-06-14 15:47:57,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=883, PETRI_PLACES=115, PETRI_TRANSITIONS=105} [2024-06-14 15:47:57,898 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-14 15:47:57,898 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 105 transitions, 883 flow [2024-06-14 15:47:57,898 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-14 15:47:57,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:57,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:57,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:47:57,899 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:57,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:57,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1307046367, now seen corresponding path program 3 times [2024-06-14 15:47:57,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:57,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051468997] [2024-06-14 15:47:57,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:57,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:07,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:07,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051468997] [2024-06-14 15:48:07,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051468997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:07,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:07,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:07,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868646766] [2024-06-14 15:48:07,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:07,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:07,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:07,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:07,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:07,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:48:07,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 105 transitions, 883 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-14 15:48:07,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:07,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:48:07,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:07,818 INFO L124 PetriNetUnfolderBase]: 278/516 cut-off events. [2024-06-14 15:48:07,818 INFO L125 PetriNetUnfolderBase]: For 16358/16358 co-relation queries the response was YES. [2024-06-14 15:48:07,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3330 conditions, 516 events. 278/516 cut-off events. For 16358/16358 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2192 event pairs, 37 based on Foata normal form. 1/515 useless extension candidates. Maximal degree in co-relation 3274. Up to 388 conditions per place. [2024-06-14 15:48:07,822 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 87 selfloop transitions, 37 changer transitions 0/127 dead transitions. [2024-06-14 15:48:07,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 127 transitions, 1323 flow [2024-06-14 15:48:07,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:48:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:48:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 15:48:07,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-14 15:48:07,842 INFO L175 Difference]: Start difference. First operand has 115 places, 105 transitions, 883 flow. Second operand 9 states and 116 transitions. [2024-06-14 15:48:07,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 127 transitions, 1323 flow [2024-06-14 15:48:07,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 127 transitions, 1216 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-14 15:48:07,859 INFO L231 Difference]: Finished difference. Result has 119 places, 114 transitions, 967 flow [2024-06-14 15:48:07,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=967, PETRI_PLACES=119, PETRI_TRANSITIONS=114} [2024-06-14 15:48:07,859 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2024-06-14 15:48:07,859 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 114 transitions, 967 flow [2024-06-14 15:48:07,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-14 15:48:07,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:07,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:07,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:48:07,860 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:07,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:07,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1307054086, now seen corresponding path program 1 times [2024-06-14 15:48:07,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:07,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941241321] [2024-06-14 15:48:07,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:07,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:14,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:14,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941241321] [2024-06-14 15:48:14,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941241321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:14,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:14,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:14,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696773695] [2024-06-14 15:48:14,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:14,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:14,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:14,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:14,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:15,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:48:15,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 114 transitions, 967 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-14 15:48:15,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:15,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:48:15,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:15,470 INFO L124 PetriNetUnfolderBase]: 281/521 cut-off events. [2024-06-14 15:48:15,470 INFO L125 PetriNetUnfolderBase]: For 17516/17516 co-relation queries the response was YES. [2024-06-14 15:48:15,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3468 conditions, 521 events. 281/521 cut-off events. For 17516/17516 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2219 event pairs, 33 based on Foata normal form. 1/520 useless extension candidates. Maximal degree in co-relation 3409. Up to 464 conditions per place. [2024-06-14 15:48:15,475 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 109 selfloop transitions, 16 changer transitions 0/128 dead transitions. [2024-06-14 15:48:15,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 128 transitions, 1277 flow [2024-06-14 15:48:15,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:48:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:48:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-14 15:48:15,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:48:15,479 INFO L175 Difference]: Start difference. First operand has 119 places, 114 transitions, 967 flow. Second operand 9 states and 108 transitions. [2024-06-14 15:48:15,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 128 transitions, 1277 flow [2024-06-14 15:48:15,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 128 transitions, 1225 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-14 15:48:15,498 INFO L231 Difference]: Finished difference. Result has 124 places, 116 transitions, 982 flow [2024-06-14 15:48:15,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=982, PETRI_PLACES=124, PETRI_TRANSITIONS=116} [2024-06-14 15:48:15,499 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 93 predicate places. [2024-06-14 15:48:15,499 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 116 transitions, 982 flow [2024-06-14 15:48:15,499 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-14 15:48:15,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:15,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:15,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:48:15,499 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:15,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:15,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1307053807, now seen corresponding path program 4 times [2024-06-14 15:48:15,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:15,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899203027] [2024-06-14 15:48:15,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:15,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:22,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:22,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899203027] [2024-06-14 15:48:22,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899203027] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:22,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:22,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:22,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735514653] [2024-06-14 15:48:22,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:22,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:22,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:22,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:22,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:23,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:23,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 116 transitions, 982 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:23,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:23,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:23,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:23,350 INFO L124 PetriNetUnfolderBase]: 287/531 cut-off events. [2024-06-14 15:48:23,351 INFO L125 PetriNetUnfolderBase]: For 19054/19054 co-relation queries the response was YES. [2024-06-14 15:48:23,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3562 conditions, 531 events. 287/531 cut-off events. For 19054/19054 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2272 event pairs, 38 based on Foata normal form. 2/531 useless extension candidates. Maximal degree in co-relation 3501. Up to 380 conditions per place. [2024-06-14 15:48:23,355 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 83 selfloop transitions, 47 changer transitions 0/133 dead transitions. [2024-06-14 15:48:23,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 133 transitions, 1430 flow [2024-06-14 15:48:23,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:48:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:48:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-14 15:48:23,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3784722222222222 [2024-06-14 15:48:23,357 INFO L175 Difference]: Start difference. First operand has 124 places, 116 transitions, 982 flow. Second operand 9 states and 109 transitions. [2024-06-14 15:48:23,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 133 transitions, 1430 flow [2024-06-14 15:48:23,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 1365 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 15:48:23,379 INFO L231 Difference]: Finished difference. Result has 127 places, 120 transitions, 1108 flow [2024-06-14 15:48:23,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1108, PETRI_PLACES=127, PETRI_TRANSITIONS=120} [2024-06-14 15:48:23,380 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2024-06-14 15:48:23,380 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 120 transitions, 1108 flow [2024-06-14 15:48:23,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:23,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:23,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:23,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:48:23,381 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:23,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:23,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1696755985, now seen corresponding path program 5 times [2024-06-14 15:48:23,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:23,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154639858] [2024-06-14 15:48:23,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:23,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:30,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:30,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154639858] [2024-06-14 15:48:30,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154639858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:30,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:30,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:30,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850265998] [2024-06-14 15:48:30,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:30,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:30,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:30,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:30,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:30,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:48:30,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 120 transitions, 1108 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-14 15:48:30,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:30,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:48:30,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:30,835 INFO L124 PetriNetUnfolderBase]: 293/541 cut-off events. [2024-06-14 15:48:30,835 INFO L125 PetriNetUnfolderBase]: For 20738/20738 co-relation queries the response was YES. [2024-06-14 15:48:30,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 541 events. 293/541 cut-off events. For 20738/20738 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2329 event pairs, 40 based on Foata normal form. 2/541 useless extension candidates. Maximal degree in co-relation 3753. Up to 481 conditions per place. [2024-06-14 15:48:30,838 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 115 selfloop transitions, 15 changer transitions 0/133 dead transitions. [2024-06-14 15:48:30,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 133 transitions, 1448 flow [2024-06-14 15:48:30,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:48:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:48:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-14 15:48:30,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:48:30,840 INFO L175 Difference]: Start difference. First operand has 127 places, 120 transitions, 1108 flow. Second operand 9 states and 108 transitions. [2024-06-14 15:48:30,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 133 transitions, 1448 flow [2024-06-14 15:48:30,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 133 transitions, 1375 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-14 15:48:30,862 INFO L231 Difference]: Finished difference. Result has 131 places, 122 transitions, 1112 flow [2024-06-14 15:48:30,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1112, PETRI_PLACES=131, PETRI_TRANSITIONS=122} [2024-06-14 15:48:30,862 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 100 predicate places. [2024-06-14 15:48:30,862 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 122 transitions, 1112 flow [2024-06-14 15:48:30,862 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-14 15:48:30,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:30,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:30,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:48:30,863 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:30,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash 496011255, now seen corresponding path program 6 times [2024-06-14 15:48:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:30,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776572832] [2024-06-14 15:48:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:30,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:39,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:39,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776572832] [2024-06-14 15:48:39,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776572832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:39,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:39,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:39,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641319251] [2024-06-14 15:48:39,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:39,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:39,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:39,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:39,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:39,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:48:39,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 122 transitions, 1112 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-14 15:48:39,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:39,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:48:39,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:39,734 INFO L124 PetriNetUnfolderBase]: 319/584 cut-off events. [2024-06-14 15:48:39,735 INFO L125 PetriNetUnfolderBase]: For 25485/25488 co-relation queries the response was YES. [2024-06-14 15:48:39,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4380 conditions, 584 events. 319/584 cut-off events. For 25485/25488 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2539 event pairs, 44 based on Foata normal form. 2/581 useless extension candidates. Maximal degree in co-relation 4315. Up to 322 conditions per place. [2024-06-14 15:48:39,739 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 75 selfloop transitions, 67 changer transitions 0/145 dead transitions. [2024-06-14 15:48:39,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 145 transitions, 1798 flow [2024-06-14 15:48:39,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:48:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:48:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-14 15:48:39,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-06-14 15:48:39,740 INFO L175 Difference]: Start difference. First operand has 131 places, 122 transitions, 1112 flow. Second operand 9 states and 123 transitions. [2024-06-14 15:48:39,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 145 transitions, 1798 flow [2024-06-14 15:48:39,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 145 transitions, 1737 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 15:48:39,768 INFO L231 Difference]: Finished difference. Result has 134 places, 130 transitions, 1422 flow [2024-06-14 15:48:39,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1422, PETRI_PLACES=134, PETRI_TRANSITIONS=130} [2024-06-14 15:48:39,778 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2024-06-14 15:48:39,778 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 130 transitions, 1422 flow [2024-06-14 15:48:39,778 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-14 15:48:39,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:39,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:39,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:48:39,779 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:39,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:39,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1962662732, now seen corresponding path program 5 times [2024-06-14 15:48:39,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:39,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746650035] [2024-06-14 15:48:39,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:39,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:49,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:49,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:49,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746650035] [2024-06-14 15:48:49,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746650035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:49,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:49,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:49,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766933069] [2024-06-14 15:48:49,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:49,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:49,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:49,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:49,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:48:49,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 130 transitions, 1422 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-14 15:48:49,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:49,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:48:49,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:49,904 INFO L124 PetriNetUnfolderBase]: 322/591 cut-off events. [2024-06-14 15:48:49,904 INFO L125 PetriNetUnfolderBase]: For 26818/26821 co-relation queries the response was YES. [2024-06-14 15:48:49,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4688 conditions, 591 events. 322/591 cut-off events. For 26818/26821 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2587 event pairs, 48 based on Foata normal form. 1/587 useless extension candidates. Maximal degree in co-relation 4621. Up to 483 conditions per place. [2024-06-14 15:48:49,909 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 110 selfloop transitions, 29 changer transitions 0/142 dead transitions. [2024-06-14 15:48:49,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 142 transitions, 1806 flow [2024-06-14 15:48:49,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:48:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:48:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 15:48:49,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 15:48:49,933 INFO L175 Difference]: Start difference. First operand has 134 places, 130 transitions, 1422 flow. Second operand 9 states and 112 transitions. [2024-06-14 15:48:49,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 142 transitions, 1806 flow [2024-06-14 15:48:49,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 142 transitions, 1681 flow, removed 52 selfloop flow, removed 3 redundant places. [2024-06-14 15:48:49,968 INFO L231 Difference]: Finished difference. Result has 140 places, 132 transitions, 1444 flow [2024-06-14 15:48:49,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1444, PETRI_PLACES=140, PETRI_TRANSITIONS=132} [2024-06-14 15:48:49,969 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 109 predicate places. [2024-06-14 15:48:49,969 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 132 transitions, 1444 flow [2024-06-14 15:48:49,969 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-14 15:48:49,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:49,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:49,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:48:49,970 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:49,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:49,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1616167131, now seen corresponding path program 7 times [2024-06-14 15:48:49,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:49,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023006240] [2024-06-14 15:48:49,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:49,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:58,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:58,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023006240] [2024-06-14 15:48:58,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023006240] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:58,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:58,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:58,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626572737] [2024-06-14 15:48:58,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:58,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:58,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:58,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:58,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:58,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:48:58,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 132 transitions, 1444 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-14 15:48:58,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:58,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:48:58,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:59,263 INFO L124 PetriNetUnfolderBase]: 323/593 cut-off events. [2024-06-14 15:48:59,263 INFO L125 PetriNetUnfolderBase]: For 27174/27177 co-relation queries the response was YES. [2024-06-14 15:48:59,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 593 events. 323/593 cut-off events. For 27174/27177 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2618 event pairs, 46 based on Foata normal form. 2/590 useless extension candidates. Maximal degree in co-relation 4513. Up to 482 conditions per place. [2024-06-14 15:48:59,268 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 112 selfloop transitions, 30 changer transitions 0/145 dead transitions. [2024-06-14 15:48:59,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 145 transitions, 1828 flow [2024-06-14 15:48:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:48:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:48:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 15:48:59,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-14 15:48:59,270 INFO L175 Difference]: Start difference. First operand has 140 places, 132 transitions, 1444 flow. Second operand 9 states and 113 transitions. [2024-06-14 15:48:59,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 145 transitions, 1828 flow [2024-06-14 15:48:59,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 145 transitions, 1723 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-14 15:48:59,304 INFO L231 Difference]: Finished difference. Result has 142 places, 135 transitions, 1485 flow [2024-06-14 15:48:59,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1485, PETRI_PLACES=142, PETRI_TRANSITIONS=135} [2024-06-14 15:48:59,305 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2024-06-14 15:48:59,305 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 135 transitions, 1485 flow [2024-06-14 15:48:59,305 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-14 15:48:59,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:59,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:59,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:48:59,307 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:59,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1962453265, now seen corresponding path program 8 times [2024-06-14 15:48:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:59,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817340564] [2024-06-14 15:48:59,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:59,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:09,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:09,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817340564] [2024-06-14 15:49:09,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817340564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:09,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:09,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:09,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103932490] [2024-06-14 15:49:09,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:09,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:09,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:09,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:09,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:09,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:49:09,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 135 transitions, 1485 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-14 15:49:09,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:09,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:49:09,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:09,699 INFO L124 PetriNetUnfolderBase]: 326/598 cut-off events. [2024-06-14 15:49:09,699 INFO L125 PetriNetUnfolderBase]: For 27250/27253 co-relation queries the response was YES. [2024-06-14 15:49:09,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4659 conditions, 598 events. 326/598 cut-off events. For 27250/27253 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2646 event pairs, 46 based on Foata normal form. 1/594 useless extension candidates. Maximal degree in co-relation 4589. Up to 471 conditions per place. [2024-06-14 15:49:09,730 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 109 selfloop transitions, 38 changer transitions 0/150 dead transitions. [2024-06-14 15:49:09,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 150 transitions, 1979 flow [2024-06-14 15:49:09,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:49:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:49:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 15:49:09,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:49:09,732 INFO L175 Difference]: Start difference. First operand has 142 places, 135 transitions, 1485 flow. Second operand 9 states and 117 transitions. [2024-06-14 15:49:09,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 150 transitions, 1979 flow [2024-06-14 15:49:09,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 150 transitions, 1861 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-14 15:49:09,767 INFO L231 Difference]: Finished difference. Result has 144 places, 139 transitions, 1542 flow [2024-06-14 15:49:09,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1542, PETRI_PLACES=144, PETRI_TRANSITIONS=139} [2024-06-14 15:49:09,768 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-14 15:49:09,768 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 139 transitions, 1542 flow [2024-06-14 15:49:09,768 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-14 15:49:09,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:09,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:09,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:49:09,769 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:09,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:09,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1962452986, now seen corresponding path program 2 times [2024-06-14 15:49:09,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:09,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94993704] [2024-06-14 15:49:09,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:09,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:17,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:17,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94993704] [2024-06-14 15:49:17,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94993704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:17,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:17,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:49:17,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476641824] [2024-06-14 15:49:17,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:17,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:49:17,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:17,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:49:17,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:49:17,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:49:17,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 139 transitions, 1542 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:17,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:17,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:49:17,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:17,717 INFO L124 PetriNetUnfolderBase]: 324/595 cut-off events. [2024-06-14 15:49:17,717 INFO L125 PetriNetUnfolderBase]: For 27457/27460 co-relation queries the response was YES. [2024-06-14 15:49:17,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4604 conditions, 595 events. 324/595 cut-off events. For 27457/27460 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2624 event pairs, 41 based on Foata normal form. 3/594 useless extension candidates. Maximal degree in co-relation 4533. Up to 529 conditions per place. [2024-06-14 15:49:17,722 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 127 selfloop transitions, 18 changer transitions 0/148 dead transitions. [2024-06-14 15:49:17,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 148 transitions, 1858 flow [2024-06-14 15:49:17,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:49:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:49:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 15:49:17,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2024-06-14 15:49:17,724 INFO L175 Difference]: Start difference. First operand has 144 places, 139 transitions, 1542 flow. Second operand 8 states and 98 transitions. [2024-06-14 15:49:17,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 148 transitions, 1858 flow [2024-06-14 15:49:17,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 148 transitions, 1765 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-06-14 15:49:17,759 INFO L231 Difference]: Finished difference. Result has 147 places, 139 transitions, 1491 flow [2024-06-14 15:49:17,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1491, PETRI_PLACES=147, PETRI_TRANSITIONS=139} [2024-06-14 15:49:17,759 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 116 predicate places. [2024-06-14 15:49:17,759 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 139 transitions, 1491 flow [2024-06-14 15:49:17,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:17,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:17,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:17,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:49:17,760 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:17,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1705960412, now seen corresponding path program 6 times [2024-06-14 15:49:17,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:17,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125342693] [2024-06-14 15:49:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:17,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:25,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-14 15:49:25,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:25,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125342693] [2024-06-14 15:49:25,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125342693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:25,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:25,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:25,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704609317] [2024-06-14 15:49:25,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:25,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:25,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:25,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:25,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:26,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:49:26,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 139 transitions, 1491 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-14 15:49:26,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:26,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:49:26,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:26,454 INFO L124 PetriNetUnfolderBase]: 327/602 cut-off events. [2024-06-14 15:49:26,454 INFO L125 PetriNetUnfolderBase]: For 28559/28562 co-relation queries the response was YES. [2024-06-14 15:49:26,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4663 conditions, 602 events. 327/602 cut-off events. For 28559/28562 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2688 event pairs, 46 based on Foata normal form. 1/598 useless extension candidates. Maximal degree in co-relation 4590. Up to 439 conditions per place. [2024-06-14 15:49:26,459 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 100 selfloop transitions, 50 changer transitions 0/153 dead transitions. [2024-06-14 15:49:26,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 153 transitions, 2017 flow [2024-06-14 15:49:26,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:49:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:49:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:49:26,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 15:49:26,460 INFO L175 Difference]: Start difference. First operand has 147 places, 139 transitions, 1491 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:49:26,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 153 transitions, 2017 flow [2024-06-14 15:49:26,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 153 transitions, 1958 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 15:49:26,497 INFO L231 Difference]: Finished difference. Result has 149 places, 143 transitions, 1657 flow [2024-06-14 15:49:26,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1657, PETRI_PLACES=149, PETRI_TRANSITIONS=143} [2024-06-14 15:49:26,497 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 118 predicate places. [2024-06-14 15:49:26,497 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 1657 flow [2024-06-14 15:49:26,498 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-14 15:49:26,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:26,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:26,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:49:26,498 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:26,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:26,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1705960195, now seen corresponding path program 9 times [2024-06-14 15:49:26,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:26,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551072472] [2024-06-14 15:49:26,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:26,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:36,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:36,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551072472] [2024-06-14 15:49:36,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551072472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:36,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:36,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:36,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508223678] [2024-06-14 15:49:36,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:36,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:36,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:36,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:36,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:36,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:49:36,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 143 transitions, 1657 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-14 15:49:36,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:36,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:49:36,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:36,546 INFO L124 PetriNetUnfolderBase]: 325/599 cut-off events. [2024-06-14 15:49:36,547 INFO L125 PetriNetUnfolderBase]: For 29141/29144 co-relation queries the response was YES. [2024-06-14 15:49:36,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4711 conditions, 599 events. 325/599 cut-off events. For 29141/29144 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2666 event pairs, 41 based on Foata normal form. 1/595 useless extension candidates. Maximal degree in co-relation 4637. Up to 400 conditions per place. [2024-06-14 15:49:36,551 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 96 selfloop transitions, 62 changer transitions 0/161 dead transitions. [2024-06-14 15:49:36,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 161 transitions, 2180 flow [2024-06-14 15:49:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:49:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:49:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 15:49:36,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:49:36,561 INFO L175 Difference]: Start difference. First operand has 149 places, 143 transitions, 1657 flow. Second operand 9 states and 117 transitions. [2024-06-14 15:49:36,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 161 transitions, 2180 flow [2024-06-14 15:49:36,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 161 transitions, 2089 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-14 15:49:36,618 INFO L231 Difference]: Finished difference. Result has 155 places, 151 transitions, 1816 flow [2024-06-14 15:49:36,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1566, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1816, PETRI_PLACES=155, PETRI_TRANSITIONS=151} [2024-06-14 15:49:36,619 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 124 predicate places. [2024-06-14 15:49:36,619 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 151 transitions, 1816 flow [2024-06-14 15:49:36,619 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-14 15:49:36,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:36,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:36,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:49:36,620 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:36,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:36,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1962460922, now seen corresponding path program 7 times [2024-06-14 15:49:36,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:36,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962669973] [2024-06-14 15:49:36,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:36,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:45,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:45,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962669973] [2024-06-14 15:49:45,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962669973] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:45,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:45,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136370215] [2024-06-14 15:49:45,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:45,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:45,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:45,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:45,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:45,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:49:45,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 151 transitions, 1816 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-14 15:49:45,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:45,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:49:45,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:46,255 INFO L124 PetriNetUnfolderBase]: 323/596 cut-off events. [2024-06-14 15:49:46,255 INFO L125 PetriNetUnfolderBase]: For 28999/29002 co-relation queries the response was YES. [2024-06-14 15:49:46,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4778 conditions, 596 events. 323/596 cut-off events. For 28999/29002 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2653 event pairs, 41 based on Foata normal form. 1/592 useless extension candidates. Maximal degree in co-relation 4700. Up to 477 conditions per place. [2024-06-14 15:49:46,261 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 125 selfloop transitions, 33 changer transitions 0/161 dead transitions. [2024-06-14 15:49:46,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 161 transitions, 2158 flow [2024-06-14 15:49:46,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:49:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:49:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:49:46,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 15:49:46,262 INFO L175 Difference]: Start difference. First operand has 155 places, 151 transitions, 1816 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:49:46,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 161 transitions, 2158 flow [2024-06-14 15:49:46,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 161 transitions, 1990 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-06-14 15:49:46,304 INFO L231 Difference]: Finished difference. Result has 159 places, 151 transitions, 1719 flow [2024-06-14 15:49:46,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1648, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1719, PETRI_PLACES=159, PETRI_TRANSITIONS=151} [2024-06-14 15:49:46,304 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 128 predicate places. [2024-06-14 15:49:46,304 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 151 transitions, 1719 flow [2024-06-14 15:49:46,305 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-14 15:49:46,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:46,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:46,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:49:46,305 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:46,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:46,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1962460705, now seen corresponding path program 10 times [2024-06-14 15:49:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:46,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384672721] [2024-06-14 15:49:46,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:46,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:53,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384672721] [2024-06-14 15:49:53,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384672721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:53,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:53,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:53,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222053642] [2024-06-14 15:49:53,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:53,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:53,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:53,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:53,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:53,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:49:53,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 151 transitions, 1719 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-14 15:49:53,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:53,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:49:53,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:53,743 INFO L124 PetriNetUnfolderBase]: 329/606 cut-off events. [2024-06-14 15:49:53,743 INFO L125 PetriNetUnfolderBase]: For 31069/31072 co-relation queries the response was YES. [2024-06-14 15:49:53,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4809 conditions, 606 events. 329/606 cut-off events. For 31069/31072 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2711 event pairs, 41 based on Foata normal form. 2/603 useless extension candidates. Maximal degree in co-relation 4730. Up to 458 conditions per place. [2024-06-14 15:49:53,747 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 122 selfloop transitions, 42 changer transitions 0/167 dead transitions. [2024-06-14 15:49:53,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 167 transitions, 2365 flow [2024-06-14 15:49:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:49:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:49:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-14 15:49:53,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4201388888888889 [2024-06-14 15:49:53,749 INFO L175 Difference]: Start difference. First operand has 159 places, 151 transitions, 1719 flow. Second operand 9 states and 121 transitions. [2024-06-14 15:49:53,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 167 transitions, 2365 flow [2024-06-14 15:49:53,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 167 transitions, 2182 flow, removed 32 selfloop flow, removed 9 redundant places. [2024-06-14 15:49:53,798 INFO L231 Difference]: Finished difference. Result has 159 places, 155 transitions, 1730 flow [2024-06-14 15:49:53,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1730, PETRI_PLACES=159, PETRI_TRANSITIONS=155} [2024-06-14 15:49:53,798 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 128 predicate places. [2024-06-14 15:49:53,798 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 1730 flow [2024-06-14 15:49:53,799 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-14 15:49:53,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:53,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:53,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:49:53,799 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:53,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:53,799 INFO L85 PathProgramCache]: Analyzing trace with hash 41123300, now seen corresponding path program 1 times [2024-06-14 15:49:53,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:53,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203542959] [2024-06-14 15:49:53,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:00,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:00,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203542959] [2024-06-14 15:50:00,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203542959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:00,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:00,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:00,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751461235] [2024-06-14 15:50:00,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:00,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:00,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:00,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:00,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:01,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:50:01,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 155 transitions, 1730 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-14 15:50:01,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:01,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:50:01,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:01,538 INFO L124 PetriNetUnfolderBase]: 333/613 cut-off events. [2024-06-14 15:50:01,539 INFO L125 PetriNetUnfolderBase]: For 32249/32249 co-relation queries the response was YES. [2024-06-14 15:50:01,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4760 conditions, 613 events. 333/613 cut-off events. For 32249/32249 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2758 event pairs, 14 based on Foata normal form. 2/613 useless extension candidates. Maximal degree in co-relation 4681. Up to 509 conditions per place. [2024-06-14 15:50:01,543 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 154 selfloop transitions, 18 changer transitions 0/175 dead transitions. [2024-06-14 15:50:01,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 175 transitions, 2144 flow [2024-06-14 15:50:01,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:01,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 15:50:01,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-14 15:50:01,544 INFO L175 Difference]: Start difference. First operand has 159 places, 155 transitions, 1730 flow. Second operand 9 states and 113 transitions. [2024-06-14 15:50:01,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 175 transitions, 2144 flow [2024-06-14 15:50:01,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 175 transitions, 1935 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-14 15:50:01,593 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 1579 flow [2024-06-14 15:50:01,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1521, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1579, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2024-06-14 15:50:01,593 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 129 predicate places. [2024-06-14 15:50:01,593 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 1579 flow [2024-06-14 15:50:01,594 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-14 15:50:01,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:01,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:01,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:50:01,594 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:01,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash -574621734, now seen corresponding path program 2 times [2024-06-14 15:50:01,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:01,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662195174] [2024-06-14 15:50:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:08,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:08,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662195174] [2024-06-14 15:50:08,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662195174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:08,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:08,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:08,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543311339] [2024-06-14 15:50:08,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:08,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:08,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:08,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:08,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:08,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:50:08,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 1579 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-14 15:50:08,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:08,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:50:08,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:08,815 INFO L124 PetriNetUnfolderBase]: 337/621 cut-off events. [2024-06-14 15:50:08,816 INFO L125 PetriNetUnfolderBase]: For 32760/32760 co-relation queries the response was YES. [2024-06-14 15:50:08,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4615 conditions, 621 events. 337/621 cut-off events. For 32760/32760 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2819 event pairs, 31 based on Foata normal form. 2/621 useless extension candidates. Maximal degree in co-relation 4537. Up to 534 conditions per place. [2024-06-14 15:50:08,821 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 153 selfloop transitions, 19 changer transitions 0/175 dead transitions. [2024-06-14 15:50:08,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 175 transitions, 1993 flow [2024-06-14 15:50:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:50:08,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 15:50:08,835 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 1579 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:50:08,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 175 transitions, 1993 flow [2024-06-14 15:50:08,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 175 transitions, 1945 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:50:08,880 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 1593 flow [2024-06-14 15:50:08,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1593, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2024-06-14 15:50:08,881 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2024-06-14 15:50:08,881 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 1593 flow [2024-06-14 15:50:08,881 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-14 15:50:08,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:08,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:08,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:50:08,881 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:08,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:08,882 INFO L85 PathProgramCache]: Analyzing trace with hash -571820264, now seen corresponding path program 1 times [2024-06-14 15:50:08,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:08,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499411428] [2024-06-14 15:50:08,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:08,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:18,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499411428] [2024-06-14 15:50:18,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499411428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:18,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:18,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217603261] [2024-06-14 15:50:18,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:18,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:18,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:18,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:18,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:18,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:50:18,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 1593 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-14 15:50:18,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:18,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:50:18,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:18,550 INFO L124 PetriNetUnfolderBase]: 340/628 cut-off events. [2024-06-14 15:50:18,550 INFO L125 PetriNetUnfolderBase]: For 33717/33717 co-relation queries the response was YES. [2024-06-14 15:50:18,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4685 conditions, 628 events. 340/628 cut-off events. For 33717/33717 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2866 event pairs, 30 based on Foata normal form. 1/627 useless extension candidates. Maximal degree in co-relation 4606. Up to 539 conditions per place. [2024-06-14 15:50:18,555 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 152 selfloop transitions, 22 changer transitions 0/177 dead transitions. [2024-06-14 15:50:18,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 177 transitions, 2043 flow [2024-06-14 15:50:18,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:50:18,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:50:18,557 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 1593 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:50:18,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 177 transitions, 2043 flow [2024-06-14 15:50:18,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 177 transitions, 1991 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:50:18,604 INFO L231 Difference]: Finished difference. Result has 165 places, 159 transitions, 1644 flow [2024-06-14 15:50:18,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1541, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1644, PETRI_PLACES=165, PETRI_TRANSITIONS=159} [2024-06-14 15:50:18,605 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 134 predicate places. [2024-06-14 15:50:18,605 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 159 transitions, 1644 flow [2024-06-14 15:50:18,605 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-14 15:50:18,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:18,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:18,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:50:18,606 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:18,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:18,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1691653364, now seen corresponding path program 3 times [2024-06-14 15:50:18,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:18,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262505114] [2024-06-14 15:50:18,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:18,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:25,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:25,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262505114] [2024-06-14 15:50:25,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262505114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:25,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:25,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:25,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961266714] [2024-06-14 15:50:25,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:25,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:25,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:25,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:25,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:25,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:50:25,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 159 transitions, 1644 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-14 15:50:25,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:25,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:50:25,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:25,879 INFO L124 PetriNetUnfolderBase]: 344/636 cut-off events. [2024-06-14 15:50:25,879 INFO L125 PetriNetUnfolderBase]: For 36301/36301 co-relation queries the response was YES. [2024-06-14 15:50:25,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4762 conditions, 636 events. 344/636 cut-off events. For 36301/36301 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2911 event pairs, 30 based on Foata normal form. 2/636 useless extension candidates. Maximal degree in co-relation 4682. Up to 549 conditions per place. [2024-06-14 15:50:25,884 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 153 selfloop transitions, 22 changer transitions 0/178 dead transitions. [2024-06-14 15:50:25,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 178 transitions, 2088 flow [2024-06-14 15:50:25,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 15:50:25,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-14 15:50:25,886 INFO L175 Difference]: Start difference. First operand has 165 places, 159 transitions, 1644 flow. Second operand 9 states and 111 transitions. [2024-06-14 15:50:25,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 178 transitions, 2088 flow [2024-06-14 15:50:25,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 178 transitions, 2001 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-14 15:50:25,932 INFO L231 Difference]: Finished difference. Result has 167 places, 163 transitions, 1668 flow [2024-06-14 15:50:25,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1557, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1668, PETRI_PLACES=167, PETRI_TRANSITIONS=163} [2024-06-14 15:50:25,933 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-14 15:50:25,933 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 163 transitions, 1668 flow [2024-06-14 15:50:25,933 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-14 15:50:25,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:25,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:25,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:50:25,934 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:25,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash -848901310, now seen corresponding path program 2 times [2024-06-14 15:50:25,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:25,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7408942] [2024-06-14 15:50:25,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:25,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:33,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:33,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7408942] [2024-06-14 15:50:33,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7408942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:34,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:34,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:34,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548910169] [2024-06-14 15:50:34,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:34,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:34,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:34,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:34,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:50:34,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 163 transitions, 1668 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-14 15:50:34,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:34,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:50:34,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:34,621 INFO L124 PetriNetUnfolderBase]: 352/649 cut-off events. [2024-06-14 15:50:34,621 INFO L125 PetriNetUnfolderBase]: For 37846/37846 co-relation queries the response was YES. [2024-06-14 15:50:34,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4970 conditions, 649 events. 352/649 cut-off events. For 37846/37846 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2987 event pairs, 30 based on Foata normal form. 1/648 useless extension candidates. Maximal degree in co-relation 4888. Up to 544 conditions per place. [2024-06-14 15:50:34,627 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 150 selfloop transitions, 31 changer transitions 0/184 dead transitions. [2024-06-14 15:50:34,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 184 transitions, 2291 flow [2024-06-14 15:50:34,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:34,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:34,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:50:34,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:50:34,629 INFO L175 Difference]: Start difference. First operand has 167 places, 163 transitions, 1668 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:50:34,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 184 transitions, 2291 flow [2024-06-14 15:50:34,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 184 transitions, 2232 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 15:50:34,681 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 1804 flow [2024-06-14 15:50:34,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1804, PETRI_PLACES=172, PETRI_TRANSITIONS=168} [2024-06-14 15:50:34,681 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 141 predicate places. [2024-06-14 15:50:34,681 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 1804 flow [2024-06-14 15:50:34,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:34,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:34,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:34,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:50:34,682 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:34,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1691831304, now seen corresponding path program 3 times [2024-06-14 15:50:34,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:34,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296242184] [2024-06-14 15:50:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:44,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:44,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296242184] [2024-06-14 15:50:44,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296242184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:44,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:44,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:44,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323410595] [2024-06-14 15:50:44,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:44,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:44,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:44,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:44,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:44,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:50:44,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 1804 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-14 15:50:44,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:44,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:50:44,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:45,295 INFO L124 PetriNetUnfolderBase]: 350/646 cut-off events. [2024-06-14 15:50:45,295 INFO L125 PetriNetUnfolderBase]: For 37979/37979 co-relation queries the response was YES. [2024-06-14 15:50:45,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4942 conditions, 646 events. 350/646 cut-off events. For 37979/37979 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2971 event pairs, 30 based on Foata normal form. 1/645 useless extension candidates. Maximal degree in co-relation 4858. Up to 542 conditions per place. [2024-06-14 15:50:45,300 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 149 selfloop transitions, 31 changer transitions 0/183 dead transitions. [2024-06-14 15:50:45,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 183 transitions, 2206 flow [2024-06-14 15:50:45,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:50:45,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:50:45,304 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 1804 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:50:45,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 183 transitions, 2206 flow [2024-06-14 15:50:45,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 183 transitions, 2075 flow, removed 48 selfloop flow, removed 6 redundant places. [2024-06-14 15:50:45,366 INFO L231 Difference]: Finished difference. Result has 176 places, 168 transitions, 1740 flow [2024-06-14 15:50:45,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1740, PETRI_PLACES=176, PETRI_TRANSITIONS=168} [2024-06-14 15:50:45,367 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-14 15:50:45,367 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 168 transitions, 1740 flow [2024-06-14 15:50:45,367 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-14 15:50:45,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:45,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:45,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:50:45,367 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:45,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:45,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1857292498, now seen corresponding path program 4 times [2024-06-14 15:50:45,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:45,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649287273] [2024-06-14 15:50:45,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:45,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:52,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:52,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649287273] [2024-06-14 15:50:52,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649287273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:52,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:52,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:52,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878809253] [2024-06-14 15:50:52,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:52,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:52,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:52,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:52,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:52,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:50:52,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 168 transitions, 1740 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-14 15:50:52,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:52,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:50:52,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:52,849 INFO L124 PetriNetUnfolderBase]: 354/654 cut-off events. [2024-06-14 15:50:52,849 INFO L125 PetriNetUnfolderBase]: For 40243/40243 co-relation queries the response was YES. [2024-06-14 15:50:52,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4976 conditions, 654 events. 354/654 cut-off events. For 40243/40243 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3008 event pairs, 32 based on Foata normal form. 2/654 useless extension candidates. Maximal degree in co-relation 4890. Up to 558 conditions per place. [2024-06-14 15:50:52,856 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 155 selfloop transitions, 25 changer transitions 0/183 dead transitions. [2024-06-14 15:50:52,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 183 transitions, 2170 flow [2024-06-14 15:50:52,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 15:50:52,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-14 15:50:52,877 INFO L175 Difference]: Start difference. First operand has 176 places, 168 transitions, 1740 flow. Second operand 9 states and 111 transitions. [2024-06-14 15:50:52,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 183 transitions, 2170 flow [2024-06-14 15:50:52,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 183 transitions, 2114 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 15:50:52,981 INFO L231 Difference]: Finished difference. Result has 179 places, 171 transitions, 1785 flow [2024-06-14 15:50:52,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1684, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1785, PETRI_PLACES=179, PETRI_TRANSITIONS=171} [2024-06-14 15:50:52,981 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 148 predicate places. [2024-06-14 15:50:52,981 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 171 transitions, 1785 flow [2024-06-14 15:50:52,982 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-14 15:50:52,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:52,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:52,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:50:52,982 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:52,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:52,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1857470438, now seen corresponding path program 4 times [2024-06-14 15:50:52,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:52,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237111419] [2024-06-14 15:50:52,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:52,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:01,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:01,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237111419] [2024-06-14 15:51:01,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237111419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:01,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:01,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:01,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759819870] [2024-06-14 15:51:01,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:01,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:01,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:01,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:01,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:01,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:51:01,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 171 transitions, 1785 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-14 15:51:01,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:01,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:51:01,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:02,039 INFO L124 PetriNetUnfolderBase]: 372/689 cut-off events. [2024-06-14 15:51:02,039 INFO L125 PetriNetUnfolderBase]: For 45982/45982 co-relation queries the response was YES. [2024-06-14 15:51:02,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5518 conditions, 689 events. 372/689 cut-off events. For 45982/45982 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3251 event pairs, 32 based on Foata normal form. 1/688 useless extension candidates. Maximal degree in co-relation 5430. Up to 554 conditions per place. [2024-06-14 15:51:02,045 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 150 selfloop transitions, 39 changer transitions 0/192 dead transitions. [2024-06-14 15:51:02,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 192 transitions, 2597 flow [2024-06-14 15:51:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 15:51:02,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-14 15:51:02,046 INFO L175 Difference]: Start difference. First operand has 179 places, 171 transitions, 1785 flow. Second operand 10 states and 129 transitions. [2024-06-14 15:51:02,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 192 transitions, 2597 flow [2024-06-14 15:51:02,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 192 transitions, 2527 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 15:51:02,110 INFO L231 Difference]: Finished difference. Result has 183 places, 178 transitions, 1988 flow [2024-06-14 15:51:02,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1715, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1988, PETRI_PLACES=183, PETRI_TRANSITIONS=178} [2024-06-14 15:51:02,110 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 152 predicate places. [2024-06-14 15:51:02,111 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 178 transitions, 1988 flow [2024-06-14 15:51:02,111 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-14 15:51:02,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:02,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:02,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:51:02,111 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:02,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:02,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1863733306, now seen corresponding path program 1 times [2024-06-14 15:51:02,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:02,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806287622] [2024-06-14 15:51:02,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:02,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:09,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:09,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806287622] [2024-06-14 15:51:09,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806287622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:09,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:09,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:09,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310614799] [2024-06-14 15:51:09,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:09,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:09,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:09,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:09,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:09,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:51:09,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 178 transitions, 1988 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-14 15:51:09,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:09,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:51:09,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:10,275 INFO L124 PetriNetUnfolderBase]: 370/686 cut-off events. [2024-06-14 15:51:10,275 INFO L125 PetriNetUnfolderBase]: For 46173/46173 co-relation queries the response was YES. [2024-06-14 15:51:10,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5500 conditions, 686 events. 370/686 cut-off events. For 46173/46173 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3211 event pairs, 33 based on Foata normal form. 1/685 useless extension candidates. Maximal degree in co-relation 5411. Up to 544 conditions per place. [2024-06-14 15:51:10,281 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 144 selfloop transitions, 43 changer transitions 0/190 dead transitions. [2024-06-14 15:51:10,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 190 transitions, 2392 flow [2024-06-14 15:51:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:51:10,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:51:10,283 INFO L175 Difference]: Start difference. First operand has 183 places, 178 transitions, 1988 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:51:10,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 190 transitions, 2392 flow [2024-06-14 15:51:10,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 190 transitions, 2275 flow, removed 43 selfloop flow, removed 5 redundant places. [2024-06-14 15:51:10,359 INFO L231 Difference]: Finished difference. Result has 188 places, 178 transitions, 1962 flow [2024-06-14 15:51:10,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1962, PETRI_PLACES=188, PETRI_TRANSITIONS=178} [2024-06-14 15:51:10,360 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 157 predicate places. [2024-06-14 15:51:10,360 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 178 transitions, 1962 flow [2024-06-14 15:51:10,360 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-14 15:51:10,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:10,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:10,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:51:10,361 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:10,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:10,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1863733058, now seen corresponding path program 5 times [2024-06-14 15:51:10,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:10,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925601241] [2024-06-14 15:51:10,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:10,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:21,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:21,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925601241] [2024-06-14 15:51:21,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925601241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:21,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:21,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:21,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634400586] [2024-06-14 15:51:21,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:21,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:21,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:21,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:21,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:21,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:51:21,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 178 transitions, 1962 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-14 15:51:21,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:21,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:51:21,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:21,795 INFO L124 PetriNetUnfolderBase]: 401/744 cut-off events. [2024-06-14 15:51:21,795 INFO L125 PetriNetUnfolderBase]: For 59008/59008 co-relation queries the response was YES. [2024-06-14 15:51:21,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6422 conditions, 744 events. 401/744 cut-off events. For 59008/59008 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3590 event pairs, 33 based on Foata normal form. 2/744 useless extension candidates. Maximal degree in co-relation 6331. Up to 505 conditions per place. [2024-06-14 15:51:21,802 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 142 selfloop transitions, 59 changer transitions 0/204 dead transitions. [2024-06-14 15:51:21,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 204 transitions, 3028 flow [2024-06-14 15:51:21,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-14 15:51:21,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-14 15:51:21,803 INFO L175 Difference]: Start difference. First operand has 188 places, 178 transitions, 1962 flow. Second operand 10 states and 134 transitions. [2024-06-14 15:51:21,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 204 transitions, 3028 flow [2024-06-14 15:51:21,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 204 transitions, 2913 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-14 15:51:21,891 INFO L231 Difference]: Finished difference. Result has 189 places, 187 transitions, 2230 flow [2024-06-14 15:51:21,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1847, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2230, PETRI_PLACES=189, PETRI_TRANSITIONS=187} [2024-06-14 15:51:21,892 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 158 predicate places. [2024-06-14 15:51:21,892 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 187 transitions, 2230 flow [2024-06-14 15:51:21,892 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-14 15:51:21,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:21,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:21,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:51:21,893 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:21,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:21,893 INFO L85 PathProgramCache]: Analyzing trace with hash -676417930, now seen corresponding path program 6 times [2024-06-14 15:51:21,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:21,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992695488] [2024-06-14 15:51:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:21,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:32,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:32,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992695488] [2024-06-14 15:51:32,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992695488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:32,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:32,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:32,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992519826] [2024-06-14 15:51:32,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:32,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:32,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:32,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:32,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:32,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:51:32,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 187 transitions, 2230 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-14 15:51:32,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:32,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:51:32,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:33,045 INFO L124 PetriNetUnfolderBase]: 399/741 cut-off events. [2024-06-14 15:51:33,045 INFO L125 PetriNetUnfolderBase]: For 58389/58389 co-relation queries the response was YES. [2024-06-14 15:51:33,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6436 conditions, 741 events. 399/741 cut-off events. For 58389/58389 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3575 event pairs, 32 based on Foata normal form. 1/740 useless extension candidates. Maximal degree in co-relation 6344. Up to 562 conditions per place. [2024-06-14 15:51:33,052 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 150 selfloop transitions, 54 changer transitions 0/207 dead transitions. [2024-06-14 15:51:33,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 207 transitions, 3115 flow [2024-06-14 15:51:33,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 15:51:33,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:51:33,054 INFO L175 Difference]: Start difference. First operand has 189 places, 187 transitions, 2230 flow. Second operand 10 states and 128 transitions. [2024-06-14 15:51:33,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 207 transitions, 3115 flow [2024-06-14 15:51:33,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 207 transitions, 2962 flow, removed 62 selfloop flow, removed 4 redundant places. [2024-06-14 15:51:33,144 INFO L231 Difference]: Finished difference. Result has 197 places, 193 transitions, 2450 flow [2024-06-14 15:51:33,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2450, PETRI_PLACES=197, PETRI_TRANSITIONS=193} [2024-06-14 15:51:33,144 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 166 predicate places. [2024-06-14 15:51:33,144 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 193 transitions, 2450 flow [2024-06-14 15:51:33,145 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-14 15:51:33,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:33,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:33,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:51:33,147 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:33,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:33,147 INFO L85 PathProgramCache]: Analyzing trace with hash -676171852, now seen corresponding path program 1 times [2024-06-14 15:51:33,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:33,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571218957] [2024-06-14 15:51:33,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:33,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:43,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:43,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571218957] [2024-06-14 15:51:43,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571218957] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:43,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:43,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:43,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24976500] [2024-06-14 15:51:43,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:43,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:43,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:43,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:43,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:43,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:51:43,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 193 transitions, 2450 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-14 15:51:43,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:43,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:51:43,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:43,877 INFO L124 PetriNetUnfolderBase]: 403/749 cut-off events. [2024-06-14 15:51:43,878 INFO L125 PetriNetUnfolderBase]: For 61228/61228 co-relation queries the response was YES. [2024-06-14 15:51:43,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6578 conditions, 749 events. 403/749 cut-off events. For 61228/61228 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3646 event pairs, 31 based on Foata normal form. 2/749 useless extension candidates. Maximal degree in co-relation 6482. Up to 666 conditions per place. [2024-06-14 15:51:43,884 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 188 selfloop transitions, 17 changer transitions 0/208 dead transitions. [2024-06-14 15:51:43,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 208 transitions, 2916 flow [2024-06-14 15:51:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 15:51:43,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 15:51:43,886 INFO L175 Difference]: Start difference. First operand has 197 places, 193 transitions, 2450 flow. Second operand 10 states and 118 transitions. [2024-06-14 15:51:43,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 208 transitions, 2916 flow [2024-06-14 15:51:43,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 208 transitions, 2808 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-14 15:51:43,991 INFO L231 Difference]: Finished difference. Result has 202 places, 194 transitions, 2400 flow [2024-06-14 15:51:43,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2342, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2400, PETRI_PLACES=202, PETRI_TRANSITIONS=194} [2024-06-14 15:51:43,992 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 171 predicate places. [2024-06-14 15:51:43,993 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 194 transitions, 2400 flow [2024-06-14 15:51:43,993 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-14 15:51:43,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:43,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:43,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:51:43,993 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:43,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:43,994 INFO L85 PathProgramCache]: Analyzing trace with hash -284223720, now seen corresponding path program 7 times [2024-06-14 15:51:43,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:43,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188688234] [2024-06-14 15:51:43,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:43,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:54,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:54,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188688234] [2024-06-14 15:51:54,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188688234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:54,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:54,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:54,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603010619] [2024-06-14 15:51:54,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:54,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:54,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:54,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:54,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:54,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:51:54,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 194 transitions, 2400 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-14 15:51:54,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:54,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:51:54,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:54,600 INFO L124 PetriNetUnfolderBase]: 404/751 cut-off events. [2024-06-14 15:51:54,601 INFO L125 PetriNetUnfolderBase]: For 61237/61237 co-relation queries the response was YES. [2024-06-14 15:51:54,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6537 conditions, 751 events. 404/751 cut-off events. For 61237/61237 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3660 event pairs, 33 based on Foata normal form. 2/751 useless extension candidates. Maximal degree in co-relation 6439. Up to 515 conditions per place. [2024-06-14 15:51:54,607 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 138 selfloop transitions, 69 changer transitions 0/210 dead transitions. [2024-06-14 15:51:54,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 210 transitions, 3146 flow [2024-06-14 15:51:54,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-14 15:51:54,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-14 15:51:54,610 INFO L175 Difference]: Start difference. First operand has 202 places, 194 transitions, 2400 flow. Second operand 10 states and 131 transitions. [2024-06-14 15:51:54,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 210 transitions, 3146 flow [2024-06-14 15:51:54,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 210 transitions, 3042 flow, removed 36 selfloop flow, removed 8 redundant places. [2024-06-14 15:51:54,712 INFO L231 Difference]: Finished difference. Result has 204 places, 196 transitions, 2504 flow [2024-06-14 15:51:54,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2504, PETRI_PLACES=204, PETRI_TRANSITIONS=196} [2024-06-14 15:51:54,713 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 173 predicate places. [2024-06-14 15:51:54,713 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 196 transitions, 2504 flow [2024-06-14 15:51:54,713 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-14 15:51:54,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:54,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:54,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:51:54,714 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:54,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:54,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1857476948, now seen corresponding path program 8 times [2024-06-14 15:51:54,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:54,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721960704] [2024-06-14 15:51:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:02,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:02,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721960704] [2024-06-14 15:52:02,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721960704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:02,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:02,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:02,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742445898] [2024-06-14 15:52:02,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:02,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:02,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:02,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:02,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:03,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:52:03,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 196 transitions, 2504 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-14 15:52:03,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:03,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:52:03,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:03,542 INFO L124 PetriNetUnfolderBase]: 400/745 cut-off events. [2024-06-14 15:52:03,542 INFO L125 PetriNetUnfolderBase]: For 59561/59561 co-relation queries the response was YES. [2024-06-14 15:52:03,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6418 conditions, 745 events. 400/745 cut-off events. For 59561/59561 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3611 event pairs, 32 based on Foata normal form. 2/745 useless extension candidates. Maximal degree in co-relation 6319. Up to 605 conditions per place. [2024-06-14 15:52:03,560 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 167 selfloop transitions, 39 changer transitions 0/209 dead transitions. [2024-06-14 15:52:03,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 209 transitions, 3068 flow [2024-06-14 15:52:03,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:52:03,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 15:52:03,563 INFO L175 Difference]: Start difference. First operand has 204 places, 196 transitions, 2504 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:52:03,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 209 transitions, 3068 flow [2024-06-14 15:52:03,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 209 transitions, 2821 flow, removed 72 selfloop flow, removed 7 redundant places. [2024-06-14 15:52:03,702 INFO L231 Difference]: Finished difference. Result has 207 places, 196 transitions, 2343 flow [2024-06-14 15:52:03,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2257, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2343, PETRI_PLACES=207, PETRI_TRANSITIONS=196} [2024-06-14 15:52:03,702 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2024-06-14 15:52:03,702 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 196 transitions, 2343 flow [2024-06-14 15:52:03,703 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-14 15:52:03,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:03,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:03,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:52:03,703 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:03,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:03,704 INFO L85 PathProgramCache]: Analyzing trace with hash -713178926, now seen corresponding path program 5 times [2024-06-14 15:52:03,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:03,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980901563] [2024-06-14 15:52:03,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:03,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:10,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:10,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980901563] [2024-06-14 15:52:10,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980901563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:10,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:10,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:52:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297465234] [2024-06-14 15:52:10,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:10,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:52:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:52:10,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:52:10,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:52:10,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 196 transitions, 2343 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-14 15:52:10,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:10,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:52:10,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:10,947 INFO L124 PetriNetUnfolderBase]: 397/741 cut-off events. [2024-06-14 15:52:10,948 INFO L125 PetriNetUnfolderBase]: For 56373/56376 co-relation queries the response was YES. [2024-06-14 15:52:10,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6103 conditions, 741 events. 397/741 cut-off events. For 56373/56376 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3596 event pairs, 37 based on Foata normal form. 2/738 useless extension candidates. Maximal degree in co-relation 6003. Up to 618 conditions per place. [2024-06-14 15:52:10,955 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 174 selfloop transitions, 30 changer transitions 0/207 dead transitions. [2024-06-14 15:52:10,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 207 transitions, 2785 flow [2024-06-14 15:52:10,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:52:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:52:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 15:52:10,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-14 15:52:10,956 INFO L175 Difference]: Start difference. First operand has 207 places, 196 transitions, 2343 flow. Second operand 9 states and 110 transitions. [2024-06-14 15:52:10,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 207 transitions, 2785 flow [2024-06-14 15:52:11,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 207 transitions, 2711 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 15:52:11,079 INFO L231 Difference]: Finished difference. Result has 208 places, 197 transitions, 2343 flow [2024-06-14 15:52:11,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2269, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2343, PETRI_PLACES=208, PETRI_TRANSITIONS=197} [2024-06-14 15:52:11,079 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 177 predicate places. [2024-06-14 15:52:11,079 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 197 transitions, 2343 flow [2024-06-14 15:52:11,079 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-14 15:52:11,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:11,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:11,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:52:11,080 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:11,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:11,080 INFO L85 PathProgramCache]: Analyzing trace with hash -712994228, now seen corresponding path program 2 times [2024-06-14 15:52:11,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:11,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391025578] [2024-06-14 15:52:11,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:18,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:18,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391025578] [2024-06-14 15:52:18,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391025578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:18,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:18,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:18,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784037564] [2024-06-14 15:52:18,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:18,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:18,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:18,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:18,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:19,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:52:19,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 197 transitions, 2343 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-14 15:52:19,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:19,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:52:19,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:19,480 INFO L124 PetriNetUnfolderBase]: 393/735 cut-off events. [2024-06-14 15:52:19,481 INFO L125 PetriNetUnfolderBase]: For 54157/54160 co-relation queries the response was YES. [2024-06-14 15:52:19,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5929 conditions, 735 events. 393/735 cut-off events. For 54157/54160 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3576 event pairs, 37 based on Foata normal form. 2/732 useless extension candidates. Maximal degree in co-relation 5828. Up to 600 conditions per place. [2024-06-14 15:52:19,487 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 167 selfloop transitions, 37 changer transitions 0/207 dead transitions. [2024-06-14 15:52:19,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 207 transitions, 2775 flow [2024-06-14 15:52:19,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:52:19,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:52:19,489 INFO L175 Difference]: Start difference. First operand has 208 places, 197 transitions, 2343 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:52:19,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 207 transitions, 2775 flow [2024-06-14 15:52:19,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 207 transitions, 2582 flow, removed 41 selfloop flow, removed 10 redundant places. [2024-06-14 15:52:19,610 INFO L231 Difference]: Finished difference. Result has 208 places, 197 transitions, 2230 flow [2024-06-14 15:52:19,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2230, PETRI_PLACES=208, PETRI_TRANSITIONS=197} [2024-06-14 15:52:19,612 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 177 predicate places. [2024-06-14 15:52:19,612 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 197 transitions, 2230 flow [2024-06-14 15:52:19,612 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-14 15:52:19,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:19,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:19,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:52:19,613 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:19,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:19,613 INFO L85 PathProgramCache]: Analyzing trace with hash -712994476, now seen corresponding path program 9 times [2024-06-14 15:52:19,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:19,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947676716] [2024-06-14 15:52:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:19,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:30,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-14 15:52:30,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:30,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947676716] [2024-06-14 15:52:30,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947676716] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:30,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:30,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:30,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728901979] [2024-06-14 15:52:30,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:30,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:30,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:30,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:30,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:30,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:52:30,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 197 transitions, 2230 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-14 15:52:30,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:30,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:52:30,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:30,884 INFO L124 PetriNetUnfolderBase]: 409/765 cut-off events. [2024-06-14 15:52:30,885 INFO L125 PetriNetUnfolderBase]: For 60357/60360 co-relation queries the response was YES. [2024-06-14 15:52:30,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6315 conditions, 765 events. 409/765 cut-off events. For 60357/60360 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3778 event pairs, 38 based on Foata normal form. 2/762 useless extension candidates. Maximal degree in co-relation 6215. Up to 606 conditions per place. [2024-06-14 15:52:30,890 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 169 selfloop transitions, 42 changer transitions 0/214 dead transitions. [2024-06-14 15:52:30,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 214 transitions, 2976 flow [2024-06-14 15:52:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:30,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:52:30,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-14 15:52:30,892 INFO L175 Difference]: Start difference. First operand has 208 places, 197 transitions, 2230 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:52:30,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 214 transitions, 2976 flow [2024-06-14 15:52:31,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 214 transitions, 2880 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-14 15:52:31,010 INFO L231 Difference]: Finished difference. Result has 209 places, 202 transitions, 2379 flow [2024-06-14 15:52:31,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2379, PETRI_PLACES=209, PETRI_TRANSITIONS=202} [2024-06-14 15:52:31,011 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 178 predicate places. [2024-06-14 15:52:31,011 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 202 transitions, 2379 flow [2024-06-14 15:52:31,011 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-14 15:52:31,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:31,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:31,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:52:31,011 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:31,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:31,012 INFO L85 PathProgramCache]: Analyzing trace with hash -706498798, now seen corresponding path program 2 times [2024-06-14 15:52:31,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:31,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828652109] [2024-06-14 15:52:31,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:31,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:38,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:38,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828652109] [2024-06-14 15:52:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828652109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:38,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:38,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:38,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595669300] [2024-06-14 15:52:38,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:38,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:38,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:38,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:38,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:39,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:52:39,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 202 transitions, 2379 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-14 15:52:39,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:39,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:52:39,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:39,544 INFO L124 PetriNetUnfolderBase]: 413/773 cut-off events. [2024-06-14 15:52:39,544 INFO L125 PetriNetUnfolderBase]: For 62634/62637 co-relation queries the response was YES. [2024-06-14 15:52:39,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6434 conditions, 773 events. 413/773 cut-off events. For 62634/62637 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3831 event pairs, 33 based on Foata normal form. 4/773 useless extension candidates. Maximal degree in co-relation 6333. Up to 679 conditions per place. [2024-06-14 15:52:39,551 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 192 selfloop transitions, 20 changer transitions 0/215 dead transitions. [2024-06-14 15:52:39,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 215 transitions, 2855 flow [2024-06-14 15:52:39,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 15:52:39,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-14 15:52:39,552 INFO L175 Difference]: Start difference. First operand has 209 places, 202 transitions, 2379 flow. Second operand 10 states and 117 transitions. [2024-06-14 15:52:39,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 215 transitions, 2855 flow [2024-06-14 15:52:39,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 215 transitions, 2722 flow, removed 45 selfloop flow, removed 6 redundant places. [2024-06-14 15:52:39,672 INFO L231 Difference]: Finished difference. Result has 213 places, 203 transitions, 2312 flow [2024-06-14 15:52:39,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2312, PETRI_PLACES=213, PETRI_TRANSITIONS=203} [2024-06-14 15:52:39,673 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2024-06-14 15:52:39,673 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 203 transitions, 2312 flow [2024-06-14 15:52:39,673 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-14 15:52:39,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:39,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:39,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:52:39,673 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:39,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:39,674 INFO L85 PathProgramCache]: Analyzing trace with hash -706499108, now seen corresponding path program 3 times [2024-06-14 15:52:39,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:39,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601228530] [2024-06-14 15:52:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:48,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:48,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601228530] [2024-06-14 15:52:48,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601228530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:48,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:48,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:48,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731367044] [2024-06-14 15:52:48,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:48,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:48,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:48,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:48,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:48,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:52:48,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 203 transitions, 2312 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-14 15:52:48,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:48,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:52:48,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:48,798 INFO L124 PetriNetUnfolderBase]: 416/778 cut-off events. [2024-06-14 15:52:48,798 INFO L125 PetriNetUnfolderBase]: For 61459/61462 co-relation queries the response was YES. [2024-06-14 15:52:48,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6400 conditions, 778 events. 416/778 cut-off events. For 61459/61462 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3864 event pairs, 37 based on Foata normal form. 1/774 useless extension candidates. Maximal degree in co-relation 6297. Up to 611 conditions per place. [2024-06-14 15:52:48,805 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 161 selfloop transitions, 52 changer transitions 0/216 dead transitions. [2024-06-14 15:52:48,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 216 transitions, 2938 flow [2024-06-14 15:52:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 15:52:48,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-14 15:52:48,806 INFO L175 Difference]: Start difference. First operand has 213 places, 203 transitions, 2312 flow. Second operand 10 states and 129 transitions. [2024-06-14 15:52:48,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 216 transitions, 2938 flow [2024-06-14 15:52:48,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 216 transitions, 2879 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:52:48,943 INFO L231 Difference]: Finished difference. Result has 215 places, 205 transitions, 2406 flow [2024-06-14 15:52:48,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2253, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2406, PETRI_PLACES=215, PETRI_TRANSITIONS=205} [2024-06-14 15:52:48,943 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 184 predicate places. [2024-06-14 15:52:48,943 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 205 transitions, 2406 flow [2024-06-14 15:52:48,943 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-14 15:52:48,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:48,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:48,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:52:48,944 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:48,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:48,944 INFO L85 PathProgramCache]: Analyzing trace with hash -713000986, now seen corresponding path program 10 times [2024-06-14 15:52:48,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:48,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201995715] [2024-06-14 15:52:48,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:57,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-14 15:52:57,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:57,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201995715] [2024-06-14 15:52:57,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201995715] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:57,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:57,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:57,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118321982] [2024-06-14 15:52:57,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:57,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:57,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:57,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:57,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:57,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:52:57,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 205 transitions, 2406 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-14 15:52:57,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:57,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:52:57,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:57,713 INFO L124 PetriNetUnfolderBase]: 414/775 cut-off events. [2024-06-14 15:52:57,713 INFO L125 PetriNetUnfolderBase]: For 60566/60569 co-relation queries the response was YES. [2024-06-14 15:52:57,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6363 conditions, 775 events. 414/775 cut-off events. For 60566/60569 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3846 event pairs, 37 based on Foata normal form. 1/771 useless extension candidates. Maximal degree in co-relation 6259. Up to 618 conditions per place. [2024-06-14 15:52:57,719 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 171 selfloop transitions, 44 changer transitions 0/218 dead transitions. [2024-06-14 15:52:57,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 218 transitions, 3060 flow [2024-06-14 15:52:57,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:52:57,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 15:52:57,721 INFO L175 Difference]: Start difference. First operand has 215 places, 205 transitions, 2406 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:52:57,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 218 transitions, 3060 flow [2024-06-14 15:52:57,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 218 transitions, 2932 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-14 15:52:57,861 INFO L231 Difference]: Finished difference. Result has 218 places, 207 transitions, 2439 flow [2024-06-14 15:52:57,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2278, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2439, PETRI_PLACES=218, PETRI_TRANSITIONS=207} [2024-06-14 15:52:57,861 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 187 predicate places. [2024-06-14 15:52:57,861 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 207 transitions, 2439 flow [2024-06-14 15:52:57,861 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-14 15:52:57,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:57,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:57,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:52:57,862 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:57,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:57,862 INFO L85 PathProgramCache]: Analyzing trace with hash -706507478, now seen corresponding path program 4 times [2024-06-14 15:52:57,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:57,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361352790] [2024-06-14 15:52:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:57,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:06,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:06,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361352790] [2024-06-14 15:53:06,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361352790] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:06,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:06,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:06,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289007497] [2024-06-14 15:53:06,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:06,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:06,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:06,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:06,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:06,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:53:06,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 207 transitions, 2439 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-14 15:53:06,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:06,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:53:06,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:06,720 INFO L124 PetriNetUnfolderBase]: 412/772 cut-off events. [2024-06-14 15:53:06,721 INFO L125 PetriNetUnfolderBase]: For 60246/60249 co-relation queries the response was YES. [2024-06-14 15:53:06,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6262 conditions, 772 events. 412/772 cut-off events. For 60246/60249 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3824 event pairs, 37 based on Foata normal form. 1/768 useless extension candidates. Maximal degree in co-relation 6157. Up to 606 conditions per place. [2024-06-14 15:53:06,728 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 164 selfloop transitions, 50 changer transitions 0/217 dead transitions. [2024-06-14 15:53:06,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 217 transitions, 2891 flow [2024-06-14 15:53:06,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 15:53:06,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:53:06,729 INFO L175 Difference]: Start difference. First operand has 218 places, 207 transitions, 2439 flow. Second operand 10 states and 128 transitions. [2024-06-14 15:53:06,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 217 transitions, 2891 flow [2024-06-14 15:53:06,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 217 transitions, 2692 flow, removed 50 selfloop flow, removed 8 redundant places. [2024-06-14 15:53:06,863 INFO L231 Difference]: Finished difference. Result has 220 places, 207 transitions, 2345 flow [2024-06-14 15:53:06,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2345, PETRI_PLACES=220, PETRI_TRANSITIONS=207} [2024-06-14 15:53:06,864 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 189 predicate places. [2024-06-14 15:53:06,864 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 207 transitions, 2345 flow [2024-06-14 15:53:06,864 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-14 15:53:06,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:06,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:06,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:53:06,864 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:06,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:06,865 INFO L85 PathProgramCache]: Analyzing trace with hash -706507726, now seen corresponding path program 11 times [2024-06-14 15:53:06,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:06,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399949601] [2024-06-14 15:53:06,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:06,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:16,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:16,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399949601] [2024-06-14 15:53:16,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399949601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:16,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:16,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:16,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771878079] [2024-06-14 15:53:16,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:16,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:16,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:16,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:16,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:16,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:53:16,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 207 transitions, 2345 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-14 15:53:16,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:16,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:53:16,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:17,327 INFO L124 PetriNetUnfolderBase]: 433/812 cut-off events. [2024-06-14 15:53:17,327 INFO L125 PetriNetUnfolderBase]: For 72174/72177 co-relation queries the response was YES. [2024-06-14 15:53:17,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6837 conditions, 812 events. 433/812 cut-off events. For 72174/72177 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4073 event pairs, 38 based on Foata normal form. 2/809 useless extension candidates. Maximal degree in co-relation 6732. Up to 594 conditions per place. [2024-06-14 15:53:17,334 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 165 selfloop transitions, 59 changer transitions 0/227 dead transitions. [2024-06-14 15:53:17,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 227 transitions, 3343 flow [2024-06-14 15:53:17,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-14 15:53:17,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-14 15:53:17,337 INFO L175 Difference]: Start difference. First operand has 220 places, 207 transitions, 2345 flow. Second operand 10 states and 132 transitions. [2024-06-14 15:53:17,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 227 transitions, 3343 flow [2024-06-14 15:53:17,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 227 transitions, 3236 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:17,488 INFO L231 Difference]: Finished difference. Result has 221 places, 214 transitions, 2594 flow [2024-06-14 15:53:17,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2238, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2594, PETRI_PLACES=221, PETRI_TRANSITIONS=214} [2024-06-14 15:53:17,489 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 190 predicate places. [2024-06-14 15:53:17,489 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 214 transitions, 2594 flow [2024-06-14 15:53:17,489 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-14 15:53:17,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:17,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:17,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 15:53:17,490 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:17,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash -706738366, now seen corresponding path program 12 times [2024-06-14 15:53:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:17,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118624625] [2024-06-14 15:53:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:17,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:28,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:28,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118624625] [2024-06-14 15:53:28,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118624625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:28,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:28,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:28,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563044188] [2024-06-14 15:53:28,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:28,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:28,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:28,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:28,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:28,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:53:28,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 214 transitions, 2594 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-14 15:53:28,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:28,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:53:28,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:29,017 INFO L124 PetriNetUnfolderBase]: 439/824 cut-off events. [2024-06-14 15:53:29,017 INFO L125 PetriNetUnfolderBase]: For 75693/75696 co-relation queries the response was YES. [2024-06-14 15:53:29,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7093 conditions, 824 events. 439/824 cut-off events. For 75693/75696 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4184 event pairs, 38 based on Foata normal form. 2/821 useless extension candidates. Maximal degree in co-relation 6987. Up to 600 conditions per place. [2024-06-14 15:53:29,025 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 170 selfloop transitions, 58 changer transitions 0/231 dead transitions. [2024-06-14 15:53:29,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 231 transitions, 3620 flow [2024-06-14 15:53:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-14 15:53:29,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-14 15:53:29,026 INFO L175 Difference]: Start difference. First operand has 221 places, 214 transitions, 2594 flow. Second operand 10 states and 135 transitions. [2024-06-14 15:53:29,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 231 transitions, 3620 flow [2024-06-14 15:53:29,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 231 transitions, 3448 flow, removed 63 selfloop flow, removed 5 redundant places. [2024-06-14 15:53:29,191 INFO L231 Difference]: Finished difference. Result has 226 places, 217 transitions, 2645 flow [2024-06-14 15:53:29,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2430, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2645, PETRI_PLACES=226, PETRI_TRANSITIONS=217} [2024-06-14 15:53:29,193 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 195 predicate places. [2024-06-14 15:53:29,193 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 217 transitions, 2645 flow [2024-06-14 15:53:29,193 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-14 15:53:29,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:29,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:29,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 15:53:29,194 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:29,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:29,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1059817710, now seen corresponding path program 3 times [2024-06-14 15:53:29,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:29,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514135853] [2024-06-14 15:53:29,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:29,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:37,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:37,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514135853] [2024-06-14 15:53:37,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514135853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:37,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:37,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:37,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713071471] [2024-06-14 15:53:37,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:37,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:37,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:37,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:37,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:37,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:53:37,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 217 transitions, 2645 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-14 15:53:37,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:37,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:53:37,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:37,638 INFO L124 PetriNetUnfolderBase]: 446/836 cut-off events. [2024-06-14 15:53:37,638 INFO L125 PetriNetUnfolderBase]: For 76462/76462 co-relation queries the response was YES. [2024-06-14 15:53:37,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7119 conditions, 836 events. 446/836 cut-off events. For 76462/76462 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4258 event pairs, 34 based on Foata normal form. 2/836 useless extension candidates. Maximal degree in co-relation 7011. Up to 751 conditions per place. [2024-06-14 15:53:37,646 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 214 selfloop transitions, 15 changer transitions 0/232 dead transitions. [2024-06-14 15:53:37,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 232 transitions, 3171 flow [2024-06-14 15:53:37,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 15:53:37,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:53:37,657 INFO L175 Difference]: Start difference. First operand has 226 places, 217 transitions, 2645 flow. Second operand 10 states and 115 transitions. [2024-06-14 15:53:37,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 232 transitions, 3171 flow [2024-06-14 15:53:37,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 232 transitions, 2934 flow, removed 43 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:37,867 INFO L231 Difference]: Finished difference. Result has 229 places, 221 transitions, 2498 flow [2024-06-14 15:53:37,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2408, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2498, PETRI_PLACES=229, PETRI_TRANSITIONS=221} [2024-06-14 15:53:37,867 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 198 predicate places. [2024-06-14 15:53:37,868 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 221 transitions, 2498 flow [2024-06-14 15:53:37,868 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-14 15:53:37,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:37,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:37,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 15:53:37,868 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:37,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:37,870 INFO L85 PathProgramCache]: Analyzing trace with hash -706744876, now seen corresponding path program 13 times [2024-06-14 15:53:37,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:37,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193663825] [2024-06-14 15:53:37,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:37,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:46,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-14 15:53:46,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:46,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193663825] [2024-06-14 15:53:46,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193663825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:46,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:46,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:46,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593808751] [2024-06-14 15:53:46,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:46,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:46,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:46,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:46,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:46,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:53:46,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 221 transitions, 2498 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:46,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:46,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:53:46,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:46,877 INFO L124 PetriNetUnfolderBase]: 444/834 cut-off events. [2024-06-14 15:53:46,877 INFO L125 PetriNetUnfolderBase]: For 71779/71782 co-relation queries the response was YES. [2024-06-14 15:53:46,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6765 conditions, 834 events. 444/834 cut-off events. For 71779/71782 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4231 event pairs, 37 based on Foata normal form. 1/830 useless extension candidates. Maximal degree in co-relation 6655. Up to 612 conditions per place. [2024-06-14 15:53:46,884 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 168 selfloop transitions, 64 changer transitions 0/235 dead transitions. [2024-06-14 15:53:46,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 235 transitions, 3344 flow [2024-06-14 15:53:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 15:53:46,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 15:53:46,887 INFO L175 Difference]: Start difference. First operand has 229 places, 221 transitions, 2498 flow. Second operand 10 states and 123 transitions. [2024-06-14 15:53:46,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 235 transitions, 3344 flow [2024-06-14 15:53:47,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 235 transitions, 3300 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-14 15:53:47,046 INFO L231 Difference]: Finished difference. Result has 233 places, 223 transitions, 2659 flow [2024-06-14 15:53:47,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2454, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2659, PETRI_PLACES=233, PETRI_TRANSITIONS=223} [2024-06-14 15:53:47,047 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 202 predicate places. [2024-06-14 15:53:47,047 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 223 transitions, 2659 flow [2024-06-14 15:53:47,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:47,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:47,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:47,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 15:53:47,048 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:47,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:47,048 INFO L85 PathProgramCache]: Analyzing trace with hash 344677412, now seen corresponding path program 4 times [2024-06-14 15:53:47,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:47,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655057121] [2024-06-14 15:53:47,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:47,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:55,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:55,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655057121] [2024-06-14 15:53:55,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655057121] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:55,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:55,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:55,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135454204] [2024-06-14 15:53:55,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:55,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:55,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:55,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:55,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:56,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:53:56,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 223 transitions, 2659 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-14 15:53:56,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:56,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:53:56,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:56,442 INFO L124 PetriNetUnfolderBase]: 448/842 cut-off events. [2024-06-14 15:53:56,442 INFO L125 PetriNetUnfolderBase]: For 77207/77210 co-relation queries the response was YES. [2024-06-14 15:53:56,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6941 conditions, 842 events. 448/842 cut-off events. For 77207/77210 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4289 event pairs, 32 based on Foata normal form. 4/842 useless extension candidates. Maximal degree in co-relation 6830. Up to 719 conditions per place. [2024-06-14 15:53:56,450 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 203 selfloop transitions, 30 changer transitions 0/236 dead transitions. [2024-06-14 15:53:56,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 236 transitions, 3181 flow [2024-06-14 15:53:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 15:53:56,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:53:56,452 INFO L175 Difference]: Start difference. First operand has 233 places, 223 transitions, 2659 flow. Second operand 10 states and 120 transitions. [2024-06-14 15:53:56,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 236 transitions, 3181 flow [2024-06-14 15:53:56,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 236 transitions, 3005 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-06-14 15:53:56,616 INFO L231 Difference]: Finished difference. Result has 236 places, 224 transitions, 2573 flow [2024-06-14 15:53:56,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2483, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2573, PETRI_PLACES=236, PETRI_TRANSITIONS=224} [2024-06-14 15:53:56,617 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 205 predicate places. [2024-06-14 15:53:56,617 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 224 transitions, 2573 flow [2024-06-14 15:53:56,617 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-14 15:53:56,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:56,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:56,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 15:53:56,617 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:56,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:56,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1344926508, now seen corresponding path program 14 times [2024-06-14 15:53:56,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:56,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413353485] [2024-06-14 15:53:56,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:56,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:06,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:06,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413353485] [2024-06-14 15:54:06,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413353485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:06,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:06,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:06,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771503294] [2024-06-14 15:54:06,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:06,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:06,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:06,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:06,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:06,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:54:06,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 224 transitions, 2573 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-14 15:54:06,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:06,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:54:06,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:07,436 INFO L124 PetriNetUnfolderBase]: 474/894 cut-off events. [2024-06-14 15:54:07,437 INFO L125 PetriNetUnfolderBase]: For 91297/91300 co-relation queries the response was YES. [2024-06-14 15:54:07,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7750 conditions, 894 events. 474/894 cut-off events. For 91297/91300 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4688 event pairs, 38 based on Foata normal form. 2/891 useless extension candidates. Maximal degree in co-relation 7638. Up to 440 conditions per place. [2024-06-14 15:54:07,447 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 135 selfloop transitions, 112 changer transitions 0/250 dead transitions. [2024-06-14 15:54:07,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 250 transitions, 4048 flow [2024-06-14 15:54:07,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:54:07,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:54:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-14 15:54:07,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434375 [2024-06-14 15:54:07,450 INFO L175 Difference]: Start difference. First operand has 236 places, 224 transitions, 2573 flow. Second operand 10 states and 139 transitions. [2024-06-14 15:54:07,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 250 transitions, 4048 flow [2024-06-14 15:54:07,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 250 transitions, 3956 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-14 15:54:07,655 INFO L231 Difference]: Finished difference. Result has 237 places, 233 transitions, 3014 flow [2024-06-14 15:54:07,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2481, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3014, PETRI_PLACES=237, PETRI_TRANSITIONS=233} [2024-06-14 15:54:07,656 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 206 predicate places. [2024-06-14 15:54:07,656 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 233 transitions, 3014 flow [2024-06-14 15:54:07,656 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-14 15:54:07,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:07,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:07,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 15:54:07,657 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:07,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1345156900, now seen corresponding path program 5 times [2024-06-14 15:54:07,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:07,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748771338] [2024-06-14 15:54:07,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:15,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:15,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748771338] [2024-06-14 15:54:15,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748771338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:15,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:15,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:15,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630562761] [2024-06-14 15:54:15,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:15,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:15,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:15,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:15,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:15,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:54:15,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 233 transitions, 3014 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-14 15:54:15,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:15,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:54:15,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:15,987 INFO L124 PetriNetUnfolderBase]: 472/885 cut-off events. [2024-06-14 15:54:15,988 INFO L125 PetriNetUnfolderBase]: For 88858/88861 co-relation queries the response was YES. [2024-06-14 15:54:15,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7865 conditions, 885 events. 472/885 cut-off events. For 88858/88861 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4585 event pairs, 44 based on Foata normal form. 1/879 useless extension candidates. Maximal degree in co-relation 7753. Up to 628 conditions per place. [2024-06-14 15:54:15,995 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 166 selfloop transitions, 74 changer transitions 0/243 dead transitions. [2024-06-14 15:54:15,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 243 transitions, 3518 flow [2024-06-14 15:54:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:54:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:54:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:54:15,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 15:54:15,997 INFO L175 Difference]: Start difference. First operand has 237 places, 233 transitions, 3014 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:54:15,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 243 transitions, 3518 flow [2024-06-14 15:54:16,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 243 transitions, 3150 flow, removed 89 selfloop flow, removed 6 redundant places. [2024-06-14 15:54:16,189 INFO L231 Difference]: Finished difference. Result has 241 places, 233 transitions, 2799 flow [2024-06-14 15:54:16,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2646, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2799, PETRI_PLACES=241, PETRI_TRANSITIONS=233} [2024-06-14 15:54:16,189 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 210 predicate places. [2024-06-14 15:54:16,189 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 233 transitions, 2799 flow [2024-06-14 15:54:16,190 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-14 15:54:16,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:16,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:16,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 15:54:16,190 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:16,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:16,190 INFO L85 PathProgramCache]: Analyzing trace with hash 344431334, now seen corresponding path program 15 times [2024-06-14 15:54:16,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:16,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109672268] [2024-06-14 15:54:16,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:16,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:24,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:24,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109672268] [2024-06-14 15:54:24,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109672268] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:24,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:24,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:24,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818781755] [2024-06-14 15:54:24,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:24,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:24,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:24,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:24,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:24,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:54:24,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 233 transitions, 2799 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-14 15:54:24,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:24,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:54:24,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:24,923 INFO L124 PetriNetUnfolderBase]: 485/912 cut-off events. [2024-06-14 15:54:24,923 INFO L125 PetriNetUnfolderBase]: For 94424/94427 co-relation queries the response was YES. [2024-06-14 15:54:24,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7938 conditions, 912 events. 485/912 cut-off events. For 94424/94427 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4792 event pairs, 37 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 7826. Up to 453 conditions per place. [2024-06-14 15:54:24,932 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 124 selfloop transitions, 126 changer transitions 0/253 dead transitions. [2024-06-14 15:54:24,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 253 transitions, 3999 flow [2024-06-14 15:54:24,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:54:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:54:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-14 15:54:24,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-14 15:54:24,935 INFO L175 Difference]: Start difference. First operand has 241 places, 233 transitions, 2799 flow. Second operand 10 states and 135 transitions. [2024-06-14 15:54:24,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 253 transitions, 3999 flow [2024-06-14 15:54:25,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 253 transitions, 3842 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:54:25,113 INFO L231 Difference]: Finished difference. Result has 242 places, 240 transitions, 3121 flow [2024-06-14 15:54:25,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2642, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3121, PETRI_PLACES=242, PETRI_TRANSITIONS=240} [2024-06-14 15:54:25,114 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2024-06-14 15:54:25,114 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 3121 flow [2024-06-14 15:54:25,114 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-14 15:54:25,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:25,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:25,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 15:54:25,115 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:25,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1345157148, now seen corresponding path program 16 times [2024-06-14 15:54:25,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:25,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208055171] [2024-06-14 15:54:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:25,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:32,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:32,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208055171] [2024-06-14 15:54:32,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208055171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:32,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:32,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:32,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113386599] [2024-06-14 15:54:32,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:32,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:32,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:32,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:32,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:32,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:54:32,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 240 transitions, 3121 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-14 15:54:32,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:32,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:54:32,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:33,092 INFO L124 PetriNetUnfolderBase]: 481/906 cut-off events. [2024-06-14 15:54:33,092 INFO L125 PetriNetUnfolderBase]: For 94497/94500 co-relation queries the response was YES. [2024-06-14 15:54:33,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7892 conditions, 906 events. 481/906 cut-off events. For 94497/94500 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4758 event pairs, 38 based on Foata normal form. 2/903 useless extension candidates. Maximal degree in co-relation 7779. Up to 450 conditions per place. [2024-06-14 15:54:33,101 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 131 selfloop transitions, 120 changer transitions 0/254 dead transitions. [2024-06-14 15:54:33,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 254 transitions, 4145 flow [2024-06-14 15:54:33,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:54:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:54:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-14 15:54:33,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-14 15:54:33,102 INFO L175 Difference]: Start difference. First operand has 242 places, 240 transitions, 3121 flow. Second operand 10 states and 136 transitions. [2024-06-14 15:54:33,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 254 transitions, 4145 flow [2024-06-14 15:54:33,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 254 transitions, 3826 flow, removed 61 selfloop flow, removed 7 redundant places. [2024-06-14 15:54:33,289 INFO L231 Difference]: Finished difference. Result has 245 places, 241 transitions, 3087 flow [2024-06-14 15:54:33,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2810, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3087, PETRI_PLACES=245, PETRI_TRANSITIONS=241} [2024-06-14 15:54:33,292 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 214 predicate places. [2024-06-14 15:54:33,293 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 241 transitions, 3087 flow [2024-06-14 15:54:33,296 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-14 15:54:33,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:33,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:33,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 15:54:33,296 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:33,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1059826638, now seen corresponding path program 17 times [2024-06-14 15:54:33,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:33,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653589058] [2024-06-14 15:54:33,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:33,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:43,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:43,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653589058] [2024-06-14 15:54:43,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653589058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:43,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:43,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:43,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693637296] [2024-06-14 15:54:43,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:43,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:43,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:43,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:43,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:43,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:54:43,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 241 transitions, 3087 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-14 15:54:43,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:43,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:54:43,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:44,260 INFO L124 PetriNetUnfolderBase]: 479/902 cut-off events. [2024-06-14 15:54:44,261 INFO L125 PetriNetUnfolderBase]: For 90773/90773 co-relation queries the response was YES. [2024-06-14 15:54:44,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7726 conditions, 902 events. 479/902 cut-off events. For 90773/90773 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4715 event pairs, 33 based on Foata normal form. 1/901 useless extension candidates. Maximal degree in co-relation 7613. Up to 810 conditions per place. [2024-06-14 15:54:44,269 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 234 selfloop transitions, 16 changer transitions 0/253 dead transitions. [2024-06-14 15:54:44,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 253 transitions, 3655 flow [2024-06-14 15:54:44,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:54:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:54:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 15:54:44,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:54:44,271 INFO L175 Difference]: Start difference. First operand has 245 places, 241 transitions, 3087 flow. Second operand 10 states and 115 transitions. [2024-06-14 15:54:44,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 253 transitions, 3655 flow [2024-06-14 15:54:44,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 253 transitions, 3373 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-14 15:54:44,482 INFO L231 Difference]: Finished difference. Result has 249 places, 243 transitions, 2893 flow [2024-06-14 15:54:44,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2806, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2893, PETRI_PLACES=249, PETRI_TRANSITIONS=243} [2024-06-14 15:54:44,482 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-14 15:54:44,482 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 2893 flow [2024-06-14 15:54:44,483 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-14 15:54:44,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:44,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:44,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 15:54:44,483 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:44,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1049698380, now seen corresponding path program 5 times [2024-06-14 15:54:44,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:44,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708327226] [2024-06-14 15:54:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:44,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:53,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:53,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708327226] [2024-06-14 15:54:53,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708327226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:53,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:53,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:53,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595521155] [2024-06-14 15:54:53,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:53,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:53,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:53,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:53,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:53,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:54:53,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 243 transitions, 2893 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-14 15:54:53,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:53,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:54:53,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:53,584 INFO L124 PetriNetUnfolderBase]: 483/910 cut-off events. [2024-06-14 15:54:53,585 INFO L125 PetriNetUnfolderBase]: For 94631/94631 co-relation queries the response was YES. [2024-06-14 15:54:53,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7507 conditions, 910 events. 483/910 cut-off events. For 94631/94631 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4779 event pairs, 35 based on Foata normal form. 2/910 useless extension candidates. Maximal degree in co-relation 7392. Up to 809 conditions per place. [2024-06-14 15:54:53,593 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 234 selfloop transitions, 19 changer transitions 0/256 dead transitions. [2024-06-14 15:54:53,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 256 transitions, 3453 flow [2024-06-14 15:54:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:53,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-14 15:54:53,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-14 15:54:53,594 INFO L175 Difference]: Start difference. First operand has 249 places, 243 transitions, 2893 flow. Second operand 11 states and 126 transitions. [2024-06-14 15:54:53,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 256 transitions, 3453 flow [2024-06-14 15:54:53,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 256 transitions, 3369 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-14 15:54:53,821 INFO L231 Difference]: Finished difference. Result has 253 places, 244 transitions, 2879 flow [2024-06-14 15:54:53,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2809, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2879, PETRI_PLACES=253, PETRI_TRANSITIONS=244} [2024-06-14 15:54:53,831 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 222 predicate places. [2024-06-14 15:54:53,831 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 244 transitions, 2879 flow [2024-06-14 15:54:53,831 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-14 15:54:53,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:53,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:53,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 15:54:53,831 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:53,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1049342190, now seen corresponding path program 6 times [2024-06-14 15:54:53,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:53,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234662877] [2024-06-14 15:54:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:53,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:02,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:02,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234662877] [2024-06-14 15:55:02,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234662877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:02,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:02,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:55:02,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710026914] [2024-06-14 15:55:02,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:02,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:55:02,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:02,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:55:02,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:55:03,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:55:03,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 244 transitions, 2879 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-14 15:55:03,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:03,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:55:03,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:03,523 INFO L124 PetriNetUnfolderBase]: 480/905 cut-off events. [2024-06-14 15:55:03,524 INFO L125 PetriNetUnfolderBase]: For 91021/91021 co-relation queries the response was YES. [2024-06-14 15:55:03,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7306 conditions, 905 events. 480/905 cut-off events. For 91021/91021 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4739 event pairs, 32 based on Foata normal form. 2/905 useless extension candidates. Maximal degree in co-relation 7190. Up to 784 conditions per place. [2024-06-14 15:55:03,532 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 233 selfloop transitions, 20 changer transitions 0/256 dead transitions. [2024-06-14 15:55:03,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 256 transitions, 3413 flow [2024-06-14 15:55:03,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:55:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:55:03,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 15:55:03,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-14 15:55:03,533 INFO L175 Difference]: Start difference. First operand has 253 places, 244 transitions, 2879 flow. Second operand 10 states and 117 transitions. [2024-06-14 15:55:03,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 256 transitions, 3413 flow [2024-06-14 15:55:03,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 256 transitions, 3333 flow, removed 15 selfloop flow, removed 11 redundant places. [2024-06-14 15:55:03,759 INFO L231 Difference]: Finished difference. Result has 252 places, 244 transitions, 2843 flow [2024-06-14 15:55:03,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2799, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2843, PETRI_PLACES=252, PETRI_TRANSITIONS=244} [2024-06-14 15:55:03,759 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 221 predicate places. [2024-06-14 15:55:03,759 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 244 transitions, 2843 flow [2024-06-14 15:55:03,759 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-14 15:55:03,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:03,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:03,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 15:55:03,760 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:55:03,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:03,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1575539419, now seen corresponding path program 1 times [2024-06-14 15:55:03,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:03,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264502353] [2024-06-14 15:55:03,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:03,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:11,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:11,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264502353] [2024-06-14 15:55:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264502353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:11,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:55:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757814283] [2024-06-14 15:55:11,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:11,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:55:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:11,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:55:11,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:55:11,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:55:11,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 244 transitions, 2843 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-14 15:55:11,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:11,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:55:11,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:12,333 INFO L124 PetriNetUnfolderBase]: 484/913 cut-off events. [2024-06-14 15:55:12,334 INFO L125 PetriNetUnfolderBase]: For 93245/93245 co-relation queries the response was YES. [2024-06-14 15:55:12,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7335 conditions, 913 events. 484/913 cut-off events. For 93245/93245 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4817 event pairs, 12 based on Foata normal form. 2/913 useless extension candidates. Maximal degree in co-relation 7220. Up to 763 conditions per place. [2024-06-14 15:55:12,346 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 244 selfloop transitions, 19 changer transitions 0/266 dead transitions. [2024-06-14 15:55:12,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 266 transitions, 3451 flow [2024-06-14 15:55:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:55:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:55:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 15:55:12,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 15:55:12,349 INFO L175 Difference]: Start difference. First operand has 252 places, 244 transitions, 2843 flow. Second operand 10 states and 123 transitions. [2024-06-14 15:55:12,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 266 transitions, 3451 flow [2024-06-14 15:55:12,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 266 transitions, 3359 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-14 15:55:12,628 INFO L231 Difference]: Finished difference. Result has 253 places, 245 transitions, 2819 flow [2024-06-14 15:55:12,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2751, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2819, PETRI_PLACES=253, PETRI_TRANSITIONS=245} [2024-06-14 15:55:12,629 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 222 predicate places. [2024-06-14 15:55:12,629 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 245 transitions, 2819 flow [2024-06-14 15:55:12,629 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-14 15:55:12,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:12,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:12,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 15:55:12,630 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:55:12,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:12,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1579348699, now seen corresponding path program 2 times [2024-06-14 15:55:12,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:12,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455623673] [2024-06-14 15:55:12,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455623673] [2024-06-14 15:55:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455623673] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:21,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:21,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:55:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339061389] [2024-06-14 15:55:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:21,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:55:21,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:21,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:55:21,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:55:21,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:55:21,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 245 transitions, 2819 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-14 15:55:21,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:21,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:55:21,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:22,469 INFO L124 PetriNetUnfolderBase]: 488/921 cut-off events. [2024-06-14 15:55:22,469 INFO L125 PetriNetUnfolderBase]: For 95217/95217 co-relation queries the response was YES. [2024-06-14 15:55:22,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7379 conditions, 921 events. 488/921 cut-off events. For 95217/95217 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4871 event pairs, 30 based on Foata normal form. 2/921 useless extension candidates. Maximal degree in co-relation 7263. Up to 793 conditions per place. [2024-06-14 15:55:22,479 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 241 selfloop transitions, 21 changer transitions 0/265 dead transitions. [2024-06-14 15:55:22,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 265 transitions, 3423 flow [2024-06-14 15:55:22,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:55:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:55:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:55:22,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:55:22,481 INFO L175 Difference]: Start difference. First operand has 253 places, 245 transitions, 2819 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:55:22,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 265 transitions, 3423 flow [2024-06-14 15:55:22,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 265 transitions, 3338 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-14 15:55:22,714 INFO L231 Difference]: Finished difference. Result has 254 places, 246 transitions, 2808 flow [2024-06-14 15:55:22,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2734, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2808, PETRI_PLACES=254, PETRI_TRANSITIONS=246} [2024-06-14 15:55:22,715 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 223 predicate places. [2024-06-14 15:55:22,715 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 246 transitions, 2808 flow [2024-06-14 15:55:22,715 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-14 15:55:22,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:22,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:22,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 15:55:22,716 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:55:22,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:22,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1622589289, now seen corresponding path program 3 times [2024-06-14 15:55:22,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:22,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139575035] [2024-06-14 15:55:22,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:32,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:32,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139575035] [2024-06-14 15:55:32,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139575035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:32,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:32,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:55:32,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970066569] [2024-06-14 15:55:32,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:32,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:55:32,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:32,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:55:32,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:55:32,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:55:32,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 246 transitions, 2808 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-14 15:55:32,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:32,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:55:32,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:33,255 INFO L124 PetriNetUnfolderBase]: 492/929 cut-off events. [2024-06-14 15:55:33,255 INFO L125 PetriNetUnfolderBase]: For 99058/99058 co-relation queries the response was YES. [2024-06-14 15:55:33,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7383 conditions, 929 events. 492/929 cut-off events. For 99058/99058 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4926 event pairs, 28 based on Foata normal form. 2/929 useless extension candidates. Maximal degree in co-relation 7267. Up to 796 conditions per place. [2024-06-14 15:55:33,264 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 244 selfloop transitions, 20 changer transitions 0/267 dead transitions. [2024-06-14 15:55:33,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 267 transitions, 3420 flow [2024-06-14 15:55:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:55:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:55:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:55:33,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:55:33,266 INFO L175 Difference]: Start difference. First operand has 254 places, 246 transitions, 2808 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:55:33,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 267 transitions, 3420 flow [2024-06-14 15:55:33,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 267 transitions, 3356 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 15:55:33,503 INFO L231 Difference]: Finished difference. Result has 256 places, 247 transitions, 2818 flow [2024-06-14 15:55:33,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2744, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2818, PETRI_PLACES=256, PETRI_TRANSITIONS=247} [2024-06-14 15:55:33,504 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 225 predicate places. [2024-06-14 15:55:33,504 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 247 transitions, 2818 flow [2024-06-14 15:55:33,504 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-14 15:55:33,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:33,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:33,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 15:55:33,505 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:55:33,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:33,505 INFO L85 PathProgramCache]: Analyzing trace with hash -690227581, now seen corresponding path program 1 times [2024-06-14 15:55:33,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:33,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546373135] [2024-06-14 15:55:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:33,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:41,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:41,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546373135] [2024-06-14 15:55:41,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546373135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:41,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:41,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:55:41,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469007930] [2024-06-14 15:55:41,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:41,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:55:41,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:41,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:55:41,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:55:41,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:55:41,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 247 transitions, 2818 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:41,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:41,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:55:41,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:41,989 INFO L124 PetriNetUnfolderBase]: 490/926 cut-off events. [2024-06-14 15:55:41,989 INFO L125 PetriNetUnfolderBase]: For 94247/94247 co-relation queries the response was YES. [2024-06-14 15:55:41,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7258 conditions, 926 events. 490/926 cut-off events. For 94247/94247 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4913 event pairs, 29 based on Foata normal form. 1/925 useless extension candidates. Maximal degree in co-relation 7141. Up to 798 conditions per place. [2024-06-14 15:55:42,001 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 241 selfloop transitions, 24 changer transitions 0/268 dead transitions. [2024-06-14 15:55:42,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 268 transitions, 3460 flow [2024-06-14 15:55:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:55:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:55:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 15:55:42,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-14 15:55:42,003 INFO L175 Difference]: Start difference. First operand has 256 places, 247 transitions, 2818 flow. Second operand 11 states and 134 transitions. [2024-06-14 15:55:42,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 268 transitions, 3460 flow [2024-06-14 15:55:42,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 268 transitions, 3396 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 15:55:42,232 INFO L231 Difference]: Finished difference. Result has 259 places, 249 transitions, 2869 flow [2024-06-14 15:55:42,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2754, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2869, PETRI_PLACES=259, PETRI_TRANSITIONS=249} [2024-06-14 15:55:42,232 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 228 predicate places. [2024-06-14 15:55:42,233 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 249 transitions, 2869 flow [2024-06-14 15:55:42,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:42,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:42,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:42,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 15:55:42,233 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:55:42,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash 901796133, now seen corresponding path program 4 times [2024-06-14 15:55:42,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:42,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700481740] [2024-06-14 15:55:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:42,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:53,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:53,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700481740] [2024-06-14 15:55:53,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700481740] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:53,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:53,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:55:53,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082259758] [2024-06-14 15:55:53,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:53,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:55:53,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:53,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:55:53,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:55:53,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:55:53,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 249 transitions, 2869 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-14 15:55:53,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:53,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:55:53,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:54,348 INFO L124 PetriNetUnfolderBase]: 494/934 cut-off events. [2024-06-14 15:55:54,348 INFO L125 PetriNetUnfolderBase]: For 99751/99751 co-relation queries the response was YES. [2024-06-14 15:55:54,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7328 conditions, 934 events. 494/934 cut-off events. For 99751/99751 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4965 event pairs, 31 based on Foata normal form. 2/934 useless extension candidates. Maximal degree in co-relation 7210. Up to 808 conditions per place. [2024-06-14 15:55:54,358 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 240 selfloop transitions, 24 changer transitions 0/267 dead transitions. [2024-06-14 15:55:54,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 267 transitions, 3482 flow [2024-06-14 15:55:54,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:55:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:55:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 15:55:54,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-14 15:55:54,360 INFO L175 Difference]: Start difference. First operand has 259 places, 249 transitions, 2869 flow. Second operand 10 states and 121 transitions. [2024-06-14 15:55:54,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 267 transitions, 3482 flow [2024-06-14 15:55:54,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 267 transitions, 3383 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-14 15:55:54,577 INFO L231 Difference]: Finished difference. Result has 261 places, 251 transitions, 2871 flow [2024-06-14 15:55:54,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2770, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2871, PETRI_PLACES=261, PETRI_TRANSITIONS=251} [2024-06-14 15:55:54,577 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 230 predicate places. [2024-06-14 15:55:54,577 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 251 transitions, 2871 flow [2024-06-14 15:55:54,577 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-14 15:55:54,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:54,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:54,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 15:55:54,578 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:55:54,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:54,578 INFO L85 PathProgramCache]: Analyzing trace with hash 901648263, now seen corresponding path program 5 times [2024-06-14 15:55:54,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:54,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576288478] [2024-06-14 15:55:54,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:54,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:02,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:02,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576288478] [2024-06-14 15:56:02,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576288478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:02,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:02,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:56:02,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316566204] [2024-06-14 15:56:02,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:02,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:56:02,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:02,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:56:02,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:56:02,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:56:02,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 251 transitions, 2871 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-14 15:56:02,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:02,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:56:02,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:02,812 INFO L124 PetriNetUnfolderBase]: 498/942 cut-off events. [2024-06-14 15:56:02,813 INFO L125 PetriNetUnfolderBase]: For 102585/102585 co-relation queries the response was YES. [2024-06-14 15:56:02,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7396 conditions, 942 events. 498/942 cut-off events. For 102585/102585 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5035 event pairs, 29 based on Foata normal form. 2/942 useless extension candidates. Maximal degree in co-relation 7276. Up to 811 conditions per place. [2024-06-14 15:56:02,822 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 243 selfloop transitions, 23 changer transitions 0/269 dead transitions. [2024-06-14 15:56:02,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 269 transitions, 3481 flow [2024-06-14 15:56:02,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:56:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:56:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 15:56:02,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-14 15:56:02,823 INFO L175 Difference]: Start difference. First operand has 261 places, 251 transitions, 2871 flow. Second operand 10 states and 121 transitions. [2024-06-14 15:56:02,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 269 transitions, 3481 flow [2024-06-14 15:56:03,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 269 transitions, 3411 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 15:56:03,073 INFO L231 Difference]: Finished difference. Result has 264 places, 252 transitions, 2885 flow [2024-06-14 15:56:03,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2801, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2885, PETRI_PLACES=264, PETRI_TRANSITIONS=252} [2024-06-14 15:56:03,074 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 233 predicate places. [2024-06-14 15:56:03,074 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 252 transitions, 2885 flow [2024-06-14 15:56:03,074 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-14 15:56:03,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:03,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:03,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 15:56:03,075 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:56:03,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:03,076 INFO L85 PathProgramCache]: Analyzing trace with hash 907158513, now seen corresponding path program 6 times [2024-06-14 15:56:03,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:03,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304089490] [2024-06-14 15:56:03,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:03,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:13,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:13,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304089490] [2024-06-14 15:56:13,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304089490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:13,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:13,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:56:13,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126599756] [2024-06-14 15:56:13,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:13,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:56:13,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:13,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:56:13,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:56:13,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:56:13,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 252 transitions, 2885 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-14 15:56:13,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:13,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:56:13,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:13,923 INFO L124 PetriNetUnfolderBase]: 502/950 cut-off events. [2024-06-14 15:56:13,923 INFO L125 PetriNetUnfolderBase]: For 105095/105095 co-relation queries the response was YES. [2024-06-14 15:56:13,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7462 conditions, 950 events. 502/950 cut-off events. For 105095/105095 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5109 event pairs, 31 based on Foata normal form. 2/950 useless extension candidates. Maximal degree in co-relation 7341. Up to 816 conditions per place. [2024-06-14 15:56:13,933 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 239 selfloop transitions, 27 changer transitions 0/269 dead transitions. [2024-06-14 15:56:13,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 269 transitions, 3495 flow [2024-06-14 15:56:13,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:56:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:56:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 15:56:13,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 15:56:13,934 INFO L175 Difference]: Start difference. First operand has 264 places, 252 transitions, 2885 flow. Second operand 10 states and 123 transitions. [2024-06-14 15:56:13,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 269 transitions, 3495 flow [2024-06-14 15:56:14,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 269 transitions, 3421 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 15:56:14,176 INFO L231 Difference]: Finished difference. Result has 266 places, 253 transitions, 2905 flow [2024-06-14 15:56:14,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2811, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2905, PETRI_PLACES=266, PETRI_TRANSITIONS=253} [2024-06-14 15:56:14,177 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 235 predicate places. [2024-06-14 15:56:14,177 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 253 transitions, 2905 flow [2024-06-14 15:56:14,177 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-14 15:56:14,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:14,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:14,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 15:56:14,178 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:56:14,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:14,178 INFO L85 PathProgramCache]: Analyzing trace with hash 907366275, now seen corresponding path program 2 times [2024-06-14 15:56:14,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:14,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522090871] [2024-06-14 15:56:14,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:14,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:24,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:24,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522090871] [2024-06-14 15:56:24,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522090871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:24,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:24,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:56:24,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420681385] [2024-06-14 15:56:24,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:24,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:56:24,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:24,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:56:24,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:56:24,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:56:24,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 253 transitions, 2905 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:24,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:24,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:56:24,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:25,298 INFO L124 PetriNetUnfolderBase]: 505/955 cut-off events. [2024-06-14 15:56:25,299 INFO L125 PetriNetUnfolderBase]: For 103721/103721 co-relation queries the response was YES. [2024-06-14 15:56:25,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7512 conditions, 955 events. 505/955 cut-off events. For 103721/103721 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5146 event pairs, 31 based on Foata normal form. 1/954 useless extension candidates. Maximal degree in co-relation 7390. Up to 812 conditions per place. [2024-06-14 15:56:25,309 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 234 selfloop transitions, 34 changer transitions 0/271 dead transitions. [2024-06-14 15:56:25,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 271 transitions, 3545 flow [2024-06-14 15:56:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:56:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:56:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 15:56:25,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-14 15:56:25,310 INFO L175 Difference]: Start difference. First operand has 266 places, 253 transitions, 2905 flow. Second operand 11 states and 134 transitions. [2024-06-14 15:56:25,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 271 transitions, 3545 flow [2024-06-14 15:56:25,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 271 transitions, 3461 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-14 15:56:25,578 INFO L231 Difference]: Finished difference. Result has 269 places, 255 transitions, 2958 flow [2024-06-14 15:56:25,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2821, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2958, PETRI_PLACES=269, PETRI_TRANSITIONS=255} [2024-06-14 15:56:25,579 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 238 predicate places. [2024-06-14 15:56:25,579 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 255 transitions, 2958 flow [2024-06-14 15:56:25,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:25,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:25,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:25,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 15:56:25,579 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:56:25,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:25,580 INFO L85 PathProgramCache]: Analyzing trace with hash 888730439, now seen corresponding path program 3 times [2024-06-14 15:56:25,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:25,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463582475] [2024-06-14 15:56:25,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:25,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56: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-14 15:56:39,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:39,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463582475] [2024-06-14 15:56:39,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463582475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:39,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:56:39,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116076472] [2024-06-14 15:56:39,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:39,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:56:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:39,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:56:39,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:56:40,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:56:40,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 255 transitions, 2958 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:40,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:40,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:56:40,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:41,139 INFO L124 PetriNetUnfolderBase]: 508/962 cut-off events. [2024-06-14 15:56:41,139 INFO L125 PetriNetUnfolderBase]: For 106038/106038 co-relation queries the response was YES. [2024-06-14 15:56:41,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7572 conditions, 962 events. 508/962 cut-off events. For 106038/106038 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5195 event pairs, 31 based on Foata normal form. 1/961 useless extension candidates. Maximal degree in co-relation 7449. Up to 777 conditions per place. [2024-06-14 15:56:41,151 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 228 selfloop transitions, 44 changer transitions 0/275 dead transitions. [2024-06-14 15:56:41,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 275 transitions, 3792 flow [2024-06-14 15:56:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:56:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:56:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-14 15:56:41,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 15:56:41,154 INFO L175 Difference]: Start difference. First operand has 269 places, 255 transitions, 2958 flow. Second operand 11 states and 128 transitions. [2024-06-14 15:56:41,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 275 transitions, 3792 flow [2024-06-14 15:56:41,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 275 transitions, 3679 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-06-14 15:56:41,420 INFO L231 Difference]: Finished difference. Result has 271 places, 257 transitions, 3002 flow [2024-06-14 15:56:41,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2845, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3002, PETRI_PLACES=271, PETRI_TRANSITIONS=257} [2024-06-14 15:56:41,421 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 240 predicate places. [2024-06-14 15:56:41,421 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 257 transitions, 3002 flow [2024-06-14 15:56:41,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:41,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:41,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:41,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 15:56:41,421 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:56:41,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:41,422 INFO L85 PathProgramCache]: Analyzing trace with hash 907373994, now seen corresponding path program 1 times [2024-06-14 15:56:41,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:41,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499785654] [2024-06-14 15:56:41,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:41,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:49,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:49,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499785654] [2024-06-14 15:56:49,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499785654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:49,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:49,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:56:49,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583649503] [2024-06-14 15:56:49,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:49,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:56:49,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:49,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:56:49,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:56:50,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:56:50,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 257 transitions, 3002 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:50,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:50,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:56:50,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:50,660 INFO L124 PetriNetUnfolderBase]: 524/998 cut-off events. [2024-06-14 15:56:50,661 INFO L125 PetriNetUnfolderBase]: For 142469/142469 co-relation queries the response was YES. [2024-06-14 15:56:50,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7812 conditions, 998 events. 524/998 cut-off events. For 142469/142469 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5462 event pairs, 35 based on Foata normal form. 10/1006 useless extension candidates. Maximal degree in co-relation 7688. Up to 821 conditions per place. [2024-06-14 15:56:50,672 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 241 selfloop transitions, 30 changer transitions 4/278 dead transitions. [2024-06-14 15:56:50,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 278 transitions, 3688 flow [2024-06-14 15:56:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:56:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:56:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:56:50,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 15:56:50,673 INFO L175 Difference]: Start difference. First operand has 271 places, 257 transitions, 3002 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:56:50,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 278 transitions, 3688 flow [2024-06-14 15:56:50,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 278 transitions, 3517 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-06-14 15:56:50,970 INFO L231 Difference]: Finished difference. Result has 273 places, 257 transitions, 2912 flow [2024-06-14 15:56:50,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2831, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2912, PETRI_PLACES=273, PETRI_TRANSITIONS=257} [2024-06-14 15:56:50,971 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 242 predicate places. [2024-06-14 15:56:50,971 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 257 transitions, 2912 flow [2024-06-14 15:56:50,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:50,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:50,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:50,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 15:56:50,972 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:56:50,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:50,972 INFO L85 PathProgramCache]: Analyzing trace with hash 907373715, now seen corresponding path program 4 times [2024-06-14 15:56:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:50,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45898849] [2024-06-14 15:56:50,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:50,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:58,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:58,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45898849] [2024-06-14 15:56:58,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45898849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:58,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:58,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:56:58,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215838203] [2024-06-14 15:56:58,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:58,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:56:58,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:58,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:56:58,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:56:58,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:56:58,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 257 transitions, 2912 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:58,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:58,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:56:58,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:59,489 INFO L124 PetriNetUnfolderBase]: 516/985 cut-off events. [2024-06-14 15:56:59,490 INFO L125 PetriNetUnfolderBase]: For 106402/106402 co-relation queries the response was YES. [2024-06-14 15:56:59,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7568 conditions, 985 events. 516/985 cut-off events. For 106402/106402 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5382 event pairs, 37 based on Foata normal form. 1/984 useless extension candidates. Maximal degree in co-relation 7443. Up to 801 conditions per place. [2024-06-14 15:56:59,499 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 225 selfloop transitions, 46 changer transitions 0/274 dead transitions. [2024-06-14 15:56:59,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 274 transitions, 3502 flow [2024-06-14 15:56:59,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:56:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:56:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 15:56:59,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 15:56:59,501 INFO L175 Difference]: Start difference. First operand has 273 places, 257 transitions, 2912 flow. Second operand 11 states and 136 transitions. [2024-06-14 15:56:59,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 274 transitions, 3502 flow [2024-06-14 15:56:59,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 274 transitions, 3373 flow, removed 28 selfloop flow, removed 10 redundant places. [2024-06-14 15:56:59,794 INFO L231 Difference]: Finished difference. Result has 274 places, 257 transitions, 2880 flow [2024-06-14 15:56:59,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2783, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2880, PETRI_PLACES=274, PETRI_TRANSITIONS=257} [2024-06-14 15:56:59,794 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 243 predicate places. [2024-06-14 15:56:59,794 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 257 transitions, 2880 flow [2024-06-14 15:56:59,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:59,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:59,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:59,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 15:56:59,795 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:56:59,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:59,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1940943781, now seen corresponding path program 7 times [2024-06-14 15:56:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:59,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971666276] [2024-06-14 15:56:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:59,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:57:08,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:08,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971666276] [2024-06-14 15:57:08,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971666276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:08,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:08,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:57:08,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123180055] [2024-06-14 15:57:08,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:08,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:57:08,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:08,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:57:08,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:57:08,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:57:08,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 257 transitions, 2880 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-14 15:57:08,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:08,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:57:08,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:08,806 INFO L124 PetriNetUnfolderBase]: 520/993 cut-off events. [2024-06-14 15:57:08,807 INFO L125 PetriNetUnfolderBase]: For 112780/112780 co-relation queries the response was YES. [2024-06-14 15:57:08,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7633 conditions, 993 events. 520/993 cut-off events. For 112780/112780 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5414 event pairs, 39 based on Foata normal form. 2/993 useless extension candidates. Maximal degree in co-relation 7507. Up to 828 conditions per place. [2024-06-14 15:57:08,817 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 230 selfloop transitions, 38 changer transitions 0/271 dead transitions. [2024-06-14 15:57:08,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 271 transitions, 3484 flow [2024-06-14 15:57:08,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:57:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:57:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 15:57:08,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 15:57:08,818 INFO L175 Difference]: Start difference. First operand has 274 places, 257 transitions, 2880 flow. Second operand 10 states and 123 transitions. [2024-06-14 15:57:08,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 271 transitions, 3484 flow [2024-06-14 15:57:09,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 271 transitions, 3345 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-14 15:57:09,125 INFO L231 Difference]: Finished difference. Result has 273 places, 258 transitions, 2859 flow [2024-06-14 15:57:09,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2741, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2859, PETRI_PLACES=273, PETRI_TRANSITIONS=258} [2024-06-14 15:57:09,126 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 242 predicate places. [2024-06-14 15:57:09,126 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 258 transitions, 2859 flow [2024-06-14 15:57:09,126 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-14 15:57:09,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:09,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:09,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 15:57:09,127 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:57:09,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash 306574501, now seen corresponding path program 8 times [2024-06-14 15:57:09,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:09,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934594842] [2024-06-14 15:57:09,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:57:20,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:20,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934594842] [2024-06-14 15:57:20,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934594842] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:20,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:20,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:57:20,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592592524] [2024-06-14 15:57:20,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:20,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:57:20,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:20,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:57:20,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:57:20,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:57:20,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 258 transitions, 2859 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-14 15:57:20,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:20,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:57:20,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:21,150 INFO L124 PetriNetUnfolderBase]: 524/1001 cut-off events. [2024-06-14 15:57:21,150 INFO L125 PetriNetUnfolderBase]: For 115578/115578 co-relation queries the response was YES. [2024-06-14 15:57:21,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7712 conditions, 1001 events. 524/1001 cut-off events. For 115578/115578 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5477 event pairs, 41 based on Foata normal form. 2/1001 useless extension candidates. Maximal degree in co-relation 7585. Up to 864 conditions per place. [2024-06-14 15:57:21,162 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 243 selfloop transitions, 27 changer transitions 0/273 dead transitions. [2024-06-14 15:57:21,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 273 transitions, 3480 flow [2024-06-14 15:57:21,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:57:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:57:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 15:57:21,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-14 15:57:21,165 INFO L175 Difference]: Start difference. First operand has 273 places, 258 transitions, 2859 flow. Second operand 10 states and 121 transitions. [2024-06-14 15:57:21,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 273 transitions, 3480 flow [2024-06-14 15:57:21,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 273 transitions, 3370 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 15:57:21,463 INFO L231 Difference]: Finished difference. Result has 276 places, 260 transitions, 2863 flow [2024-06-14 15:57:21,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2751, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2863, PETRI_PLACES=276, PETRI_TRANSITIONS=260} [2024-06-14 15:57:21,463 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 245 predicate places. [2024-06-14 15:57:21,463 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 260 transitions, 2863 flow [2024-06-14 15:57:21,464 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-14 15:57:21,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:21,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:21,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 15:57:21,464 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:57:21,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:21,464 INFO L85 PathProgramCache]: Analyzing trace with hash -427806397, now seen corresponding path program 9 times [2024-06-14 15:57:21,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:21,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737514787] [2024-06-14 15:57:21,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:21,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:57:30,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:30,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737514787] [2024-06-14 15:57:30,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737514787] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:30,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:30,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:57:30,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070341524] [2024-06-14 15:57:30,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:30,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:57:30,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:30,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:57:30,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:57:30,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:57:30,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 260 transitions, 2863 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-14 15:57:30,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:30,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:57:30,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:30,717 INFO L124 PetriNetUnfolderBase]: 528/1009 cut-off events. [2024-06-14 15:57:30,718 INFO L125 PetriNetUnfolderBase]: For 118112/118112 co-relation queries the response was YES. [2024-06-14 15:57:30,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7756 conditions, 1009 events. 528/1009 cut-off events. For 118112/118112 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5548 event pairs, 39 based on Foata normal form. 2/1009 useless extension candidates. Maximal degree in co-relation 7627. Up to 867 conditions per place. [2024-06-14 15:57:30,726 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 246 selfloop transitions, 26 changer transitions 0/275 dead transitions. [2024-06-14 15:57:30,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 275 transitions, 3481 flow [2024-06-14 15:57:30,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:57:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:57:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 15:57:30,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-14 15:57:30,727 INFO L175 Difference]: Start difference. First operand has 276 places, 260 transitions, 2863 flow. Second operand 10 states and 121 transitions. [2024-06-14 15:57:30,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 275 transitions, 3481 flow [2024-06-14 15:57:31,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 275 transitions, 3396 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-14 15:57:31,045 INFO L231 Difference]: Finished difference. Result has 279 places, 261 transitions, 2876 flow [2024-06-14 15:57:31,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2778, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2876, PETRI_PLACES=279, PETRI_TRANSITIONS=261} [2024-06-14 15:57:31,045 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 248 predicate places. [2024-06-14 15:57:31,046 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 261 transitions, 2876 flow [2024-06-14 15:57:31,046 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-14 15:57:31,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:31,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:31,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 15:57:31,046 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:57:31,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:31,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2046289311, now seen corresponding path program 10 times [2024-06-14 15:57:31,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:31,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100893626] [2024-06-14 15:57:31,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:31,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15