./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi010.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/rfi010.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/rfi010.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi010.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:46:45,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:46:45,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:46:45,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:46:45,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:46:45,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:46:45,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:46:45,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:46:45,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:46:45,220 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:46:45,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:46:45,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:46:45,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:46:45,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:46:45,222 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:46:45,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:46:45,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:46:45,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:46:45,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:46:45,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:46:45,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:46:45,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:46:45,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:46:45,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:46:45,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:46:45,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:46:45,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:46:45,225 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:46:45,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:46:45,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:46:45,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:46:45,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:46:45,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:46:45,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:46:45,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:46:45,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:46:45,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:46:45,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:46:45,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:46:45,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:46:45,229 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:46:45,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:46:45,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:46:45,229 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:46:45,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:46:45,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:46:45,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:46:45,471 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:46:45,471 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:46:45,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010.i [2024-06-14 15:46:46,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:46:46,793 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:46:46,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010.i [2024-06-14 15:46:46,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95dd47f79/4d2bc194fd1243e49a87f1fb6db3f6aa/FLAGf28132394 [2024-06-14 15:46:46,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95dd47f79/4d2bc194fd1243e49a87f1fb6db3f6aa [2024-06-14 15:46:46,830 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:46:46,830 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:46:46,832 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/rfi010.yml/witness.yml [2024-06-14 15:46:47,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:46:47,016 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:46:47,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:46:47,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:46:47,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:46:47,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:46:46" (1/2) ... [2024-06-14 15:46:47,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd7586f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:46:47, skipping insertion in model container [2024-06-14 15:46:47,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:46:46" (1/2) ... [2024-06-14 15:46:47,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@69069b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:46:47, skipping insertion in model container [2024-06-14 15:46:47,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:46:47" (2/2) ... [2024-06-14 15:46:47,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd7586f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47, skipping insertion in model container [2024-06-14 15:46:47,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:46:47" (2/2) ... [2024-06-14 15:46:47,025 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:46:47,071 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:46:47,073 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (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_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_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_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_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_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 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_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 || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) [2024-06-14 15:46:47,073 INFO L97 edCorrectnessWitness]: Location invariant before [L827-L827] ((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (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_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_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_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_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_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 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_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 || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) [2024-06-14 15:46:47,073 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:46:47,074 INFO L106 edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1; [2024-06-14 15:46:47,112 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:46:47,426 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:46:47,437 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:46:47,618 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:46:47,660 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:46:47,661 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47 WrapperNode [2024-06-14 15:46:47,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:46:47,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:46:47,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:46:47,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:46:47,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47" (1/1) ... [2024-06-14 15:46:47,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47" (1/1) ... [2024-06-14 15:46:47,784 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2024-06-14 15:46:47,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:46:47,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:46:47,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:46:47,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:46:47,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47" (1/1) ... [2024-06-14 15:46:47,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47" (1/1) ... [2024-06-14 15:46:47,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47" (1/1) ... [2024-06-14 15:46:47,842 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:46:47,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47" (1/1) ... [2024-06-14 15:46:47,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47" (1/1) ... [2024-06-14 15:46:47,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47" (1/1) ... [2024-06-14 15:46:47,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47" (1/1) ... [2024-06-14 15:46:47,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47" (1/1) ... [2024-06-14 15:46:47,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47" (1/1) ... [2024-06-14 15:46:47,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:46:47,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:46:47,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:46:47,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:46:47,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47" (1/1) ... [2024-06-14 15:46:47,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:46:47,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:46:47,919 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:46:47,935 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:46:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:46:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:46:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:46:47,946 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:46:47,947 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:46:47,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:46:47,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:46:47,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:46:47,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:46:47,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:46:47,949 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:46:48,061 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:46:48,063 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:46:48,768 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:46:48,768 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:46:48,955 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:46:48,956 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:46:48,958 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:46:48 BoogieIcfgContainer [2024-06-14 15:46:48,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:46:48,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:46:48,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:46:48,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:46:48,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:46:46" (1/4) ... [2024-06-14 15:46:48,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccb7469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:46:48, skipping insertion in model container [2024-06-14 15:46:48,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:46:47" (2/4) ... [2024-06-14 15:46:48,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccb7469 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:46:48, skipping insertion in model container [2024-06-14 15:46:48,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:46:47" (3/4) ... [2024-06-14 15:46:48,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccb7469 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:46:48, skipping insertion in model container [2024-06-14 15:46:48,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:46:48" (4/4) ... [2024-06-14 15:46:48,977 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010.i [2024-06-14 15:46:48,989 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:46:48,990 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:46:48,990 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:46:49,044 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:46:49,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:46:49,111 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-14 15:46:49,116 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:46:49,118 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 42 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:46:49,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:46:49,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-14 15:46:49,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:46:49,138 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;@11ac9641, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:46:49,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:46:49,142 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:46:49,143 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:46:49,144 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:46:49,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:49,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:46:49,145 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:46:49,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1790250860, now seen corresponding path program 1 times [2024-06-14 15:46:49,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:49,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121072273] [2024-06-14 15:46:49,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:52,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:52,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121072273] [2024-06-14 15:46:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121072273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:52,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:52,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:46:52,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608418794] [2024-06-14 15:46:52,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:52,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:46:52,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:52,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:46:52,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:46:52,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-14 15:46:52,672 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:46:52,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:52,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-14 15:46:52,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:52,852 INFO L124 PetriNetUnfolderBase]: 131/262 cut-off events. [2024-06-14 15:46:52,853 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-14 15:46:52,855 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 1035 event pairs, 75 based on Foata normal form. 1/251 useless extension candidates. Maximal degree in co-relation 506. Up to 235 conditions per place. [2024-06-14 15:46:52,858 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 22 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-14 15:46:52,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 119 flow [2024-06-14 15:46:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:46:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:46:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-06-14 15:46:52,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-06-14 15:46:52,868 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:46:52,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 119 flow [2024-06-14 15:46:52,870 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:46:52,872 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-14 15:46:52,873 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:46:52,875 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-14 15:46:52,876 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-14 15:46:52,876 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:46:52,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:52,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:52,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:46:52,877 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:46:52,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:52,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1850839667, now seen corresponding path program 1 times [2024-06-14 15:46:52,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:52,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285956142] [2024-06-14 15:46:52,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:52,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:55,249 INFO 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:55,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:55,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285956142] [2024-06-14 15:46:55,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285956142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:55,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:55,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:46:55,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586351139] [2024-06-14 15:46:55,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:55,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:46:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:55,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:46:55,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:46:55,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:46:55,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:55,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:55,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:46:55,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:55,539 INFO L124 PetriNetUnfolderBase]: 150/286 cut-off events. [2024-06-14 15:46:55,539 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-14 15:46:55,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 286 events. 150/286 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1098 event pairs, 68 based on Foata normal form. 2/287 useless extension candidates. Maximal degree in co-relation 641. Up to 258 conditions per place. [2024-06-14 15:46:55,544 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 27 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-14 15:46:55,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 163 flow [2024-06-14 15:46:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:46:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:46:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2024-06-14 15:46:55,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-06-14 15:46:55,548 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 70 transitions. [2024-06-14 15:46:55,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 163 flow [2024-06-14 15:46:55,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:46:55,551 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-14 15:46:55,551 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:46:55,553 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-14 15:46:55,553 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-14 15:46:55,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:55,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:55,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:55,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:46:55,554 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:46:55,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:55,557 INFO L85 PathProgramCache]: Analyzing trace with hash 540491858, now seen corresponding path program 1 times [2024-06-14 15:46:55,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:55,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056976886] [2024-06-14 15:46:55,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:55,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:59,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:59,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056976886] [2024-06-14 15:46:59,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056976886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:59,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:59,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:46:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865889800] [2024-06-14 15:46:59,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:59,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:46:59,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:59,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:46:59,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:46:59,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:46:59,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:59,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:59,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:46:59,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:59,961 INFO L124 PetriNetUnfolderBase]: 147/281 cut-off events. [2024-06-14 15:46:59,962 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2024-06-14 15:46:59,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 281 events. 147/281 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1054 event pairs, 47 based on Foata normal form. 2/282 useless extension candidates. Maximal degree in co-relation 702. Up to 244 conditions per place. [2024-06-14 15:46:59,964 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 31 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-14 15:46:59,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 211 flow [2024-06-14 15:46:59,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:46:59,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:46:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-06-14 15:46:59,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-06-14 15:46:59,969 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 85 transitions. [2024-06-14 15:46:59,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 211 flow [2024-06-14 15:46:59,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 15:46:59,972 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-14 15:46:59,972 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:46:59,974 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-14 15:46:59,974 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-14 15:46:59,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:59,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:59,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:59,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:46:59,975 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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:59,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:59,975 INFO L85 PathProgramCache]: Analyzing trace with hash -956028385, now seen corresponding path program 1 times [2024-06-14 15:46:59,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:59,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565570458] [2024-06-14 15:46:59,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:59,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:04,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:47:04,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:04,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565570458] [2024-06-14 15:47:04,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565570458] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:04,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:04,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:47:04,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318819102] [2024-06-14 15:47:04,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:04,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:47:04,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:04,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:47:04,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:47:04,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:47:04,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 10.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:47:04,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:04,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:47:04,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:04,455 INFO L124 PetriNetUnfolderBase]: 123/253 cut-off events. [2024-06-14 15:47:04,455 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2024-06-14 15:47:04,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 253 events. 123/253 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 964 event pairs, 38 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 681. Up to 219 conditions per place. [2024-06-14 15:47:04,457 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 26 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2024-06-14 15:47:04,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 203 flow [2024-06-14 15:47:04,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:47:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:47:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-06-14 15:47:04,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-06-14 15:47:04,461 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 5 states and 74 transitions. [2024-06-14 15:47:04,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 203 flow [2024-06-14 15:47:04,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 188 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 15:47:04,463 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 133 flow [2024-06-14 15:47:04,463 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-06-14 15:47:04,465 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-14 15:47:04,465 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 133 flow [2024-06-14 15:47:04,465 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:47:04,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:04,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:04,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:47:04,466 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:04,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2044248265, now seen corresponding path program 1 times [2024-06-14 15:47:04,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:04,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607612337] [2024-06-14 15:47:04,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:04,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:07,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:07,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607612337] [2024-06-14 15:47:07,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607612337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:07,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:07,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:47:07,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420198217] [2024-06-14 15:47:07,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:07,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:47:07,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:07,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:47:07,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:47:07,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:47:07,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:07,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:07,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:47:07,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:07,560 INFO L124 PetriNetUnfolderBase]: 141/270 cut-off events. [2024-06-14 15:47:07,560 INFO L125 PetriNetUnfolderBase]: For 410/410 co-relation queries the response was YES. [2024-06-14 15:47:07,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 270 events. 141/270 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 997 event pairs, 24 based on Foata normal form. 4/273 useless extension candidates. Maximal degree in co-relation 784. Up to 215 conditions per place. [2024-06-14 15:47:07,564 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 33 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2024-06-14 15:47:07,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 241 flow [2024-06-14 15:47:07,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:47:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:47:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-14 15:47:07,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-06-14 15:47:07,566 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 133 flow. Second operand 6 states and 95 transitions. [2024-06-14 15:47:07,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 241 flow [2024-06-14 15:47:07,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 230 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 15:47:07,572 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 134 flow [2024-06-14 15:47:07,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2024-06-14 15:47:07,578 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2024-06-14 15:47:07,578 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 134 flow [2024-06-14 15:47:07,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:07,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:07,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:07,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:47:07,580 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:07,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:07,580 INFO L85 PathProgramCache]: Analyzing trace with hash 427891856, now seen corresponding path program 1 times [2024-06-14 15:47:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:07,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365916704] [2024-06-14 15:47:07,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:07,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:12,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:12,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365916704] [2024-06-14 15:47:12,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365916704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:12,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:12,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:47:12,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789410546] [2024-06-14 15:47:12,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:12,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:47:12,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:12,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:47:12,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:47:12,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:47:12,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 134 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:47:12,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:12,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:47:12,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:12,823 INFO L124 PetriNetUnfolderBase]: 115/237 cut-off events. [2024-06-14 15:47:12,824 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2024-06-14 15:47:12,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 237 events. 115/237 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 880 event pairs, 32 based on Foata normal form. 2/238 useless extension candidates. Maximal degree in co-relation 704. Up to 199 conditions per place. [2024-06-14 15:47:12,825 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 27 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2024-06-14 15:47:12,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 228 flow [2024-06-14 15:47:12,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:47:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:47:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2024-06-14 15:47:12,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2024-06-14 15:47:12,827 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 134 flow. Second operand 6 states and 86 transitions. [2024-06-14 15:47:12,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 228 flow [2024-06-14 15:47:12,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 208 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:47:12,828 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 147 flow [2024-06-14 15:47:12,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2024-06-14 15:47:12,829 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-14 15:47:12,829 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 147 flow [2024-06-14 15:47:12,829 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:47:12,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:12,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:12,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:47:12,830 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:47:12,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:12,831 INFO L85 PathProgramCache]: Analyzing trace with hash 841772222, now seen corresponding path program 1 times [2024-06-14 15:47:12,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:12,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046597579] [2024-06-14 15:47:12,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:12,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:17,026 INFO 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,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:17,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046597579] [2024-06-14 15:47:17,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046597579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:17,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:17,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:47:17,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471486135] [2024-06-14 15:47:17,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:17,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:47:17,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:17,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:47:17,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:47:17,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:47:17,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 147 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:17,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:17,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:47:17,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:17,380 INFO L124 PetriNetUnfolderBase]: 141/275 cut-off events. [2024-06-14 15:47:17,380 INFO L125 PetriNetUnfolderBase]: For 652/652 co-relation queries the response was YES. [2024-06-14 15:47:17,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 275 events. 141/275 cut-off events. For 652/652 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1034 event pairs, 38 based on Foata normal form. 2/276 useless extension candidates. Maximal degree in co-relation 863. Up to 237 conditions per place. [2024-06-14 15:47:17,382 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 33 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2024-06-14 15:47:17,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 263 flow [2024-06-14 15:47:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:47:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:47:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-14 15:47:17,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-14 15:47:17,383 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 147 flow. Second operand 6 states and 84 transitions. [2024-06-14 15:47:17,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 263 flow [2024-06-14 15:47:17,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 246 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:47:17,386 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 163 flow [2024-06-14 15:47:17,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-06-14 15:47:17,387 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-14 15:47:17,387 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 163 flow [2024-06-14 15:47:17,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:17,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:17,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:17,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:47:17,388 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:47:17,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:17,389 INFO L85 PathProgramCache]: Analyzing trace with hash 379737470, now seen corresponding path program 2 times [2024-06-14 15:47:17,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:17,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630617915] [2024-06-14 15:47:17,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:17,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:21,792 INFO 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:21,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:21,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630617915] [2024-06-14 15:47:21,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630617915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:21,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:21,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:47:21,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446251137] [2024-06-14 15:47:21,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:21,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:47:21,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:21,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:47:21,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:47:21,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:47:21,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 163 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:21,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:21,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:47:21,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:22,081 INFO L124 PetriNetUnfolderBase]: 142/276 cut-off events. [2024-06-14 15:47:22,081 INFO L125 PetriNetUnfolderBase]: For 843/843 co-relation queries the response was YES. [2024-06-14 15:47:22,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 276 events. 142/276 cut-off events. For 843/843 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1048 event pairs, 42 based on Foata normal form. 2/275 useless extension candidates. Maximal degree in co-relation 917. Up to 230 conditions per place. [2024-06-14 15:47:22,083 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 30 selfloop transitions, 11 changer transitions 0/45 dead transitions. [2024-06-14 15:47:22,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 279 flow [2024-06-14 15:47:22,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:47:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:47:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-14 15:47:22,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-14 15:47:22,084 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 163 flow. Second operand 6 states and 84 transitions. [2024-06-14 15:47:22,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 279 flow [2024-06-14 15:47:22,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 262 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:47:22,086 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 189 flow [2024-06-14 15:47:22,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=189, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-06-14 15:47:22,089 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-14 15:47:22,089 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 189 flow [2024-06-14 15:47:22,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:22,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:22,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:22,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:47:22,090 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:47:22,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:22,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1014541167, now seen corresponding path program 1 times [2024-06-14 15:47:22,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:22,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842776074] [2024-06-14 15:47:22,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:22,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:27,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:47:27,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:27,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842776074] [2024-06-14 15:47:27,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842776074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:27,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:27,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:47:27,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90463887] [2024-06-14 15:47:27,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:27,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:47:27,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:27,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:47:27,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:47:27,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:47:27,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 189 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:27,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:27,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:47:27,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:28,138 INFO L124 PetriNetUnfolderBase]: 158/309 cut-off events. [2024-06-14 15:47:28,138 INFO L125 PetriNetUnfolderBase]: For 1119/1119 co-relation queries the response was YES. [2024-06-14 15:47:28,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1099 conditions, 309 events. 158/309 cut-off events. For 1119/1119 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1238 event pairs, 38 based on Foata normal form. 2/310 useless extension candidates. Maximal degree in co-relation 1075. Up to 258 conditions per place. [2024-06-14 15:47:28,140 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 39 selfloop transitions, 14 changer transitions 0/57 dead transitions. [2024-06-14 15:47:28,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 371 flow [2024-06-14 15:47:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:47:28,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:47:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-14 15:47:28,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-14 15:47:28,142 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 189 flow. Second operand 8 states and 108 transitions. [2024-06-14 15:47:28,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 371 flow [2024-06-14 15:47:28,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 336 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 15:47:28,144 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 251 flow [2024-06-14 15:47:28,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=251, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-06-14 15:47:28,144 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2024-06-14 15:47:28,144 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 251 flow [2024-06-14 15:47:28,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:28,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:28,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:28,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:47:28,145 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:47:28,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:28,146 INFO L85 PathProgramCache]: Analyzing trace with hash 325135825, now seen corresponding path program 2 times [2024-06-14 15:47:28,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:28,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083107451] [2024-06-14 15:47:28,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:28,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:32,947 INFO 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:32,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:32,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083107451] [2024-06-14 15:47:32,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083107451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:32,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:32,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:47:32,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572958818] [2024-06-14 15:47:32,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:32,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:47:32,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:32,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:47:32,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:47:33,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:47:33,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 251 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:33,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:33,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:47:33,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:33,274 INFO L124 PetriNetUnfolderBase]: 164/321 cut-off events. [2024-06-14 15:47:33,274 INFO L125 PetriNetUnfolderBase]: For 1408/1408 co-relation queries the response was YES. [2024-06-14 15:47:33,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 321 events. 164/321 cut-off events. For 1408/1408 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1281 event pairs, 37 based on Foata normal form. 2/322 useless extension candidates. Maximal degree in co-relation 1211. Up to 256 conditions per place. [2024-06-14 15:47:33,277 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 36 selfloop transitions, 18 changer transitions 0/58 dead transitions. [2024-06-14 15:47:33,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 409 flow [2024-06-14 15:47:33,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:47:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:47:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-14 15:47:33,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 15:47:33,278 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 251 flow. Second operand 7 states and 96 transitions. [2024-06-14 15:47:33,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 409 flow [2024-06-14 15:47:33,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 382 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 15:47:33,283 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 296 flow [2024-06-14 15:47:33,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-06-14 15:47:33,284 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2024-06-14 15:47:33,285 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 296 flow [2024-06-14 15:47:33,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:33,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:33,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:33,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:47:33,286 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:47:33,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:33,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1112772689, now seen corresponding path program 3 times [2024-06-14 15:47:33,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:33,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990155449] [2024-06-14 15:47:33,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:33,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:38,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:38,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990155449] [2024-06-14 15:47:38,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990155449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:38,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:38,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:47:38,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614853905] [2024-06-14 15:47:38,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:38,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:47:38,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:38,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:47:38,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:47:38,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:47:38,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 296 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:38,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:38,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:47:38,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:39,159 INFO L124 PetriNetUnfolderBase]: 172/332 cut-off events. [2024-06-14 15:47:39,159 INFO L125 PetriNetUnfolderBase]: For 1809/1809 co-relation queries the response was YES. [2024-06-14 15:47:39,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1410 conditions, 332 events. 172/332 cut-off events. For 1809/1809 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1325 event pairs, 40 based on Foata normal form. 1/329 useless extension candidates. Maximal degree in co-relation 1382. Up to 246 conditions per place. [2024-06-14 15:47:39,161 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 33 selfloop transitions, 26 changer transitions 0/63 dead transitions. [2024-06-14 15:47:39,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 506 flow [2024-06-14 15:47:39,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:47:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:47:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-14 15:47:39,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4330357142857143 [2024-06-14 15:47:39,163 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 296 flow. Second operand 7 states and 97 transitions. [2024-06-14 15:47:39,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 506 flow [2024-06-14 15:47:39,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 448 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-14 15:47:39,165 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 367 flow [2024-06-14 15:47:39,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=367, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2024-06-14 15:47:39,166 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 29 predicate places. [2024-06-14 15:47:39,166 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 367 flow [2024-06-14 15:47:39,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:39,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:39,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:39,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:47:39,167 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:47:39,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:39,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1113039599, now seen corresponding path program 4 times [2024-06-14 15:47:39,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:39,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642020538] [2024-06-14 15:47:39,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:39,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:44,230 INFO 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:44,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:44,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642020538] [2024-06-14 15:47:44,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642020538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:44,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:44,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:47:44,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862175017] [2024-06-14 15:47:44,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:44,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:47:44,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:44,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:47:44,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:47:44,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:47:44,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 367 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:44,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:44,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:47:44,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:44,510 INFO L124 PetriNetUnfolderBase]: 168/326 cut-off events. [2024-06-14 15:47:44,510 INFO L125 PetriNetUnfolderBase]: For 1856/1856 co-relation queries the response was YES. [2024-06-14 15:47:44,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 326 events. 168/326 cut-off events. For 1856/1856 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1318 event pairs, 40 based on Foata normal form. 2/324 useless extension candidates. Maximal degree in co-relation 1397. Up to 260 conditions per place. [2024-06-14 15:47:44,512 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 42 selfloop transitions, 18 changer transitions 0/64 dead transitions. [2024-06-14 15:47:44,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 532 flow [2024-06-14 15:47:44,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:47:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:47:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-14 15:47:44,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 15:47:44,514 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 367 flow. Second operand 7 states and 96 transitions. [2024-06-14 15:47:44,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 532 flow [2024-06-14 15:47:44,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 500 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 15:47:44,517 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 386 flow [2024-06-14 15:47:44,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=386, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-06-14 15:47:44,517 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 33 predicate places. [2024-06-14 15:47:44,517 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 386 flow [2024-06-14 15:47:44,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:44,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:44,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:44,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:47:44,518 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:47:44,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1395542115, now seen corresponding path program 1 times [2024-06-14 15:47:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:44,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477079923] [2024-06-14 15:47:44,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:44,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:49,557 INFO 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:49,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:49,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477079923] [2024-06-14 15:47:49,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477079923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:49,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:49,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:47:49,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575857055] [2024-06-14 15:47:49,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:49,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:47:49,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:49,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:47:49,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:47:49,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:47:49,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 386 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:49,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:49,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:47:49,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:49,925 INFO L124 PetriNetUnfolderBase]: 166/325 cut-off events. [2024-06-14 15:47:49,926 INFO L125 PetriNetUnfolderBase]: For 1961/1961 co-relation queries the response was YES. [2024-06-14 15:47:49,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 325 events. 166/325 cut-off events. For 1961/1961 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1313 event pairs, 36 based on Foata normal form. 1/325 useless extension candidates. Maximal degree in co-relation 1432. Up to 269 conditions per place. [2024-06-14 15:47:49,928 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 53 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-06-14 15:47:49,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 570 flow [2024-06-14 15:47:49,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:47:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:47:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-14 15:47:49,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4330357142857143 [2024-06-14 15:47:49,931 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 386 flow. Second operand 7 states and 97 transitions. [2024-06-14 15:47:49,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 570 flow [2024-06-14 15:47:49,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 532 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:47:49,935 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 401 flow [2024-06-14 15:47:49,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-06-14 15:47:49,935 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-14 15:47:49,935 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 401 flow [2024-06-14 15:47:49,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:49,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:49,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:49,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:47:49,936 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:47:49,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1489276733, now seen corresponding path program 1 times [2024-06-14 15:47:49,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:49,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446439927] [2024-06-14 15:47:49,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:55,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:55,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446439927] [2024-06-14 15:47:55,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446439927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:55,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:55,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:47:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53666234] [2024-06-14 15:47:55,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:55,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:47:55,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:55,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:47:55,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:47:55,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:47:55,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 401 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:47:55,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:55,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:47:55,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:55,660 INFO L124 PetriNetUnfolderBase]: 178/345 cut-off events. [2024-06-14 15:47:55,661 INFO L125 PetriNetUnfolderBase]: For 2561/2561 co-relation queries the response was YES. [2024-06-14 15:47:55,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 345 events. 178/345 cut-off events. For 2561/2561 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1403 event pairs, 35 based on Foata normal form. 4/348 useless extension candidates. Maximal degree in co-relation 1546. Up to 264 conditions per place. [2024-06-14 15:47:55,663 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 47 selfloop transitions, 21 changer transitions 0/72 dead transitions. [2024-06-14 15:47:55,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 72 transitions, 603 flow [2024-06-14 15:47:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:47:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:47:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-14 15:47:55,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42578125 [2024-06-14 15:47:55,664 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 401 flow. Second operand 8 states and 109 transitions. [2024-06-14 15:47:55,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 72 transitions, 603 flow [2024-06-14 15:47:55,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 72 transitions, 566 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 15:47:55,667 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 447 flow [2024-06-14 15:47:55,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=447, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2024-06-14 15:47:55,668 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2024-06-14 15:47:55,668 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 447 flow [2024-06-14 15:47:55,668 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:47:55,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:55,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:55,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:47:55,669 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:47:55,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:55,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2083057265, now seen corresponding path program 2 times [2024-06-14 15:47:55,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:55,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825955886] [2024-06-14 15:47:55,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:55,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:00,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825955886] [2024-06-14 15:48:00,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825955886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:00,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:00,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:48:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778683323] [2024-06-14 15:48:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:00,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:48:00,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:00,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:48:00,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:48:00,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:48:00,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 447 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:48:00,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:00,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:48:00,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:01,144 INFO L124 PetriNetUnfolderBase]: 191/366 cut-off events. [2024-06-14 15:48:01,144 INFO L125 PetriNetUnfolderBase]: For 3058/3058 co-relation queries the response was YES. [2024-06-14 15:48:01,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 366 events. 191/366 cut-off events. For 3058/3058 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1500 event pairs, 37 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 1755. Up to 252 conditions per place. [2024-06-14 15:48:01,147 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 44 selfloop transitions, 33 changer transitions 0/81 dead transitions. [2024-06-14 15:48:01,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 81 transitions, 783 flow [2024-06-14 15:48:01,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:48:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:48:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-06-14 15:48:01,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43359375 [2024-06-14 15:48:01,148 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 447 flow. Second operand 8 states and 111 transitions. [2024-06-14 15:48:01,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 81 transitions, 783 flow [2024-06-14 15:48:01,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 81 transitions, 702 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-14 15:48:01,152 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 574 flow [2024-06-14 15:48:01,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=574, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-06-14 15:48:01,153 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2024-06-14 15:48:01,153 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 574 flow [2024-06-14 15:48:01,153 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:48:01,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:01,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:01,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:48:01,154 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:48:01,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:01,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1662005633, now seen corresponding path program 3 times [2024-06-14 15:48:01,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:01,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253316499] [2024-06-14 15:48:01,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:01,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:08,122 INFO 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:08,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:08,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253316499] [2024-06-14 15:48:08,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253316499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:08,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:08,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:48:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228103009] [2024-06-14 15:48:08,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:08,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:48:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:08,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:48:08,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:48:08,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:48:08,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 574 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:48:08,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:08,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:48:08,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:08,559 INFO L124 PetriNetUnfolderBase]: 192/370 cut-off events. [2024-06-14 15:48:08,559 INFO L125 PetriNetUnfolderBase]: For 3573/3573 co-relation queries the response was YES. [2024-06-14 15:48:08,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 370 events. 192/370 cut-off events. For 3573/3573 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1524 event pairs, 38 based on Foata normal form. 2/371 useless extension candidates. Maximal degree in co-relation 1859. Up to 318 conditions per place. [2024-06-14 15:48:08,562 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 64 selfloop transitions, 14 changer transitions 0/82 dead transitions. [2024-06-14 15:48:08,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 82 transitions, 775 flow [2024-06-14 15:48:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:48:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:48:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-14 15:48:08,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:48:08,563 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 574 flow. Second operand 8 states and 104 transitions. [2024-06-14 15:48:08,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 82 transitions, 775 flow [2024-06-14 15:48:08,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 82 transitions, 739 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-14 15:48:08,569 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 597 flow [2024-06-14 15:48:08,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=597, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2024-06-14 15:48:08,569 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 47 predicate places. [2024-06-14 15:48:08,569 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 597 flow [2024-06-14 15:48:08,570 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:48:08,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:08,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:08,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:48:08,571 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:48:08,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:08,572 INFO L85 PathProgramCache]: Analyzing trace with hash -144488451, now seen corresponding path program 4 times [2024-06-14 15:48:08,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:08,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811300746] [2024-06-14 15:48:08,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:08,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:15,033 INFO 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:15,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:15,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811300746] [2024-06-14 15:48:15,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811300746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:15,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:15,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:48:15,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603072071] [2024-06-14 15:48:15,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:15,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:48:15,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:15,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:48:15,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:48:15,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:48:15,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 597 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:48:15,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:15,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:48:15,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:15,448 INFO L124 PetriNetUnfolderBase]: 188/364 cut-off events. [2024-06-14 15:48:15,448 INFO L125 PetriNetUnfolderBase]: For 3661/3661 co-relation queries the response was YES. [2024-06-14 15:48:15,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1865 conditions, 364 events. 188/364 cut-off events. For 3661/3661 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1489 event pairs, 37 based on Foata normal form. 2/362 useless extension candidates. Maximal degree in co-relation 1827. Up to 288 conditions per place. [2024-06-14 15:48:15,451 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 58 selfloop transitions, 21 changer transitions 0/83 dead transitions. [2024-06-14 15:48:15,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 83 transitions, 784 flow [2024-06-14 15:48:15,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:48:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:48:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-14 15:48:15,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-14 15:48:15,452 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 597 flow. Second operand 8 states and 108 transitions. [2024-06-14 15:48:15,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 83 transitions, 784 flow [2024-06-14 15:48:15,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 83 transitions, 712 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 15:48:15,457 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 580 flow [2024-06-14 15:48:15,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=580, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2024-06-14 15:48:15,458 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-06-14 15:48:15,458 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 580 flow [2024-06-14 15:48:15,458 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:48:15,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:15,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:15,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:48:15,458 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:48:15,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:15,459 INFO L85 PathProgramCache]: Analyzing trace with hash -135906659, now seen corresponding path program 1 times [2024-06-14 15:48:15,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:15,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618229517] [2024-06-14 15:48:15,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:15,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:20,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618229517] [2024-06-14 15:48:20,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618229517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:20,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:48:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980777669] [2024-06-14 15:48:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:20,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:48:20,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:20,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:48:20,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:48:21,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:48:21,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 580 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:48:21,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:21,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:48:21,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:21,289 INFO L124 PetriNetUnfolderBase]: 185/359 cut-off events. [2024-06-14 15:48:21,289 INFO L125 PetriNetUnfolderBase]: For 3746/3746 co-relation queries the response was YES. [2024-06-14 15:48:21,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 359 events. 185/359 cut-off events. For 3746/3746 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1466 event pairs, 37 based on Foata normal form. 2/360 useless extension candidates. Maximal degree in co-relation 1796. Up to 309 conditions per place. [2024-06-14 15:48:21,292 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 68 selfloop transitions, 12 changer transitions 0/84 dead transitions. [2024-06-14 15:48:21,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 84 transitions, 769 flow [2024-06-14 15:48:21,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:48:21,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:48:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-14 15:48:21,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-14 15:48:21,293 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 580 flow. Second operand 8 states and 102 transitions. [2024-06-14 15:48:21,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 84 transitions, 769 flow [2024-06-14 15:48:21,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 84 transitions, 719 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:48:21,298 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 558 flow [2024-06-14 15:48:21,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2024-06-14 15:48:21,299 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2024-06-14 15:48:21,299 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 558 flow [2024-06-14 15:48:21,299 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:48:21,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:21,299 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:21,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:48:21,300 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:48:21,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:21,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1357459054, now seen corresponding path program 1 times [2024-06-14 15:48:21,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:21,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139971925] [2024-06-14 15:48:21,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:21,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:26,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:26,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139971925] [2024-06-14 15:48:26,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139971925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:26,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:26,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:48:26,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866267122] [2024-06-14 15:48:26,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:26,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:48:26,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:26,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:48:26,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:48:26,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:48:26,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 558 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:48:26,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:26,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:48:26,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:26,851 INFO L124 PetriNetUnfolderBase]: 188/366 cut-off events. [2024-06-14 15:48:26,851 INFO L125 PetriNetUnfolderBase]: For 3785/3785 co-relation queries the response was YES. [2024-06-14 15:48:26,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1857 conditions, 366 events. 188/366 cut-off events. For 3785/3785 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1493 event pairs, 32 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 1817. Up to 303 conditions per place. [2024-06-14 15:48:26,854 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 71 selfloop transitions, 14 changer transitions 0/89 dead transitions. [2024-06-14 15:48:26,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 788 flow [2024-06-14 15:48:26,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:48:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:48:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-14 15:48:26,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-14 15:48:26,857 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 558 flow. Second operand 8 states and 108 transitions. [2024-06-14 15:48:26,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 788 flow [2024-06-14 15:48:26,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 760 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 15:48:26,866 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 591 flow [2024-06-14 15:48:26,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=76, 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=591, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2024-06-14 15:48:26,867 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2024-06-14 15:48:26,867 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 591 flow [2024-06-14 15:48:26,867 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:48:26,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:26,867 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:26,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:48:26,867 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:48:26,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1209642064, now seen corresponding path program 2 times [2024-06-14 15:48:26,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:26,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786599379] [2024-06-14 15:48:26,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:26,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:35,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786599379] [2024-06-14 15:48:35,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786599379] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:35,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:35,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:48:35,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022568316] [2024-06-14 15:48:35,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:35,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:48:35,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:48:35,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:48:35,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:48:35,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 591 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:48:35,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:35,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:48:35,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:35,442 INFO L124 PetriNetUnfolderBase]: 191/373 cut-off events. [2024-06-14 15:48:35,442 INFO L125 PetriNetUnfolderBase]: For 4274/4274 co-relation queries the response was YES. [2024-06-14 15:48:35,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 373 events. 191/373 cut-off events. For 4274/4274 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1542 event pairs, 32 based on Foata normal form. 1/373 useless extension candidates. Maximal degree in co-relation 1900. Up to 297 conditions per place. [2024-06-14 15:48:35,445 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 65 selfloop transitions, 20 changer transitions 0/89 dead transitions. [2024-06-14 15:48:35,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 89 transitions, 819 flow [2024-06-14 15:48:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:48:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:48:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-14 15:48:35,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2024-06-14 15:48:35,456 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 591 flow. Second operand 8 states and 107 transitions. [2024-06-14 15:48:35,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 89 transitions, 819 flow [2024-06-14 15:48:35,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 89 transitions, 774 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 15:48:35,465 INFO L231 Difference]: Finished difference. Result has 86 places, 78 transitions, 624 flow [2024-06-14 15:48:35,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=624, PETRI_PLACES=86, PETRI_TRANSITIONS=78} [2024-06-14 15:48:35,465 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 55 predicate places. [2024-06-14 15:48:35,465 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 78 transitions, 624 flow [2024-06-14 15:48:35,466 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:48:35,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:35,466 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:35,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:48:35,466 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:48:35,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:35,467 INFO L85 PathProgramCache]: Analyzing trace with hash -17699554, now seen corresponding path program 3 times [2024-06-14 15:48:35,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:35,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924366748] [2024-06-14 15:48:35,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:35,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:41,992 INFO 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:41,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:41,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924366748] [2024-06-14 15:48:41,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924366748] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:41,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:41,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:48:41,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795763094] [2024-06-14 15:48:41,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:41,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:48:41,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:41,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:48:41,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:48:42,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:48:42,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 78 transitions, 624 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:48:42,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:42,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:48:42,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:42,355 INFO L124 PetriNetUnfolderBase]: 194/378 cut-off events. [2024-06-14 15:48:42,355 INFO L125 PetriNetUnfolderBase]: For 4889/4889 co-relation queries the response was YES. [2024-06-14 15:48:42,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 378 events. 194/378 cut-off events. For 4889/4889 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1579 event pairs, 35 based on Foata normal form. 1/375 useless extension candidates. Maximal degree in co-relation 1985. Up to 274 conditions per place. [2024-06-14 15:48:42,359 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 57 selfloop transitions, 30 changer transitions 0/91 dead transitions. [2024-06-14 15:48:42,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 922 flow [2024-06-14 15:48:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:48:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:48:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-14 15:48:42,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-14 15:48:42,360 INFO L175 Difference]: Start difference. First operand has 86 places, 78 transitions, 624 flow. Second operand 8 states and 108 transitions. [2024-06-14 15:48:42,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 922 flow [2024-06-14 15:48:42,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 91 transitions, 862 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 15:48:42,367 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 697 flow [2024-06-14 15:48:42,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=697, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2024-06-14 15:48:42,367 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 57 predicate places. [2024-06-14 15:48:42,368 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 697 flow [2024-06-14 15:48:42,368 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:48:42,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:42,368 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:42,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:48:42,368 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:48:42,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:42,369 INFO L85 PathProgramCache]: Analyzing trace with hash -24849394, now seen corresponding path program 4 times [2024-06-14 15:48:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:42,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399307510] [2024-06-14 15:48:42,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:42,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:49,570 INFO 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,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:49,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399307510] [2024-06-14 15:48:49,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399307510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:49,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:49,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:48:49,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421483029] [2024-06-14 15:48:49,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:49,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:48:49,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:49,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:48:49,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:48:49,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:48:49,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 697 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:48:49,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:49,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:48:49,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:49,926 INFO L124 PetriNetUnfolderBase]: 192/375 cut-off events. [2024-06-14 15:48:49,926 INFO L125 PetriNetUnfolderBase]: For 5170/5170 co-relation queries the response was YES. [2024-06-14 15:48:49,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 375 events. 192/375 cut-off events. For 5170/5170 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1571 event pairs, 35 based on Foata normal form. 1/372 useless extension candidates. Maximal degree in co-relation 1988. Up to 298 conditions per place. [2024-06-14 15:48:49,929 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 67 selfloop transitions, 20 changer transitions 0/91 dead transitions. [2024-06-14 15:48:49,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 895 flow [2024-06-14 15:48:49,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:48:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:48:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-14 15:48:49,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2024-06-14 15:48:49,933 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 697 flow. Second operand 8 states and 107 transitions. [2024-06-14 15:48:49,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 895 flow [2024-06-14 15:48:49,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 91 transitions, 830 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-14 15:48:49,941 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 677 flow [2024-06-14 15:48:49,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=677, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2024-06-14 15:48:49,942 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 61 predicate places. [2024-06-14 15:48:49,942 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 677 flow [2024-06-14 15:48:49,942 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:48:49,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:49,942 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,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:48:49,943 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:48:49,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:49,943 INFO L85 PathProgramCache]: Analyzing trace with hash 72326606, now seen corresponding path program 1 times [2024-06-14 15:48:49,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:49,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513437405] [2024-06-14 15:48:49,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:49,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:55,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:55,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513437405] [2024-06-14 15:48:55,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513437405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:55,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:55,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:55,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601852591] [2024-06-14 15:48:55,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:55,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:55,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:55,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:56,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:48:56,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 677 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:56,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:56,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:48:56,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:56,330 INFO L124 PetriNetUnfolderBase]: 195/380 cut-off events. [2024-06-14 15:48:56,331 INFO L125 PetriNetUnfolderBase]: For 5333/5333 co-relation queries the response was YES. [2024-06-14 15:48:56,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 380 events. 195/380 cut-off events. For 5333/5333 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1592 event pairs, 35 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 2033. Up to 260 conditions per place. [2024-06-14 15:48:56,333 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 53 selfloop transitions, 36 changer transitions 0/93 dead transitions. [2024-06-14 15:48:56,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 93 transitions, 901 flow [2024-06-14 15:48:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:48:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:48:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 15:48:56,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-14 15:48:56,335 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 677 flow. Second operand 9 states and 111 transitions. [2024-06-14 15:48:56,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 93 transitions, 901 flow [2024-06-14 15:48:56,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 816 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:56,342 INFO L231 Difference]: Finished difference. Result has 93 places, 84 transitions, 697 flow [2024-06-14 15:48:56,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=697, PETRI_PLACES=93, PETRI_TRANSITIONS=84} [2024-06-14 15:48:56,343 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 62 predicate places. [2024-06-14 15:48:56,343 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 84 transitions, 697 flow [2024-06-14 15:48:56,343 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:56,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:56,343 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:56,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:48:56,344 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:48:56,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:56,344 INFO L85 PathProgramCache]: Analyzing trace with hash -184173904, now seen corresponding path program 2 times [2024-06-14 15:48:56,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:56,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361572874] [2024-06-14 15:48:56,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:56,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:02,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361572874] [2024-06-14 15:49:02,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361572874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:02,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:02,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54798815] [2024-06-14 15:49:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:02,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:02,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:02,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:02,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:49:02,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 84 transitions, 697 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:02,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:02,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:49:02,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:02,361 INFO L124 PetriNetUnfolderBase]: 196/382 cut-off events. [2024-06-14 15:49:02,362 INFO L125 PetriNetUnfolderBase]: For 5993/5993 co-relation queries the response was YES. [2024-06-14 15:49:02,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2088 conditions, 382 events. 196/382 cut-off events. For 5993/5993 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1599 event pairs, 35 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 2043. Up to 296 conditions per place. [2024-06-14 15:49:02,365 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 69 selfloop transitions, 24 changer transitions 0/97 dead transitions. [2024-06-14 15:49:02,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 97 transitions, 961 flow [2024-06-14 15:49:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:49:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:49:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-14 15:49:02,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 15:49:02,366 INFO L175 Difference]: Start difference. First operand has 93 places, 84 transitions, 697 flow. Second operand 9 states and 120 transitions. [2024-06-14 15:49:02,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 97 transitions, 961 flow [2024-06-14 15:49:02,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 97 transitions, 872 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 15:49:02,374 INFO L231 Difference]: Finished difference. Result has 95 places, 87 transitions, 720 flow [2024-06-14 15:49:02,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=720, PETRI_PLACES=95, PETRI_TRANSITIONS=87} [2024-06-14 15:49:02,374 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-14 15:49:02,375 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 87 transitions, 720 flow [2024-06-14 15:49:02,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:02,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:02,375 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:02,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:49:02,375 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:49:02,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:02,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1089015044, now seen corresponding path program 1 times [2024-06-14 15:49:02,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:02,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284261996] [2024-06-14 15:49:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:02,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:06,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284261996] [2024-06-14 15:49:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284261996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:06,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:06,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:49:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956177685] [2024-06-14 15:49:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:06,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:49:06,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:06,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:49:06,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:49:06,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:49:06,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 720 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:49:06,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:06,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:49:06,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:07,189 INFO L124 PetriNetUnfolderBase]: 200/392 cut-off events. [2024-06-14 15:49:07,189 INFO L125 PetriNetUnfolderBase]: For 6455/6455 co-relation queries the response was YES. [2024-06-14 15:49:07,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2134 conditions, 392 events. 200/392 cut-off events. For 6455/6455 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1656 event pairs, 13 based on Foata normal form. 2/393 useless extension candidates. Maximal degree in co-relation 2088. Up to 305 conditions per place. [2024-06-14 15:49:07,192 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 87 selfloop transitions, 12 changer transitions 0/103 dead transitions. [2024-06-14 15:49:07,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 103 transitions, 968 flow [2024-06-14 15:49:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:49:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:49:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-14 15:49:07,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2024-06-14 15:49:07,195 INFO L175 Difference]: Start difference. First operand has 95 places, 87 transitions, 720 flow. Second operand 8 states and 107 transitions. [2024-06-14 15:49:07,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 103 transitions, 968 flow [2024-06-14 15:49:07,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 103 transitions, 878 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-14 15:49:07,203 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 670 flow [2024-06-14 15:49:07,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=670, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-06-14 15:49:07,204 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 65 predicate places. [2024-06-14 15:49:07,204 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 670 flow [2024-06-14 15:49:07,204 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:49:07,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:07,204 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:07,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:49:07,204 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:49:07,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:07,205 INFO L85 PathProgramCache]: Analyzing trace with hash 865641566, now seen corresponding path program 2 times [2024-06-14 15:49:07,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:07,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476452282] [2024-06-14 15:49:07,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:07,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:11,556 INFO 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:11,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:11,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476452282] [2024-06-14 15:49:11,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476452282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:11,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:11,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:49:11,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520001297] [2024-06-14 15:49:11,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:11,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:49:11,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:11,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:49:11,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:49:11,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:49:11,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 670 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:49:11,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:11,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:49:11,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:11,942 INFO L124 PetriNetUnfolderBase]: 204/400 cut-off events. [2024-06-14 15:49:11,943 INFO L125 PetriNetUnfolderBase]: For 6747/6747 co-relation queries the response was YES. [2024-06-14 15:49:11,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 400 events. 204/400 cut-off events. For 6747/6747 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1708 event pairs, 30 based on Foata normal form. 2/401 useless extension candidates. Maximal degree in co-relation 2076. Up to 330 conditions per place. [2024-06-14 15:49:11,946 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 86 selfloop transitions, 13 changer transitions 0/103 dead transitions. [2024-06-14 15:49:11,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 103 transitions, 918 flow [2024-06-14 15:49:11,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:49:11,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:49:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-14 15:49:11,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-14 15:49:11,947 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 670 flow. Second operand 8 states and 108 transitions. [2024-06-14 15:49:11,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 103 transitions, 918 flow [2024-06-14 15:49:11,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 103 transitions, 888 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:49:11,955 INFO L231 Difference]: Finished difference. Result has 98 places, 89 transitions, 684 flow [2024-06-14 15:49:11,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=684, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2024-06-14 15:49:11,955 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-14 15:49:11,955 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 684 flow [2024-06-14 15:49:11,956 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:49:11,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:11,956 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:11,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:49:11,956 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:49:11,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash 868443036, now seen corresponding path program 1 times [2024-06-14 15:49:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:11,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733172743] [2024-06-14 15:49:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:16,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:16,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733172743] [2024-06-14 15:49:16,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733172743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:16,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:16,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:16,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335012940] [2024-06-14 15:49:16,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:16,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:16,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:16,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:16,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:17,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:49:17,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 684 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:17,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:17,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:49:17,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:17,348 INFO L124 PetriNetUnfolderBase]: 210/412 cut-off events. [2024-06-14 15:49:17,348 INFO L125 PetriNetUnfolderBase]: For 7520/7520 co-relation queries the response was YES. [2024-06-14 15:49:17,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 412 events. 210/412 cut-off events. For 7520/7520 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1761 event pairs, 28 based on Foata normal form. 2/413 useless extension candidates. Maximal degree in co-relation 2174. Up to 337 conditions per place. [2024-06-14 15:49:17,351 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 86 selfloop transitions, 16 changer transitions 0/106 dead transitions. [2024-06-14 15:49:17,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 106 transitions, 968 flow [2024-06-14 15:49:17,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:49:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:49:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-14 15:49:17,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 15:49:17,353 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 684 flow. Second operand 9 states and 120 transitions. [2024-06-14 15:49:17,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 106 transitions, 968 flow [2024-06-14 15:49:17,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 106 transitions, 934 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 15:49:17,362 INFO L231 Difference]: Finished difference. Result has 101 places, 91 transitions, 729 flow [2024-06-14 15:49:17,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=729, PETRI_PLACES=101, PETRI_TRANSITIONS=91} [2024-06-14 15:49:17,363 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 70 predicate places. [2024-06-14 15:49:17,363 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 91 transitions, 729 flow [2024-06-14 15:49:17,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:17,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:17,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:17,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:49:17,364 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:49:17,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:17,364 INFO L85 PathProgramCache]: Analyzing trace with hash 964175740, now seen corresponding path program 3 times [2024-06-14 15:49:17,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:17,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947823531] [2024-06-14 15:49:17,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:17,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:22,650 INFO 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:22,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:22,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947823531] [2024-06-14 15:49:22,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947823531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:22,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:22,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:49:22,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231238260] [2024-06-14 15:49:22,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:22,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:49:22,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:22,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:49:22,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:49:22,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:49:22,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 91 transitions, 729 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:49:22,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:22,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:49:22,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:23,024 INFO L124 PetriNetUnfolderBase]: 214/420 cut-off events. [2024-06-14 15:49:23,024 INFO L125 PetriNetUnfolderBase]: For 8101/8101 co-relation queries the response was YES. [2024-06-14 15:49:23,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 420 events. 214/420 cut-off events. For 8101/8101 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1816 event pairs, 28 based on Foata normal form. 2/421 useless extension candidates. Maximal degree in co-relation 2247. Up to 349 conditions per place. [2024-06-14 15:49:23,028 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 86 selfloop transitions, 16 changer transitions 0/106 dead transitions. [2024-06-14 15:49:23,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 106 transitions, 1005 flow [2024-06-14 15:49:23,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:49:23,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:49:23,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:49:23,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-14 15:49:23,029 INFO L175 Difference]: Start difference. First operand has 101 places, 91 transitions, 729 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:49:23,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 106 transitions, 1005 flow [2024-06-14 15:49:23,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 106 transitions, 942 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 15:49:23,039 INFO L231 Difference]: Finished difference. Result has 103 places, 95 transitions, 756 flow [2024-06-14 15:49:23,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=666, 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=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=756, PETRI_PLACES=103, PETRI_TRANSITIONS=95} [2024-06-14 15:49:23,044 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-14 15:49:23,044 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 95 transitions, 756 flow [2024-06-14 15:49:23,044 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:49:23,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:23,044 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:23,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:49:23,045 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:49:23,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash 970609790, now seen corresponding path program 2 times [2024-06-14 15:49:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:23,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687906545] [2024-06-14 15:49:23,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:23,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:29,463 INFO 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:29,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:29,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687906545] [2024-06-14 15:49:29,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687906545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:29,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:29,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:29,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614157724] [2024-06-14 15:49:29,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:29,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:29,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:29,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:29,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:29,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:49:29,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 95 transitions, 756 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:29,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:29,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:49:29,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:29,857 INFO L124 PetriNetUnfolderBase]: 232/455 cut-off events. [2024-06-14 15:49:29,857 INFO L125 PetriNetUnfolderBase]: For 10022/10022 co-relation queries the response was YES. [2024-06-14 15:49:29,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2608 conditions, 455 events. 232/455 cut-off events. For 10022/10022 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2032 event pairs, 28 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 2557. Up to 335 conditions per place. [2024-06-14 15:49:29,861 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 80 selfloop transitions, 32 changer transitions 0/116 dead transitions. [2024-06-14 15:49:29,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 116 transitions, 1247 flow [2024-06-14 15:49:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:49:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:49:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-06-14 15:49:29,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-14 15:49:29,863 INFO L175 Difference]: Start difference. First operand has 103 places, 95 transitions, 756 flow. Second operand 9 states and 124 transitions. [2024-06-14 15:49:29,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 116 transitions, 1247 flow [2024-06-14 15:49:29,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 116 transitions, 1206 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 15:49:29,874 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 910 flow [2024-06-14 15:49:29,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=910, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2024-06-14 15:49:29,875 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 76 predicate places. [2024-06-14 15:49:29,875 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 910 flow [2024-06-14 15:49:29,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:29,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:29,875 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:29,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:49:29,876 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:49:29,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:29,876 INFO L85 PathProgramCache]: Analyzing trace with hash 970846940, now seen corresponding path program 3 times [2024-06-14 15:49:29,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:29,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367649937] [2024-06-14 15:49:29,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:29,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:37,829 INFO 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:37,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:37,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367649937] [2024-06-14 15:49:37,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367649937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:37,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:37,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:37,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235304763] [2024-06-14 15:49:37,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:37,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:37,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:37,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:37,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:37,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:49:37,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 910 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:37,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:37,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:49:37,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:38,158 INFO L124 PetriNetUnfolderBase]: 228/449 cut-off events. [2024-06-14 15:49:38,159 INFO L125 PetriNetUnfolderBase]: For 10403/10403 co-relation queries the response was YES. [2024-06-14 15:49:38,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2579 conditions, 449 events. 228/449 cut-off events. For 10403/10403 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2011 event pairs, 28 based on Foata normal form. 2/450 useless extension candidates. Maximal degree in co-relation 2527. Up to 332 conditions per place. [2024-06-14 15:49:38,162 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 80 selfloop transitions, 31 changer transitions 0/115 dead transitions. [2024-06-14 15:49:38,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 115 transitions, 1225 flow [2024-06-14 15:49:38,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:49:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:49:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-14 15:49:38,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2024-06-14 15:49:38,166 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 910 flow. Second operand 9 states and 122 transitions. [2024-06-14 15:49:38,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 115 transitions, 1225 flow [2024-06-14 15:49:38,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 115 transitions, 1143 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-06-14 15:49:38,178 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 897 flow [2024-06-14 15:49:38,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=897, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2024-06-14 15:49:38,178 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 81 predicate places. [2024-06-14 15:49:38,178 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 897 flow [2024-06-14 15:49:38,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:38,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:38,179 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:38,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:49:38,179 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:49:38,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:38,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1156048508, now seen corresponding path program 1 times [2024-06-14 15:49:38,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:38,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070195493] [2024-06-14 15:49:38,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:38,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:44,444 INFO 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:44,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:44,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070195493] [2024-06-14 15:49:44,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070195493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:44,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:44,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:44,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695556702] [2024-06-14 15:49:44,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:44,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:44,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:44,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:44,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:44,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:49:44,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 897 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:44,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:44,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:49:44,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:45,000 INFO L124 PetriNetUnfolderBase]: 244/485 cut-off events. [2024-06-14 15:49:45,000 INFO L125 PetriNetUnfolderBase]: For 14040/14040 co-relation queries the response was YES. [2024-06-14 15:49:45,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2780 conditions, 485 events. 244/485 cut-off events. For 14040/14040 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2214 event pairs, 32 based on Foata normal form. 10/494 useless extension candidates. Maximal degree in co-relation 2726. Up to 350 conditions per place. [2024-06-14 15:49:45,005 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 86 selfloop transitions, 26 changer transitions 4/120 dead transitions. [2024-06-14 15:49:45,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 1236 flow [2024-06-14 15:49:45,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:45,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-14 15:49:45,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-14 15:49:45,011 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 897 flow. Second operand 10 states and 134 transitions. [2024-06-14 15:49:45,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 120 transitions, 1236 flow [2024-06-14 15:49:45,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 120 transitions, 1174 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:49:45,026 INFO L231 Difference]: Finished difference. Result has 116 places, 103 transitions, 918 flow [2024-06-14 15:49:45,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=918, PETRI_PLACES=116, PETRI_TRANSITIONS=103} [2024-06-14 15:49:45,027 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2024-06-14 15:49:45,027 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 103 transitions, 918 flow [2024-06-14 15:49:45,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:45,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:45,027 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:45,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:49:45,028 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:49:45,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:45,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1421103044, now seen corresponding path program 4 times [2024-06-14 15:49:45,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:45,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133492612] [2024-06-14 15:49:45,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:45,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:50,100 INFO 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:50,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:50,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133492612] [2024-06-14 15:49:50,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133492612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:50,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:50,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:49:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669953473] [2024-06-14 15:49:50,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:50,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:49:50,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:50,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:49:50,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:49:50,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:49:50,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 103 transitions, 918 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:49:50,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:50,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:49:50,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:50,444 INFO L124 PetriNetUnfolderBase]: 235/468 cut-off events. [2024-06-14 15:49:50,445 INFO L125 PetriNetUnfolderBase]: For 10704/10704 co-relation queries the response was YES. [2024-06-14 15:49:50,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2665 conditions, 468 events. 235/468 cut-off events. For 10704/10704 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2142 event pairs, 34 based on Foata normal form. 2/466 useless extension candidates. Maximal degree in co-relation 2609. Up to 386 conditions per place. [2024-06-14 15:49:50,448 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 89 selfloop transitions, 20 changer transitions 0/113 dead transitions. [2024-06-14 15:49:50,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 113 transitions, 1168 flow [2024-06-14 15:49:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:49:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:49:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:49:50,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-14 15:49:50,451 INFO L175 Difference]: Start difference. First operand has 116 places, 103 transitions, 918 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:49:50,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 113 transitions, 1168 flow [2024-06-14 15:49:50,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 1106 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:49:50,465 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 910 flow [2024-06-14 15:49:50,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=910, PETRI_PLACES=117, PETRI_TRANSITIONS=104} [2024-06-14 15:49:50,466 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 86 predicate places. [2024-06-14 15:49:50,467 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 910 flow [2024-06-14 15:49:50,467 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:49:50,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:50,467 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:50,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:49:50,467 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:49:50,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:50,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2044807056, now seen corresponding path program 4 times [2024-06-14 15:49:50,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:50,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683486971] [2024-06-14 15:49:50,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:50,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:56,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:56,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683486971] [2024-06-14 15:49:56,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683486971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:56,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:56,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:56,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857027069] [2024-06-14 15:49:56,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:56,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:56,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:56,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:56,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:56,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:49:56,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 104 transitions, 910 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:56,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:56,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:49:56,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:57,212 INFO L124 PetriNetUnfolderBase]: 246/492 cut-off events. [2024-06-14 15:49:57,212 INFO L125 PetriNetUnfolderBase]: For 12295/12295 co-relation queries the response was YES. [2024-06-14 15:49:57,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2856 conditions, 492 events. 246/492 cut-off events. For 12295/12295 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2278 event pairs, 35 based on Foata normal form. 2/493 useless extension candidates. Maximal degree in co-relation 2799. Up to 412 conditions per place. [2024-06-14 15:49:57,216 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 96 selfloop transitions, 19 changer transitions 0/119 dead transitions. [2024-06-14 15:49:57,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 119 transitions, 1324 flow [2024-06-14 15:49:57,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:49:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:49:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 15:49:57,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-14 15:49:57,218 INFO L175 Difference]: Start difference. First operand has 117 places, 104 transitions, 910 flow. Second operand 9 states and 118 transitions. [2024-06-14 15:49:57,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 119 transitions, 1324 flow [2024-06-14 15:49:57,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 119 transitions, 1235 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:57,233 INFO L231 Difference]: Finished difference. Result has 118 places, 109 transitions, 970 flow [2024-06-14 15:49:57,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=970, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2024-06-14 15:49:57,234 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 87 predicate places. [2024-06-14 15:49:57,234 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 970 flow [2024-06-14 15:49:57,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:57,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:57,234 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:57,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:49:57,235 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:49:57,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1414431844, now seen corresponding path program 5 times [2024-06-14 15:49:57,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:57,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325391036] [2024-06-14 15:49:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:04,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:04,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325391036] [2024-06-14 15:50:04,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325391036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:04,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:04,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:04,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917276972] [2024-06-14 15:50:04,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:04,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:04,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:04,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:05,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:50:05,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 970 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:05,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:05,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:50:05,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:05,348 INFO L124 PetriNetUnfolderBase]: 262/520 cut-off events. [2024-06-14 15:50:05,349 INFO L125 PetriNetUnfolderBase]: For 14876/14876 co-relation queries the response was YES. [2024-06-14 15:50:05,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3186 conditions, 520 events. 262/520 cut-off events. For 14876/14876 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2447 event pairs, 34 based on Foata normal form. 2/518 useless extension candidates. Maximal degree in co-relation 3129. Up to 398 conditions per place. [2024-06-14 15:50:05,352 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 89 selfloop transitions, 32 changer transitions 0/125 dead transitions. [2024-06-14 15:50:05,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 125 transitions, 1416 flow [2024-06-14 15:50:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-14 15:50:05,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2024-06-14 15:50:05,353 INFO L175 Difference]: Start difference. First operand has 118 places, 109 transitions, 970 flow. Second operand 9 states and 122 transitions. [2024-06-14 15:50:05,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 125 transitions, 1416 flow [2024-06-14 15:50:05,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 125 transitions, 1345 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-14 15:50:05,370 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 1084 flow [2024-06-14 15:50:05,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1084, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2024-06-14 15:50:05,370 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 91 predicate places. [2024-06-14 15:50:05,370 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 1084 flow [2024-06-14 15:50:05,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:05,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:05,371 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:05,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:50:05,371 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:50:05,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:05,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1420925104, now seen corresponding path program 6 times [2024-06-14 15:50:05,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:05,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329572751] [2024-06-14 15:50:05,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:05,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:11,541 INFO 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:11,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:11,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329572751] [2024-06-14 15:50:11,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329572751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:11,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:11,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:11,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973768900] [2024-06-14 15:50:11,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:11,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:11,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:11,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:11,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:11,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:50:11,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 1084 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:11,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:11,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:50:11,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:12,024 INFO L124 PetriNetUnfolderBase]: 260/517 cut-off events. [2024-06-14 15:50:12,024 INFO L125 PetriNetUnfolderBase]: For 14230/14230 co-relation queries the response was YES. [2024-06-14 15:50:12,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3176 conditions, 517 events. 260/517 cut-off events. For 14230/14230 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2443 event pairs, 34 based on Foata normal form. 1/514 useless extension candidates. Maximal degree in co-relation 3117. Up to 397 conditions per place. [2024-06-14 15:50:12,028 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 88 selfloop transitions, 34 changer transitions 0/126 dead transitions. [2024-06-14 15:50:12,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 126 transitions, 1462 flow [2024-06-14 15:50:12,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-14 15:50:12,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-06-14 15:50:12,035 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 1084 flow. Second operand 9 states and 123 transitions. [2024-06-14 15:50:12,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 126 transitions, 1462 flow [2024-06-14 15:50:12,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 126 transitions, 1367 flow, removed 33 selfloop flow, removed 5 redundant places. [2024-06-14 15:50:12,054 INFO L231 Difference]: Finished difference. Result has 126 places, 116 transitions, 1108 flow [2024-06-14 15:50:12,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1108, PETRI_PLACES=126, PETRI_TRANSITIONS=116} [2024-06-14 15:50:12,054 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 95 predicate places. [2024-06-14 15:50:12,054 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 116 transitions, 1108 flow [2024-06-14 15:50:12,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:12,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:12,055 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:12,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:50:12,055 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:50:12,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:12,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2052850626, now seen corresponding path program 7 times [2024-06-14 15:50:12,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:12,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445412148] [2024-06-14 15:50:12,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:12,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:19,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:19,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445412148] [2024-06-14 15:50:19,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445412148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:19,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:19,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:19,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786643687] [2024-06-14 15:50:19,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:19,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:19,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:19,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:19,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:19,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:50:19,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 116 transitions, 1108 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:19,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:19,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:50:19,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:19,590 INFO L124 PetriNetUnfolderBase]: 266/527 cut-off events. [2024-06-14 15:50:19,590 INFO L125 PetriNetUnfolderBase]: For 15241/15241 co-relation queries the response was YES. [2024-06-14 15:50:19,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3286 conditions, 527 events. 266/527 cut-off events. For 15241/15241 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2489 event pairs, 34 based on Foata normal form. 2/525 useless extension candidates. Maximal degree in co-relation 3225. Up to 303 conditions per place. [2024-06-14 15:50:19,594 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 73 selfloop transitions, 57 changer transitions 0/134 dead transitions. [2024-06-14 15:50:19,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 134 transitions, 1732 flow [2024-06-14 15:50:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2024-06-14 15:50:19,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2024-06-14 15:50:19,596 INFO L175 Difference]: Start difference. First operand has 126 places, 116 transitions, 1108 flow. Second operand 9 states and 129 transitions. [2024-06-14 15:50:19,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 134 transitions, 1732 flow [2024-06-14 15:50:19,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 134 transitions, 1644 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 15:50:19,616 INFO L231 Difference]: Finished difference. Result has 129 places, 121 transitions, 1267 flow [2024-06-14 15:50:19,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1267, PETRI_PLACES=129, PETRI_TRANSITIONS=121} [2024-06-14 15:50:19,617 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 98 predicate places. [2024-06-14 15:50:19,617 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 121 transitions, 1267 flow [2024-06-14 15:50:19,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:19,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:19,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:50:19,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:50:19,617 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:50:19,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:19,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2053087776, now seen corresponding path program 8 times [2024-06-14 15:50:19,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:19,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277259627] [2024-06-14 15:50:19,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:19,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:26,272 INFO 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:26,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:26,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277259627] [2024-06-14 15:50:26,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277259627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:26,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:26,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:26,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220638036] [2024-06-14 15:50:26,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:26,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:26,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:26,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:26,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:26,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:50:26,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 1267 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:26,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:26,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:50:26,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:26,612 INFO L124 PetriNetUnfolderBase]: 264/524 cut-off events. [2024-06-14 15:50:26,612 INFO L125 PetriNetUnfolderBase]: For 14923/14923 co-relation queries the response was YES. [2024-06-14 15:50:26,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 524 events. 264/524 cut-off events. For 14923/14923 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2481 event pairs, 34 based on Foata normal form. 1/521 useless extension candidates. Maximal degree in co-relation 3250. Up to 302 conditions per place. [2024-06-14 15:50:26,616 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 68 selfloop transitions, 62 changer transitions 0/134 dead transitions. [2024-06-14 15:50:26,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 134 transitions, 1743 flow [2024-06-14 15:50:26,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 15:50:26,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-14 15:50:26,617 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 1267 flow. Second operand 9 states and 118 transitions. [2024-06-14 15:50:26,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 134 transitions, 1743 flow [2024-06-14 15:50:26,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 134 transitions, 1555 flow, removed 47 selfloop flow, removed 7 redundant places. [2024-06-14 15:50:26,639 INFO L231 Difference]: Finished difference. Result has 131 places, 123 transitions, 1260 flow [2024-06-14 15:50:26,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1260, PETRI_PLACES=131, PETRI_TRANSITIONS=123} [2024-06-14 15:50:26,640 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 100 predicate places. [2024-06-14 15:50:26,640 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 123 transitions, 1260 flow [2024-06-14 15:50:26,640 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:26,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:26,640 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:26,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:50:26,641 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:50:26,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:26,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2052841698, now seen corresponding path program 2 times [2024-06-14 15:50:26,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:26,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004902378] [2024-06-14 15:50:26,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:33,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:33,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004902378] [2024-06-14 15:50:33,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004902378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:33,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:33,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:33,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117220955] [2024-06-14 15:50:33,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:33,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:33,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:33,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:33,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:33,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:50:33,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 123 transitions, 1260 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:33,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:33,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:50:33,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:33,603 INFO L124 PetriNetUnfolderBase]: 268/532 cut-off events. [2024-06-14 15:50:33,604 INFO L125 PetriNetUnfolderBase]: For 15093/15093 co-relation queries the response was YES. [2024-06-14 15:50:33,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3276 conditions, 532 events. 268/532 cut-off events. For 15093/15093 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2529 event pairs, 34 based on Foata normal form. 2/530 useless extension candidates. Maximal degree in co-relation 3214. Up to 370 conditions per place. [2024-06-14 15:50:33,608 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 85 selfloop transitions, 45 changer transitions 0/134 dead transitions. [2024-06-14 15:50:33,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 134 transitions, 1566 flow [2024-06-14 15:50:33,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-14 15:50:33,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-06-14 15:50:33,609 INFO L175 Difference]: Start difference. First operand has 131 places, 123 transitions, 1260 flow. Second operand 9 states and 123 transitions. [2024-06-14 15:50:33,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 134 transitions, 1566 flow [2024-06-14 15:50:33,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 134 transitions, 1424 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-14 15:50:33,632 INFO L231 Difference]: Finished difference. Result has 134 places, 124 transitions, 1236 flow [2024-06-14 15:50:33,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1236, PETRI_PLACES=134, PETRI_TRANSITIONS=124} [2024-06-14 15:50:33,633 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2024-06-14 15:50:33,633 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 124 transitions, 1236 flow [2024-06-14 15:50:33,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:33,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:33,633 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:33,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:50:33,634 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:50:33,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:33,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1767741828, now seen corresponding path program 3 times [2024-06-14 15:50:33,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:33,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661062785] [2024-06-14 15:50:33,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:33,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:39,788 INFO 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:39,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:39,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661062785] [2024-06-14 15:50:39,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661062785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:39,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:39,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:39,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010060311] [2024-06-14 15:50:39,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:39,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:39,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:39,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:39,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:50:39,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 124 transitions, 1236 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:39,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:39,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:50:39,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:40,239 INFO L124 PetriNetUnfolderBase]: 272/546 cut-off events. [2024-06-14 15:50:40,239 INFO L125 PetriNetUnfolderBase]: For 15881/15881 co-relation queries the response was YES. [2024-06-14 15:50:40,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 546 events. 272/546 cut-off events. For 15881/15881 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2623 event pairs, 37 based on Foata normal form. 2/547 useless extension candidates. Maximal degree in co-relation 3234. Up to 462 conditions per place. [2024-06-14 15:50:40,244 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 116 selfloop transitions, 15 changer transitions 0/135 dead transitions. [2024-06-14 15:50:40,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 135 transitions, 1546 flow [2024-06-14 15:50:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-14 15:50:40,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3993055555555556 [2024-06-14 15:50:40,262 INFO L175 Difference]: Start difference. First operand has 134 places, 124 transitions, 1236 flow. Second operand 9 states and 115 transitions. [2024-06-14 15:50:40,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 135 transitions, 1546 flow [2024-06-14 15:50:40,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 1438 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 15:50:40,287 INFO L231 Difference]: Finished difference. Result has 136 places, 125 transitions, 1188 flow [2024-06-14 15:50:40,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1188, PETRI_PLACES=136, PETRI_TRANSITIONS=125} [2024-06-14 15:50:40,288 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 105 predicate places. [2024-06-14 15:50:40,288 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 125 transitions, 1188 flow [2024-06-14 15:50:40,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:40,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:40,288 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:40,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:50:40,289 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:50:40,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:40,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1757266308, now seen corresponding path program 4 times [2024-06-14 15:50:40,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:40,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255881665] [2024-06-14 15:50:40,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:40,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:45,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:45,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255881665] [2024-06-14 15:50:45,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255881665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:45,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:45,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:45,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354598279] [2024-06-14 15:50:45,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:45,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:45,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:45,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:45,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:46,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:50:46,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 1188 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:46,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:46,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:50:46,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:46,474 INFO L124 PetriNetUnfolderBase]: 276/554 cut-off events. [2024-06-14 15:50:46,475 INFO L125 PetriNetUnfolderBase]: For 16541/16541 co-relation queries the response was YES. [2024-06-14 15:50:46,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3287 conditions, 554 events. 276/554 cut-off events. For 16541/16541 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2685 event pairs, 35 based on Foata normal form. 2/555 useless extension candidates. Maximal degree in co-relation 3223. Up to 456 conditions per place. [2024-06-14 15:50:46,479 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 117 selfloop transitions, 18 changer transitions 0/139 dead transitions. [2024-06-14 15:50:46,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 139 transitions, 1514 flow [2024-06-14 15:50:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:50:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:50:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 15:50:46,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 15:50:46,480 INFO L175 Difference]: Start difference. First operand has 136 places, 125 transitions, 1188 flow. Second operand 11 states and 136 transitions. [2024-06-14 15:50:46,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 139 transitions, 1514 flow [2024-06-14 15:50:46,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 139 transitions, 1464 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 15:50:46,504 INFO L231 Difference]: Finished difference. Result has 140 places, 126 transitions, 1206 flow [2024-06-14 15:50:46,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1206, PETRI_PLACES=140, PETRI_TRANSITIONS=126} [2024-06-14 15:50:46,505 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 109 predicate places. [2024-06-14 15:50:46,505 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 126 transitions, 1206 flow [2024-06-14 15:50:46,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:46,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:46,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:46,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:50:46,506 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:50:46,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash -770084386, now seen corresponding path program 5 times [2024-06-14 15:50:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:46,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97333669] [2024-06-14 15:50:46,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:46,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:52,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:52,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97333669] [2024-06-14 15:50:52,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97333669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:52,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:52,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:52,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846219467] [2024-06-14 15:50:52,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:52,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:52,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:52,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:52,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:53,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 15:50:53,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 126 transitions, 1206 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:53,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:53,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 15:50:53,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:53,326 INFO L124 PetriNetUnfolderBase]: 285/575 cut-off events. [2024-06-14 15:50:53,326 INFO L125 PetriNetUnfolderBase]: For 21567/21567 co-relation queries the response was YES. [2024-06-14 15:50:53,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 575 events. 285/575 cut-off events. For 21567/21567 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2793 event pairs, 39 based on Foata normal form. 10/581 useless extension candidates. Maximal degree in co-relation 3247. Up to 431 conditions per place. [2024-06-14 15:50:53,345 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 105 selfloop transitions, 27 changer transitions 4/140 dead transitions. [2024-06-14 15:50:53,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 140 transitions, 1554 flow [2024-06-14 15:50:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2024-06-14 15:50:53,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-14 15:50:53,347 INFO L175 Difference]: Start difference. First operand has 140 places, 126 transitions, 1206 flow. Second operand 10 states and 144 transitions. [2024-06-14 15:50:53,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 140 transitions, 1554 flow [2024-06-14 15:50:53,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 140 transitions, 1468 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-14 15:50:53,400 INFO L231 Difference]: Finished difference. Result has 141 places, 125 transitions, 1171 flow [2024-06-14 15:50:53,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1171, PETRI_PLACES=141, PETRI_TRANSITIONS=125} [2024-06-14 15:50:53,400 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 110 predicate places. [2024-06-14 15:50:53,400 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 125 transitions, 1171 flow [2024-06-14 15:50:53,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:53,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:53,404 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:50:53,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:50:53,404 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:50:53,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:53,405 INFO L85 PathProgramCache]: Analyzing trace with hash 600272723, now seen corresponding path program 1 times [2024-06-14 15:50:53,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:53,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297377141] [2024-06-14 15:50:53,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:53,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:59,096 INFO 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:59,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:59,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297377141] [2024-06-14 15:50:59,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297377141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:59,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:59,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:59,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654265063] [2024-06-14 15:50:59,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:59,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:59,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:59,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:59,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:59,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:50:59,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 125 transitions, 1171 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:59,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:59,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:50:59,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:59,610 INFO L124 PetriNetUnfolderBase]: 283/575 cut-off events. [2024-06-14 15:50:59,610 INFO L125 PetriNetUnfolderBase]: For 16341/16341 co-relation queries the response was YES. [2024-06-14 15:50:59,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 575 events. 283/575 cut-off events. For 16341/16341 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2818 event pairs, 20 based on Foata normal form. 2/576 useless extension candidates. Maximal degree in co-relation 3198. Up to 460 conditions per place. [2024-06-14 15:50:59,614 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 126 selfloop transitions, 13 changer transitions 0/143 dead transitions. [2024-06-14 15:50:59,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 143 transitions, 1503 flow [2024-06-14 15:50:59,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 15:50:59,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-14 15:50:59,615 INFO L175 Difference]: Start difference. First operand has 141 places, 125 transitions, 1171 flow. Second operand 9 states and 118 transitions. [2024-06-14 15:50:59,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 143 transitions, 1503 flow [2024-06-14 15:50:59,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 143 transitions, 1433 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:50:59,641 INFO L231 Difference]: Finished difference. Result has 142 places, 126 transitions, 1143 flow [2024-06-14 15:50:59,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1143, PETRI_PLACES=142, PETRI_TRANSITIONS=126} [2024-06-14 15:50:59,641 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2024-06-14 15:50:59,641 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 126 transitions, 1143 flow [2024-06-14 15:50:59,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:59,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:59,642 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:50:59,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:50:59,644 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:50:59,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash -294227245, now seen corresponding path program 2 times [2024-06-14 15:50:59,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:59,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775114529] [2024-06-14 15:50:59,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:59,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:06,140 INFO 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:06,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:06,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775114529] [2024-06-14 15:51:06,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775114529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:06,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:06,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:51:06,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921905201] [2024-06-14 15:51:06,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:06,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:51:06,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:06,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:51:06,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:51:06,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:51:06,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 126 transitions, 1143 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:06,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:06,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:51:06,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:06,627 INFO L124 PetriNetUnfolderBase]: 287/583 cut-off events. [2024-06-14 15:51:06,627 INFO L125 PetriNetUnfolderBase]: For 16739/16739 co-relation queries the response was YES. [2024-06-14 15:51:06,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3270 conditions, 583 events. 287/583 cut-off events. For 16739/16739 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2872 event pairs, 34 based on Foata normal form. 2/584 useless extension candidates. Maximal degree in co-relation 3204. Up to 485 conditions per place. [2024-06-14 15:51:06,631 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 125 selfloop transitions, 14 changer transitions 0/143 dead transitions. [2024-06-14 15:51:06,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 143 transitions, 1475 flow [2024-06-14 15:51:06,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:51:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:51:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 15:51:06,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2024-06-14 15:51:06,632 INFO L175 Difference]: Start difference. First operand has 142 places, 126 transitions, 1143 flow. Second operand 9 states and 119 transitions. [2024-06-14 15:51:06,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 143 transitions, 1475 flow [2024-06-14 15:51:06,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 143 transitions, 1443 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:51:06,661 INFO L231 Difference]: Finished difference. Result has 144 places, 127 transitions, 1157 flow [2024-06-14 15:51:06,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1157, PETRI_PLACES=144, PETRI_TRANSITIONS=127} [2024-06-14 15:51:06,662 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-14 15:51:06,662 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 127 transitions, 1157 flow [2024-06-14 15:51:06,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:06,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:06,662 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:51:06,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:51:06,663 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:51:06,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:06,663 INFO L85 PathProgramCache]: Analyzing trace with hash -294079375, now seen corresponding path program 3 times [2024-06-14 15:51:06,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:06,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780337096] [2024-06-14 15:51:06,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:13,870 INFO 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:13,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:13,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780337096] [2024-06-14 15:51:13,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780337096] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:13,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:13,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:51:13,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638218811] [2024-06-14 15:51:13,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:13,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:51:13,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:13,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:51:13,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:51:13,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:51:13,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 127 transitions, 1157 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:13,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:13,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:51:13,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:14,309 INFO L124 PetriNetUnfolderBase]: 291/591 cut-off events. [2024-06-14 15:51:14,309 INFO L125 PetriNetUnfolderBase]: For 17799/17799 co-relation queries the response was YES. [2024-06-14 15:51:14,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3325 conditions, 591 events. 291/591 cut-off events. For 17799/17799 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2944 event pairs, 36 based on Foata normal form. 2/592 useless extension candidates. Maximal degree in co-relation 3258. Up to 498 conditions per place. [2024-06-14 15:51:14,313 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 124 selfloop transitions, 15 changer transitions 0/143 dead transitions. [2024-06-14 15:51:14,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 143 transitions, 1489 flow [2024-06-14 15:51:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:51:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:51:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 15:51:14,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2024-06-14 15:51:14,315 INFO L175 Difference]: Start difference. First operand has 144 places, 127 transitions, 1157 flow. Second operand 9 states and 119 transitions. [2024-06-14 15:51:14,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 143 transitions, 1489 flow [2024-06-14 15:51:14,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 143 transitions, 1453 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:51:14,344 INFO L231 Difference]: Finished difference. Result has 146 places, 128 transitions, 1171 flow [2024-06-14 15:51:14,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1171, PETRI_PLACES=146, PETRI_TRANSITIONS=128} [2024-06-14 15:51:14,345 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-14 15:51:14,345 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 128 transitions, 1171 flow [2024-06-14 15:51:14,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:14,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:14,345 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:51:14,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:51:14,345 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:51:14,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash 24127247, now seen corresponding path program 4 times [2024-06-14 15:51:14,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:14,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088065004] [2024-06-14 15:51:14,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:14,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:20,329 INFO 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:20,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:20,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088065004] [2024-06-14 15:51:20,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088065004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:20,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:20,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:51:20,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830492959] [2024-06-14 15:51:20,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:20,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:51:20,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:20,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:51:20,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:51:20,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:51:20,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 128 transitions, 1171 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:20,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:20,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:51:20,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:20,709 INFO L124 PetriNetUnfolderBase]: 295/599 cut-off events. [2024-06-14 15:51:20,709 INFO L125 PetriNetUnfolderBase]: For 18624/18624 co-relation queries the response was YES. [2024-06-14 15:51:20,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3380 conditions, 599 events. 295/599 cut-off events. For 18624/18624 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2989 event pairs, 36 based on Foata normal form. 2/600 useless extension candidates. Maximal degree in co-relation 3312. Up to 495 conditions per place. [2024-06-14 15:51:20,713 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 114 selfloop transitions, 23 changer transitions 0/141 dead transitions. [2024-06-14 15:51:20,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 141 transitions, 1491 flow [2024-06-14 15:51:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:51:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:51:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 15:51:20,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-14 15:51:20,715 INFO L175 Difference]: Start difference. First operand has 146 places, 128 transitions, 1171 flow. Second operand 9 states and 118 transitions. [2024-06-14 15:51:20,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 141 transitions, 1491 flow [2024-06-14 15:51:20,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 141 transitions, 1451 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 15:51:20,741 INFO L231 Difference]: Finished difference. Result has 148 places, 129 transitions, 1199 flow [2024-06-14 15:51:20,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1199, PETRI_PLACES=148, PETRI_TRANSITIONS=129} [2024-06-14 15:51:20,742 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-14 15:51:20,742 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 129 transitions, 1199 flow [2024-06-14 15:51:20,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:20,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:20,742 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:51:20,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:51:20,742 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:51:20,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:20,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1015020401, now seen corresponding path program 5 times [2024-06-14 15:51:20,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:20,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324267260] [2024-06-14 15:51:20,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:20,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:26,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:26,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324267260] [2024-06-14 15:51:26,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324267260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:26,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:26,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:51:26,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778283898] [2024-06-14 15:51:26,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:26,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:51:26,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:26,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:51:26,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:51:26,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:51:26,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 129 transitions, 1199 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:26,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:26,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:51:26,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:26,883 INFO L124 PetriNetUnfolderBase]: 299/607 cut-off events. [2024-06-14 15:51:26,884 INFO L125 PetriNetUnfolderBase]: For 19406/19406 co-relation queries the response was YES. [2024-06-14 15:51:26,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3450 conditions, 607 events. 299/607 cut-off events. For 19406/19406 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3044 event pairs, 38 based on Foata normal form. 2/608 useless extension candidates. Maximal degree in co-relation 3381. Up to 512 conditions per place. [2024-06-14 15:51:26,903 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 120 selfloop transitions, 20 changer transitions 0/144 dead transitions. [2024-06-14 15:51:26,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 144 transitions, 1553 flow [2024-06-14 15:51:26,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:51:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:51:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 15:51:26,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-14 15:51:26,906 INFO L175 Difference]: Start difference. First operand has 148 places, 129 transitions, 1199 flow. Second operand 9 states and 116 transitions. [2024-06-14 15:51:26,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 144 transitions, 1553 flow [2024-06-14 15:51:26,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 1491 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:51:26,938 INFO L231 Difference]: Finished difference. Result has 151 places, 132 transitions, 1238 flow [2024-06-14 15:51:26,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1238, PETRI_PLACES=151, PETRI_TRANSITIONS=132} [2024-06-14 15:51:26,939 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-14 15:51:26,939 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 132 transitions, 1238 flow [2024-06-14 15:51:26,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:26,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:26,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:26,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:51:26,940 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:51:26,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1270682131, now seen corresponding path program 6 times [2024-06-14 15:51:26,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:26,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098603217] [2024-06-14 15:51:26,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:26,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:32,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:32,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098603217] [2024-06-14 15:51:32,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098603217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:32,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:32,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:51:32,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54258197] [2024-06-14 15:51:32,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:32,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:51:32,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:32,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:51:32,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:51:33,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:51:33,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 132 transitions, 1238 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:33,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:33,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:51:33,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:33,388 INFO L124 PetriNetUnfolderBase]: 303/615 cut-off events. [2024-06-14 15:51:33,388 INFO L125 PetriNetUnfolderBase]: For 20338/20338 co-relation queries the response was YES. [2024-06-14 15:51:33,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3508 conditions, 615 events. 303/615 cut-off events. For 20338/20338 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3110 event pairs, 36 based on Foata normal form. 2/616 useless extension candidates. Maximal degree in co-relation 3437. Up to 518 conditions per place. [2024-06-14 15:51:33,393 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 125 selfloop transitions, 17 changer transitions 0/146 dead transitions. [2024-06-14 15:51:33,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 146 transitions, 1574 flow [2024-06-14 15:51:33,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:51:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:51:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 15:51:33,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-14 15:51:33,394 INFO L175 Difference]: Start difference. First operand has 151 places, 132 transitions, 1238 flow. Second operand 9 states and 116 transitions. [2024-06-14 15:51:33,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 146 transitions, 1574 flow [2024-06-14 15:51:33,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 146 transitions, 1527 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:51:33,428 INFO L231 Difference]: Finished difference. Result has 154 places, 133 transitions, 1251 flow [2024-06-14 15:51:33,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1251, PETRI_PLACES=154, PETRI_TRANSITIONS=133} [2024-06-14 15:51:33,428 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 123 predicate places. [2024-06-14 15:51:33,428 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 133 transitions, 1251 flow [2024-06-14 15:51:33,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:33,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:33,429 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:51:33,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:51:33,429 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:51:33,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1470137743, now seen corresponding path program 1 times [2024-06-14 15:51:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:33,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412806360] [2024-06-14 15:51:33,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:33,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:40,318 INFO 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:40,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:40,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412806360] [2024-06-14 15:51:40,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412806360] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:40,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:40,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:40,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921869309] [2024-06-14 15:51:40,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:40,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:40,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:40,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:40,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:40,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:51:40,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 133 transitions, 1251 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:40,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:40,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:51:40,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:40,939 INFO L124 PetriNetUnfolderBase]: 306/620 cut-off events. [2024-06-14 15:51:40,939 INFO L125 PetriNetUnfolderBase]: For 20175/20175 co-relation queries the response was YES. [2024-06-14 15:51:40,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3559 conditions, 620 events. 306/620 cut-off events. For 20175/20175 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3137 event pairs, 38 based on Foata normal form. 1/620 useless extension candidates. Maximal degree in co-relation 3487. Up to 503 conditions per place. [2024-06-14 15:51:40,945 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 115 selfloop transitions, 29 changer transitions 0/148 dead transitions. [2024-06-14 15:51:40,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 148 transitions, 1621 flow [2024-06-14 15:51:40,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:40,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-14 15:51:40,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-14 15:51:40,949 INFO L175 Difference]: Start difference. First operand has 154 places, 133 transitions, 1251 flow. Second operand 10 states and 131 transitions. [2024-06-14 15:51:40,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 148 transitions, 1621 flow [2024-06-14 15:51:40,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 148 transitions, 1571 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 15:51:40,989 INFO L231 Difference]: Finished difference. Result has 158 places, 136 transitions, 1329 flow [2024-06-14 15:51:40,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1329, PETRI_PLACES=158, PETRI_TRANSITIONS=136} [2024-06-14 15:51:40,990 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2024-06-14 15:51:40,990 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 136 transitions, 1329 flow [2024-06-14 15:51:40,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:40,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:40,991 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:51:40,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:51:40,991 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:51:40,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:40,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2068165211, now seen corresponding path program 2 times [2024-06-14 15:51:40,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:40,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536347000] [2024-06-14 15:51:40,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:40,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:48,246 INFO 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:48,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:48,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536347000] [2024-06-14 15:51:48,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536347000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:48,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:48,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:48,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403122094] [2024-06-14 15:51:48,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:48,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:48,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:48,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:48,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:48,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:51:48,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 136 transitions, 1329 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:48,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:48,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:51:48,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:48,767 INFO L124 PetriNetUnfolderBase]: 304/617 cut-off events. [2024-06-14 15:51:48,767 INFO L125 PetriNetUnfolderBase]: For 19805/19805 co-relation queries the response was YES. [2024-06-14 15:51:48,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3509 conditions, 617 events. 304/617 cut-off events. For 19805/19805 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3122 event pairs, 38 based on Foata normal form. 1/617 useless extension candidates. Maximal degree in co-relation 3435. Up to 500 conditions per place. [2024-06-14 15:51:48,771 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 113 selfloop transitions, 31 changer transitions 0/148 dead transitions. [2024-06-14 15:51:48,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 148 transitions, 1647 flow [2024-06-14 15:51:48,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-14 15:51:48,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:51:48,772 INFO L175 Difference]: Start difference. First operand has 158 places, 136 transitions, 1329 flow. Second operand 10 states and 130 transitions. [2024-06-14 15:51:48,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 148 transitions, 1647 flow [2024-06-14 15:51:48,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 148 transitions, 1537 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-14 15:51:48,814 INFO L231 Difference]: Finished difference. Result has 161 places, 136 transitions, 1286 flow [2024-06-14 15:51:48,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1286, PETRI_PLACES=161, PETRI_TRANSITIONS=136} [2024-06-14 15:51:48,815 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 130 predicate places. [2024-06-14 15:51:48,815 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 136 transitions, 1286 flow [2024-06-14 15:51:48,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:48,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:48,816 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:51:48,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:51:48,816 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:51:48,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash 778783213, now seen corresponding path program 7 times [2024-06-14 15:51:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:48,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101460751] [2024-06-14 15:51:48,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:48,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:56,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:56,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101460751] [2024-06-14 15:51:56,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101460751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:56,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:56,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:51:56,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017150674] [2024-06-14 15:51:56,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:56,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:51:56,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:56,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:51:56,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:51:56,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:51:56,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 136 transitions, 1286 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:56,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:56,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:51:56,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:57,102 INFO L124 PetriNetUnfolderBase]: 308/623 cut-off events. [2024-06-14 15:51:57,102 INFO L125 PetriNetUnfolderBase]: For 21557/21557 co-relation queries the response was YES. [2024-06-14 15:51:57,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3533 conditions, 623 events. 308/623 cut-off events. For 21557/21557 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3171 event pairs, 41 based on Foata normal form. 2/621 useless extension candidates. Maximal degree in co-relation 3458. Up to 494 conditions per place. [2024-06-14 15:51:57,107 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 107 selfloop transitions, 36 changer transitions 0/147 dead transitions. [2024-06-14 15:51:57,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 147 transitions, 1618 flow [2024-06-14 15:51:57,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:51:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:51:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 15:51:57,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-14 15:51:57,109 INFO L175 Difference]: Start difference. First operand has 161 places, 136 transitions, 1286 flow. Second operand 9 states and 118 transitions. [2024-06-14 15:51:57,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 147 transitions, 1618 flow [2024-06-14 15:51:57,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 147 transitions, 1512 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 15:51:57,153 INFO L231 Difference]: Finished difference. Result has 160 places, 137 transitions, 1280 flow [2024-06-14 15:51:57,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1280, PETRI_PLACES=160, PETRI_TRANSITIONS=137} [2024-06-14 15:51:57,154 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 129 predicate places. [2024-06-14 15:51:57,154 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 137 transitions, 1280 flow [2024-06-14 15:51:57,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:57,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:57,154 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:51:57,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:51:57,154 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:51:57,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash -905071025, now seen corresponding path program 8 times [2024-06-14 15:51:57,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:57,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171289745] [2024-06-14 15:51:57,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:57,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:07,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:52:07,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:07,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171289745] [2024-06-14 15:52:07,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171289745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:07,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:07,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:52:07,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286338104] [2024-06-14 15:52:07,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:07,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:52:07,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:07,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:52:07,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:52:07,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:52:07,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 137 transitions, 1280 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:07,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:07,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:52:07,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:08,184 INFO L124 PetriNetUnfolderBase]: 312/631 cut-off events. [2024-06-14 15:52:08,185 INFO L125 PetriNetUnfolderBase]: For 22667/22667 co-relation queries the response was YES. [2024-06-14 15:52:08,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3592 conditions, 631 events. 312/631 cut-off events. For 22667/22667 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3216 event pairs, 41 based on Foata normal form. 2/629 useless extension candidates. Maximal degree in co-relation 3516. Up to 528 conditions per place. [2024-06-14 15:52:08,189 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 120 selfloop transitions, 24 changer transitions 0/148 dead transitions. [2024-06-14 15:52:08,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 148 transitions, 1616 flow [2024-06-14 15:52:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:52:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:52:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 15:52:08,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-14 15:52:08,191 INFO L175 Difference]: Start difference. First operand has 160 places, 137 transitions, 1280 flow. Second operand 9 states and 118 transitions. [2024-06-14 15:52:08,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 148 transitions, 1616 flow [2024-06-14 15:52:08,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 148 transitions, 1526 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 15:52:08,239 INFO L231 Difference]: Finished difference. Result has 162 places, 138 transitions, 1268 flow [2024-06-14 15:52:08,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1268, PETRI_PLACES=162, PETRI_TRANSITIONS=138} [2024-06-14 15:52:08,239 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2024-06-14 15:52:08,240 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 138 transitions, 1268 flow [2024-06-14 15:52:08,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:08,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:08,240 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:52:08,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:52:08,240 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:52:08,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:08,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1104372815, now seen corresponding path program 9 times [2024-06-14 15:52:08,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:08,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696620062] [2024-06-14 15:52:08,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:08,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:15,422 INFO 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:15,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:15,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696620062] [2024-06-14 15:52:15,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696620062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:15,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:15,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:52:15,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045495021] [2024-06-14 15:52:15,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:15,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:52:15,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:15,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:52:15,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:52:15,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:52:15,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 138 transitions, 1268 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:15,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:15,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:52:15,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:15,796 INFO L124 PetriNetUnfolderBase]: 316/639 cut-off events. [2024-06-14 15:52:15,796 INFO L125 PetriNetUnfolderBase]: For 23523/23523 co-relation queries the response was YES. [2024-06-14 15:52:15,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 639 events. 316/639 cut-off events. For 23523/23523 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3252 event pairs, 43 based on Foata normal form. 2/637 useless extension candidates. Maximal degree in co-relation 3543. Up to 542 conditions per place. [2024-06-14 15:52:15,805 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 124 selfloop transitions, 22 changer transitions 0/150 dead transitions. [2024-06-14 15:52:15,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 150 transitions, 1621 flow [2024-06-14 15:52:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:52:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:52:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 15:52:15,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-14 15:52:15,807 INFO L175 Difference]: Start difference. First operand has 162 places, 138 transitions, 1268 flow. Second operand 9 states and 116 transitions. [2024-06-14 15:52:15,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 150 transitions, 1621 flow [2024-06-14 15:52:15,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 150 transitions, 1551 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 15:52:15,867 INFO L231 Difference]: Finished difference. Result has 165 places, 140 transitions, 1290 flow [2024-06-14 15:52:15,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1200, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1290, PETRI_PLACES=165, PETRI_TRANSITIONS=140} [2024-06-14 15:52:15,868 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 134 predicate places. [2024-06-14 15:52:15,868 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 140 transitions, 1290 flow [2024-06-14 15:52:15,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:15,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:15,882 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:52:15,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:52:15,882 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:52:15,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:15,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1104520685, now seen corresponding path program 10 times [2024-06-14 15:52:15,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:15,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268839321] [2024-06-14 15:52:15,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:15,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:22,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:22,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268839321] [2024-06-14 15:52:22,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268839321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:22,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:22,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:52:22,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083302615] [2024-06-14 15:52:22,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:22,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:52:22,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:22,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:52:22,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:52:22,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:52:22,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 140 transitions, 1290 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:22,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:22,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:52:22,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:22,781 INFO L124 PetriNetUnfolderBase]: 313/634 cut-off events. [2024-06-14 15:52:22,781 INFO L125 PetriNetUnfolderBase]: For 21568/21568 co-relation queries the response was YES. [2024-06-14 15:52:22,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3467 conditions, 634 events. 313/634 cut-off events. For 21568/21568 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3249 event pairs, 40 based on Foata normal form. 2/632 useless extension candidates. Maximal degree in co-relation 3388. Up to 532 conditions per place. [2024-06-14 15:52:22,786 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 126 selfloop transitions, 21 changer transitions 0/151 dead transitions. [2024-06-14 15:52:22,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 151 transitions, 1610 flow [2024-06-14 15:52:22,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:52:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:52:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 15:52:22,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-14 15:52:22,787 INFO L175 Difference]: Start difference. First operand has 165 places, 140 transitions, 1290 flow. Second operand 9 states and 116 transitions. [2024-06-14 15:52:22,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 151 transitions, 1610 flow [2024-06-14 15:52:22,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 151 transitions, 1547 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 15:52:22,833 INFO L231 Difference]: Finished difference. Result has 168 places, 140 transitions, 1273 flow [2024-06-14 15:52:22,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1273, PETRI_PLACES=168, PETRI_TRANSITIONS=140} [2024-06-14 15:52:22,834 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 137 predicate places. [2024-06-14 15:52:22,834 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 140 transitions, 1273 flow [2024-06-14 15:52:22,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:22,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:22,834 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:52:22,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:52:22,834 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:52:22,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:22,835 INFO L85 PathProgramCache]: Analyzing trace with hash 786140815, now seen corresponding path program 3 times [2024-06-14 15:52:22,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:22,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318012750] [2024-06-14 15:52:22,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:22,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:32,436 INFO 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:32,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:32,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318012750] [2024-06-14 15:52:32,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318012750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:32,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:32,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458252468] [2024-06-14 15:52:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:32,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:32,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:32,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:32,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:32,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:52:32,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 140 transitions, 1273 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:32,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:32,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:52:32,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:32,996 INFO L124 PetriNetUnfolderBase]: 316/639 cut-off events. [2024-06-14 15:52:32,996 INFO L125 PetriNetUnfolderBase]: For 20860/20860 co-relation queries the response was YES. [2024-06-14 15:52:32,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3487 conditions, 639 events. 316/639 cut-off events. For 20860/20860 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3283 event pairs, 42 based on Foata normal form. 1/636 useless extension candidates. Maximal degree in co-relation 3407. Up to 467 conditions per place. [2024-06-14 15:52:33,001 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 100 selfloop transitions, 51 changer transitions 0/155 dead transitions. [2024-06-14 15:52:33,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 155 transitions, 1656 flow [2024-06-14 15:52:33,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 15:52:33,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-14 15:52:33,002 INFO L175 Difference]: Start difference. First operand has 168 places, 140 transitions, 1273 flow. Second operand 10 states and 133 transitions. [2024-06-14 15:52:33,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 155 transitions, 1656 flow [2024-06-14 15:52:33,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 155 transitions, 1556 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 15:52:33,045 INFO L231 Difference]: Finished difference. Result has 173 places, 145 transitions, 1385 flow [2024-06-14 15:52:33,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1385, PETRI_PLACES=173, PETRI_TRANSITIONS=145} [2024-06-14 15:52:33,046 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 142 predicate places. [2024-06-14 15:52:33,046 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 145 transitions, 1385 flow [2024-06-14 15:52:33,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:33,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:33,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:33,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:52:33,047 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:52:33,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1616626365, now seen corresponding path program 4 times [2024-06-14 15:52:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:33,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542406799] [2024-06-14 15:52:33,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:33,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:42,045 INFO 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:42,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:42,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542406799] [2024-06-14 15:52:42,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542406799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:42,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:42,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:42,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991078720] [2024-06-14 15:52:42,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:42,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:42,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:42,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:42,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:42,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:52:42,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 145 transitions, 1385 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:42,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:42,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:52:42,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:42,424 INFO L124 PetriNetUnfolderBase]: 314/636 cut-off events. [2024-06-14 15:52:42,425 INFO L125 PetriNetUnfolderBase]: For 20027/20027 co-relation queries the response was YES. [2024-06-14 15:52:42,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3481 conditions, 636 events. 314/636 cut-off events. For 20027/20027 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3249 event pairs, 42 based on Foata normal form. 1/633 useless extension candidates. Maximal degree in co-relation 3397. Up to 464 conditions per place. [2024-06-14 15:52:42,429 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 99 selfloop transitions, 52 changer transitions 0/155 dead transitions. [2024-06-14 15:52:42,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 155 transitions, 1711 flow [2024-06-14 15:52:42,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:42,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-14 15:52:42,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-14 15:52:42,431 INFO L175 Difference]: Start difference. First operand has 173 places, 145 transitions, 1385 flow. Second operand 10 states and 132 transitions. [2024-06-14 15:52:42,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 155 transitions, 1711 flow [2024-06-14 15:52:42,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 155 transitions, 1563 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-14 15:52:42,472 INFO L231 Difference]: Finished difference. Result has 177 places, 145 transitions, 1346 flow [2024-06-14 15:52:42,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1346, PETRI_PLACES=177, PETRI_TRANSITIONS=145} [2024-06-14 15:52:42,472 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 146 predicate places. [2024-06-14 15:52:42,472 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 145 transitions, 1346 flow [2024-06-14 15:52:42,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:42,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:42,473 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:52:42,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:52:42,474 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:52:42,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:42,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1035491485, now seen corresponding path program 5 times [2024-06-14 15:52:42,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:42,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748889570] [2024-06-14 15:52:42,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:42,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:50,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:52:50,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:50,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748889570] [2024-06-14 15:52:50,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748889570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:50,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:50,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:50,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73333804] [2024-06-14 15:52:50,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:50,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:50,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:50,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:50,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:51,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:52:51,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 145 transitions, 1346 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:51,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:51,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:52:51,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:51,373 INFO L124 PetriNetUnfolderBase]: 312/633 cut-off events. [2024-06-14 15:52:51,374 INFO L125 PetriNetUnfolderBase]: For 18905/18905 co-relation queries the response was YES. [2024-06-14 15:52:51,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3319 conditions, 633 events. 312/633 cut-off events. For 18905/18905 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3232 event pairs, 43 based on Foata normal form. 1/633 useless extension candidates. Maximal degree in co-relation 3235. Up to 548 conditions per place. [2024-06-14 15:52:51,379 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 131 selfloop transitions, 20 changer transitions 0/155 dead transitions. [2024-06-14 15:52:51,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 155 transitions, 1672 flow [2024-06-14 15:52:51,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:52:51,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 15:52:51,380 INFO L175 Difference]: Start difference. First operand has 177 places, 145 transitions, 1346 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:52:51,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 155 transitions, 1672 flow [2024-06-14 15:52:51,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 155 transitions, 1514 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-14 15:52:51,424 INFO L231 Difference]: Finished difference. Result has 178 places, 145 transitions, 1233 flow [2024-06-14 15:52:51,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1233, PETRI_PLACES=178, PETRI_TRANSITIONS=145} [2024-06-14 15:52:51,424 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 147 predicate places. [2024-06-14 15:52:51,424 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 145 transitions, 1233 flow [2024-06-14 15:52:51,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:51,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:51,425 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:52:51,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:52:51,425 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:52:51,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:51,425 INFO L85 PathProgramCache]: Analyzing trace with hash -897713423, now seen corresponding path program 6 times [2024-06-14 15:52:51,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:51,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416188027] [2024-06-14 15:52:51,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:51,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:00,249 INFO 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:00,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:00,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416188027] [2024-06-14 15:53:00,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416188027] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:00,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:00,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:00,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215116917] [2024-06-14 15:53:00,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:00,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:00,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:00,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:00,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:00,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:53:00,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 145 transitions, 1233 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:00,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:00,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:53:00,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:00,700 INFO L124 PetriNetUnfolderBase]: 315/636 cut-off events. [2024-06-14 15:53:00,700 INFO L125 PetriNetUnfolderBase]: For 19371/19371 co-relation queries the response was YES. [2024-06-14 15:53:00,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3266 conditions, 636 events. 315/636 cut-off events. For 19371/19371 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3234 event pairs, 42 based on Foata normal form. 1/633 useless extension candidates. Maximal degree in co-relation 3181. Up to 526 conditions per place. [2024-06-14 15:53:00,705 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 121 selfloop transitions, 32 changer transitions 0/157 dead transitions. [2024-06-14 15:53:00,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 157 transitions, 1607 flow [2024-06-14 15:53:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 15:53:00,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:53:00,707 INFO L175 Difference]: Start difference. First operand has 178 places, 145 transitions, 1233 flow. Second operand 10 states and 120 transitions. [2024-06-14 15:53:00,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 157 transitions, 1607 flow [2024-06-14 15:53:00,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 157 transitions, 1560 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:00,753 INFO L231 Difference]: Finished difference. Result has 179 places, 147 transitions, 1303 flow [2024-06-14 15:53:00,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1303, PETRI_PLACES=179, PETRI_TRANSITIONS=147} [2024-06-14 15:53:00,754 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 148 predicate places. [2024-06-14 15:53:00,754 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 147 transitions, 1303 flow [2024-06-14 15:53:00,754 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:00,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:00,754 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:53:00,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:53:00,755 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:53:00,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:00,755 INFO L85 PathProgramCache]: Analyzing trace with hash -959402579, now seen corresponding path program 7 times [2024-06-14 15:53:00,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:00,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405881991] [2024-06-14 15:53:00,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:00,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:09,891 INFO 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:09,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:09,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405881991] [2024-06-14 15:53:09,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405881991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:09,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:09,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:09,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522333124] [2024-06-14 15:53:09,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:09,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:09,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:09,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:09,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:10,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:53:10,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 147 transitions, 1303 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:10,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:10,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:53:10,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:10,469 INFO L124 PetriNetUnfolderBase]: 313/635 cut-off events. [2024-06-14 15:53:10,469 INFO L125 PetriNetUnfolderBase]: For 18547/18547 co-relation queries the response was YES. [2024-06-14 15:53:10,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3228 conditions, 635 events. 313/635 cut-off events. For 18547/18547 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3268 event pairs, 42 based on Foata normal form. 1/632 useless extension candidates. Maximal degree in co-relation 3142. Up to 523 conditions per place. [2024-06-14 15:53:10,474 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 122 selfloop transitions, 31 changer transitions 0/157 dead transitions. [2024-06-14 15:53:10,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 157 transitions, 1633 flow [2024-06-14 15:53:10,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-14 15:53:10,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-14 15:53:10,475 INFO L175 Difference]: Start difference. First operand has 179 places, 147 transitions, 1303 flow. Second operand 10 states and 131 transitions. [2024-06-14 15:53:10,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 157 transitions, 1633 flow [2024-06-14 15:53:10,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 157 transitions, 1486 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-14 15:53:10,527 INFO L231 Difference]: Finished difference. Result has 181 places, 147 transitions, 1223 flow [2024-06-14 15:53:10,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1223, PETRI_PLACES=181, PETRI_TRANSITIONS=147} [2024-06-14 15:53:10,527 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 150 predicate places. [2024-06-14 15:53:10,528 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 147 transitions, 1223 flow [2024-06-14 15:53:10,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:10,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:10,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:10,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:53:10,528 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:53:10,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1428585979, now seen corresponding path program 1 times [2024-06-14 15:53:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:10,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606742123] [2024-06-14 15:53:10,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:10,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:16,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:53:16,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606742123] [2024-06-14 15:53:16,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606742123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:16,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:16,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:16,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527202800] [2024-06-14 15:53:16,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:16,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:16,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:16,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:16,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:16,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:53:16,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 147 transitions, 1223 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:16,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:16,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:53:16,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:16,708 INFO L124 PetriNetUnfolderBase]: 325/665 cut-off events. [2024-06-14 15:53:16,708 INFO L125 PetriNetUnfolderBase]: For 29208/29208 co-relation queries the response was YES. [2024-06-14 15:53:16,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3287 conditions, 665 events. 325/665 cut-off events. For 29208/29208 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3429 event pairs, 35 based on Foata normal form. 8/672 useless extension candidates. Maximal degree in co-relation 3200. Up to 518 conditions per place. [2024-06-14 15:53:16,713 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 138 selfloop transitions, 9 changer transitions 18/169 dead transitions. [2024-06-14 15:53:16,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 169 transitions, 1637 flow [2024-06-14 15:53:16,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-14 15:53:16,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-14 15:53:16,714 INFO L175 Difference]: Start difference. First operand has 181 places, 147 transitions, 1223 flow. Second operand 10 states and 131 transitions. [2024-06-14 15:53:16,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 169 transitions, 1637 flow [2024-06-14 15:53:16,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 169 transitions, 1541 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 15:53:16,760 INFO L231 Difference]: Finished difference. Result has 181 places, 143 transitions, 1129 flow [2024-06-14 15:53:16,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1129, PETRI_PLACES=181, PETRI_TRANSITIONS=143} [2024-06-14 15:53:16,761 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 150 predicate places. [2024-06-14 15:53:16,761 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 143 transitions, 1129 flow [2024-06-14 15:53:16,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:16,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:16,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:16,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:53:16,762 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:53:16,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:16,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1342087459, now seen corresponding path program 2 times [2024-06-14 15:53:16,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:16,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766695577] [2024-06-14 15:53:16,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:16,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:23,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:23,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766695577] [2024-06-14 15:53:23,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766695577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:23,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:23,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:23,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840226187] [2024-06-14 15:53:23,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:23,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:23,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:23,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:23,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:23,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:53:23,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 143 transitions, 1129 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:23,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:23,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:53:23,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:23,985 INFO L124 PetriNetUnfolderBase]: 305/627 cut-off events. [2024-06-14 15:53:23,986 INFO L125 PetriNetUnfolderBase]: For 30055/30055 co-relation queries the response was YES. [2024-06-14 15:53:23,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 627 events. 305/627 cut-off events. For 30055/30055 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3227 event pairs, 33 based on Foata normal form. 8/634 useless extension candidates. Maximal degree in co-relation 3039. Up to 497 conditions per place. [2024-06-14 15:53:23,990 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 135 selfloop transitions, 10 changer transitions 12/161 dead transitions. [2024-06-14 15:53:23,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 161 transitions, 1515 flow [2024-06-14 15:53:23,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:23,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:23,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:53:23,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 15:53:23,991 INFO L175 Difference]: Start difference. First operand has 181 places, 143 transitions, 1129 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:53:23,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 161 transitions, 1515 flow [2024-06-14 15:53:24,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 161 transitions, 1489 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:24,039 INFO L231 Difference]: Finished difference. Result has 175 places, 140 transitions, 1112 flow [2024-06-14 15:53:24,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1112, PETRI_PLACES=175, PETRI_TRANSITIONS=140} [2024-06-14 15:53:24,039 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 144 predicate places. [2024-06-14 15:53:24,039 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 140 transitions, 1112 flow [2024-06-14 15:53:24,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:24,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:24,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:24,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:53:24,040 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:53:24,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:24,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1349942621, now seen corresponding path program 3 times [2024-06-14 15:53:24,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:24,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047087879] [2024-06-14 15:53:24,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:24,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:29,953 INFO 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:29,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:29,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047087879] [2024-06-14 15:53:29,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047087879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:29,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:29,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980254797] [2024-06-14 15:53:29,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:29,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:29,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:29,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:29,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:30,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:53:30,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 140 transitions, 1112 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:30,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:30,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:53:30,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:30,392 INFO L124 PetriNetUnfolderBase]: 324/672 cut-off events. [2024-06-14 15:53:30,393 INFO L125 PetriNetUnfolderBase]: For 42174/42174 co-relation queries the response was YES. [2024-06-14 15:53:30,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3888 conditions, 672 events. 324/672 cut-off events. For 42174/42174 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3505 event pairs, 42 based on Foata normal form. 8/679 useless extension candidates. Maximal degree in co-relation 3803. Up to 472 conditions per place. [2024-06-14 15:53:30,397 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 140 selfloop transitions, 12 changer transitions 7/163 dead transitions. [2024-06-14 15:53:30,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 163 transitions, 1692 flow [2024-06-14 15:53:30,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 15:53:30,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-14 15:53:30,399 INFO L175 Difference]: Start difference. First operand has 175 places, 140 transitions, 1112 flow. Second operand 10 states and 133 transitions. [2024-06-14 15:53:30,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 163 transitions, 1692 flow [2024-06-14 15:53:30,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 163 transitions, 1660 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:30,472 INFO L231 Difference]: Finished difference. Result has 171 places, 138 transitions, 1103 flow [2024-06-14 15:53:30,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1103, PETRI_PLACES=171, PETRI_TRANSITIONS=138} [2024-06-14 15:53:30,473 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 140 predicate places. [2024-06-14 15:53:30,473 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 138 transitions, 1103 flow [2024-06-14 15:53:30,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:30,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:30,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:30,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:53:30,474 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:53:30,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:30,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1341967489, now seen corresponding path program 4 times [2024-06-14 15:53:30,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:30,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568369661] [2024-06-14 15:53:30,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:30,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:36,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:36,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568369661] [2024-06-14 15:53:36,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568369661] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:36,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:36,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643534700] [2024-06-14 15:53:36,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:36,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:36,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:36,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:36,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:36,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:53:36,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 138 transitions, 1103 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:36,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:36,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:53:36,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:36,594 INFO L124 PetriNetUnfolderBase]: 293/611 cut-off events. [2024-06-14 15:53:36,595 INFO L125 PetriNetUnfolderBase]: For 28848/28848 co-relation queries the response was YES. [2024-06-14 15:53:36,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3076 conditions, 611 events. 293/611 cut-off events. For 28848/28848 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3112 event pairs, 33 based on Foata normal form. 10/620 useless extension candidates. Maximal degree in co-relation 2993. Up to 472 conditions per place. [2024-06-14 15:53:36,599 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 125 selfloop transitions, 6 changer transitions 21/156 dead transitions. [2024-06-14 15:53:36,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 156 transitions, 1519 flow [2024-06-14 15:53:36,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:53:36,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 15:53:36,601 INFO L175 Difference]: Start difference. First operand has 171 places, 138 transitions, 1103 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:53:36,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 156 transitions, 1519 flow [2024-06-14 15:53:36,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 156 transitions, 1493 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:36,655 INFO L231 Difference]: Finished difference. Result has 170 places, 131 transitions, 1048 flow [2024-06-14 15:53:36,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1048, PETRI_PLACES=170, PETRI_TRANSITIONS=131} [2024-06-14 15:53:36,656 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 139 predicate places. [2024-06-14 15:53:36,656 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 131 transitions, 1048 flow [2024-06-14 15:53:36,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:36,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:36,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:36,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:53:36,657 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:53:36,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:36,657 INFO L85 PathProgramCache]: Analyzing trace with hash 976024187, now seen corresponding path program 5 times [2024-06-14 15:53:36,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:36,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613396516] [2024-06-14 15:53:36,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:36,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:43,802 INFO 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:43,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:43,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613396516] [2024-06-14 15:53:43,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613396516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:43,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:43,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:43,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187193958] [2024-06-14 15:53:43,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:43,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:43,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:43,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:43,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:43,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:53:43,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 131 transitions, 1048 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:43,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:43,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:53:43,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:44,274 INFO L124 PetriNetUnfolderBase]: 276/576 cut-off events. [2024-06-14 15:53:44,274 INFO L125 PetriNetUnfolderBase]: For 27815/27821 co-relation queries the response was YES. [2024-06-14 15:53:44,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2906 conditions, 576 events. 276/576 cut-off events. For 27815/27821 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2896 event pairs, 33 based on Foata normal form. 14/589 useless extension candidates. Maximal degree in co-relation 2824. Up to 410 conditions per place. [2024-06-14 15:53:44,278 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 104 selfloop transitions, 31 changer transitions 6/145 dead transitions. [2024-06-14 15:53:44,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 145 transitions, 1416 flow [2024-06-14 15:53:44,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-14 15:53:44,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:53:44,280 INFO L175 Difference]: Start difference. First operand has 170 places, 131 transitions, 1048 flow. Second operand 10 states and 130 transitions. [2024-06-14 15:53:44,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 145 transitions, 1416 flow [2024-06-14 15:53:44,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 145 transitions, 1374 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:44,318 INFO L231 Difference]: Finished difference. Result has 161 places, 129 transitions, 1080 flow [2024-06-14 15:53:44,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1080, PETRI_PLACES=161, PETRI_TRANSITIONS=129} [2024-06-14 15:53:44,319 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 130 predicate places. [2024-06-14 15:53:44,319 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 129 transitions, 1080 flow [2024-06-14 15:53:44,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:44,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:44,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:44,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:53:44,320 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:53:44,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:44,320 INFO L85 PathProgramCache]: Analyzing trace with hash 984602011, now seen corresponding path program 1 times [2024-06-14 15:53:44,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:44,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601772350] [2024-06-14 15:53:44,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:44,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:53,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:53,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601772350] [2024-06-14 15:53:53,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601772350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:53,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:53,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:53,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596518137] [2024-06-14 15:53:53,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:53,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:53,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:53,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:53,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:53,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:53:53,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 129 transitions, 1080 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:53,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:53,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:53:53,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:54,157 INFO L124 PetriNetUnfolderBase]: 296/622 cut-off events. [2024-06-14 15:53:54,157 INFO L125 PetriNetUnfolderBase]: For 29647/29653 co-relation queries the response was YES. [2024-06-14 15:53:54,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 622 events. 296/622 cut-off events. For 29647/29653 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3225 event pairs, 52 based on Foata normal form. 10/631 useless extension candidates. Maximal degree in co-relation 3434. Up to 362 conditions per place. [2024-06-14 15:53:54,161 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 109 selfloop transitions, 27 changer transitions 7/147 dead transitions. [2024-06-14 15:53:54,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 147 transitions, 1566 flow [2024-06-14 15:53:54,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:53:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:53:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 15:53:54,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-14 15:53:54,163 INFO L175 Difference]: Start difference. First operand has 161 places, 129 transitions, 1080 flow. Second operand 10 states and 122 transitions. [2024-06-14 15:53:54,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 147 transitions, 1566 flow [2024-06-14 15:53:54,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 147 transitions, 1482 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-14 15:53:54,198 INFO L231 Difference]: Finished difference. Result has 161 places, 126 transitions, 1025 flow [2024-06-14 15:53:54,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1025, PETRI_PLACES=161, PETRI_TRANSITIONS=126} [2024-06-14 15:53:54,199 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 130 predicate places. [2024-06-14 15:53:54,199 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 126 transitions, 1025 flow [2024-06-14 15:53:54,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:54,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:54,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:54,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:53:54,200 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:53:54,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1670376355, now seen corresponding path program 6 times [2024-06-14 15:53:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:54,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530610819] [2024-06-14 15:53:54,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:54,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:00,926 INFO 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:00,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:00,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530610819] [2024-06-14 15:54:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530610819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:00,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:00,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:00,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354413995] [2024-06-14 15:54:00,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:00,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:00,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:00,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:00,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:01,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:54:01,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 126 transitions, 1025 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:01,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:01,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:54:01,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:01,362 INFO L124 PetriNetUnfolderBase]: 274/568 cut-off events. [2024-06-14 15:54:01,362 INFO L125 PetriNetUnfolderBase]: For 26165/26171 co-relation queries the response was YES. [2024-06-14 15:54:01,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3288 conditions, 568 events. 274/568 cut-off events. For 26165/26171 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2849 event pairs, 48 based on Foata normal form. 6/573 useless extension candidates. Maximal degree in co-relation 3210. Up to 451 conditions per place. [2024-06-14 15:54:01,366 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 108 selfloop transitions, 25 changer transitions 0/137 dead transitions. [2024-06-14 15:54:01,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 137 transitions, 1331 flow [2024-06-14 15:54:01,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:54:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:54:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:54:01,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:54:01,367 INFO L175 Difference]: Start difference. First operand has 161 places, 126 transitions, 1025 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:54:01,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 137 transitions, 1331 flow [2024-06-14 15:54:01,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 137 transitions, 1280 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:54:01,411 INFO L231 Difference]: Finished difference. Result has 159 places, 127 transitions, 1048 flow [2024-06-14 15:54:01,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1048, PETRI_PLACES=159, PETRI_TRANSITIONS=127} [2024-06-14 15:54:01,411 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 128 predicate places. [2024-06-14 15:54:01,411 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 127 transitions, 1048 flow [2024-06-14 15:54:01,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:01,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:01,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:01,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:54:01,412 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:54:01,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash 475784925, now seen corresponding path program 7 times [2024-06-14 15:54:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:01,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957753278] [2024-06-14 15:54:01,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:01,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:07,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:07,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957753278] [2024-06-14 15:54:07,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957753278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:07,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:07,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:07,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491879479] [2024-06-14 15:54:07,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:07,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:07,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:07,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:08,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:54:08,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 127 transitions, 1048 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:08,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:08,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:54:08,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:08,374 INFO L124 PetriNetUnfolderBase]: 279/583 cut-off events. [2024-06-14 15:54:08,374 INFO L125 PetriNetUnfolderBase]: For 29378/29384 co-relation queries the response was YES. [2024-06-14 15:54:08,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3239 conditions, 583 events. 279/583 cut-off events. For 29378/29384 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2950 event pairs, 49 based on Foata normal form. 12/594 useless extension candidates. Maximal degree in co-relation 3162. Up to 464 conditions per place. [2024-06-14 15:54:08,378 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 112 selfloop transitions, 15 changer transitions 9/140 dead transitions. [2024-06-14 15:54:08,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 140 transitions, 1380 flow [2024-06-14 15:54:08,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:54:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:54:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-14 15:54:08,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-14 15:54:08,379 INFO L175 Difference]: Start difference. First operand has 159 places, 127 transitions, 1048 flow. Second operand 10 states and 113 transitions. [2024-06-14 15:54:08,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 140 transitions, 1380 flow [2024-06-14 15:54:08,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 140 transitions, 1316 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 15:54:08,416 INFO L231 Difference]: Finished difference. Result has 161 places, 124 transitions, 986 flow [2024-06-14 15:54:08,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=986, PETRI_PLACES=161, PETRI_TRANSITIONS=124} [2024-06-14 15:54:08,416 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 130 predicate places. [2024-06-14 15:54:08,417 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 124 transitions, 986 flow [2024-06-14 15:54:08,417 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:08,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:08,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:08,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:54:08,417 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:54:08,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:08,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1664113301, now seen corresponding path program 2 times [2024-06-14 15:54:08,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:08,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095536607] [2024-06-14 15:54:08,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:08,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095536607] [2024-06-14 15:54:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095536607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:16,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:16,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716114525] [2024-06-14 15:54:16,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:16,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:16,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:16,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:16,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:16,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:54:16,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 124 transitions, 986 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:16,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:54:16,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:17,326 INFO L124 PetriNetUnfolderBase]: 274/576 cut-off events. [2024-06-14 15:54:17,327 INFO L125 PetriNetUnfolderBase]: For 30967/30973 co-relation queries the response was YES. [2024-06-14 15:54:17,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3160 conditions, 576 events. 274/576 cut-off events. For 30967/30973 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2945 event pairs, 49 based on Foata normal form. 12/587 useless extension candidates. Maximal degree in co-relation 3082. Up to 435 conditions per place. [2024-06-14 15:54:17,330 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 103 selfloop transitions, 22 changer transitions 9/138 dead transitions. [2024-06-14 15:54:17,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 138 transitions, 1316 flow [2024-06-14 15:54:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:54:17,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 15:54:17,332 INFO L175 Difference]: Start difference. First operand has 161 places, 124 transitions, 986 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:54:17,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 138 transitions, 1316 flow [2024-06-14 15:54:17,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 138 transitions, 1284 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 15:54:17,371 INFO L231 Difference]: Finished difference. Result has 162 places, 121 transitions, 979 flow [2024-06-14 15:54:17,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=979, PETRI_PLACES=162, PETRI_TRANSITIONS=121} [2024-06-14 15:54:17,371 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2024-06-14 15:54:17,371 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 121 transitions, 979 flow [2024-06-14 15:54:17,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:17,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:17,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:17,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:54:17,372 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:54:17,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:17,372 INFO L85 PathProgramCache]: Analyzing trace with hash 475607295, now seen corresponding path program 8 times [2024-06-14 15:54:17,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:17,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508193755] [2024-06-14 15:54:17,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:17,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:24,789 INFO 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,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:24,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508193755] [2024-06-14 15:54:24,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508193755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:24,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:24,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2961604] [2024-06-14 15:54:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:24,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:24,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:24,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:24,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:24,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:54:24,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 121 transitions, 979 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:24,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:24,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:54:24,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:25,254 INFO L124 PetriNetUnfolderBase]: 269/569 cut-off events. [2024-06-14 15:54:25,255 INFO L125 PetriNetUnfolderBase]: For 30333/30339 co-relation queries the response was YES. [2024-06-14 15:54:25,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 569 events. 269/569 cut-off events. For 30333/30339 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2875 event pairs, 45 based on Foata normal form. 12/580 useless extension candidates. Maximal degree in co-relation 3058. Up to 445 conditions per place. [2024-06-14 15:54:25,258 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 107 selfloop transitions, 11 changer transitions 13/135 dead transitions. [2024-06-14 15:54:25,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 135 transitions, 1303 flow [2024-06-14 15:54:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:54:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:54:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 15:54:25,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 15:54:25,259 INFO L175 Difference]: Start difference. First operand has 162 places, 121 transitions, 979 flow. Second operand 10 states and 123 transitions. [2024-06-14 15:54:25,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 135 transitions, 1303 flow [2024-06-14 15:54:25,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 135 transitions, 1255 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:54:25,297 INFO L231 Difference]: Finished difference. Result has 159 places, 116 transitions, 896 flow [2024-06-14 15:54:25,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=896, PETRI_PLACES=159, PETRI_TRANSITIONS=116} [2024-06-14 15:54:25,297 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 128 predicate places. [2024-06-14 15:54:25,297 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 116 transitions, 896 flow [2024-06-14 15:54:25,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:25,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:25,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:25,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:54:25,298 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:54:25,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:25,298 INFO L85 PathProgramCache]: Analyzing trace with hash 641841075, now seen corresponding path program 9 times [2024-06-14 15:54:25,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:25,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416494484] [2024-06-14 15:54:25,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:25,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:32,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:32,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416494484] [2024-06-14 15:54:32,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416494484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:32,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:32,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:32,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102247648] [2024-06-14 15:54:32,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:32,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:32,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:32,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:32,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:32,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:54:32,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 116 transitions, 896 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:32,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:32,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:54:32,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:33,045 INFO L124 PetriNetUnfolderBase]: 251/531 cut-off events. [2024-06-14 15:54:33,045 INFO L125 PetriNetUnfolderBase]: For 23359/23359 co-relation queries the response was YES. [2024-06-14 15:54:33,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2935 conditions, 531 events. 251/531 cut-off events. For 23359/23359 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2645 event pairs, 39 based on Foata normal form. 2/532 useless extension candidates. Maximal degree in co-relation 2858. Up to 402 conditions per place. [2024-06-14 15:54:33,049 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 101 selfloop transitions, 23 changer transitions 0/128 dead transitions. [2024-06-14 15:54:33,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 128 transitions, 1188 flow [2024-06-14 15:54:33,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:54:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:54:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:54:33,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 15:54:33,050 INFO L175 Difference]: Start difference. First operand has 159 places, 116 transitions, 896 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:54:33,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 128 transitions, 1188 flow [2024-06-14 15:54:33,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 128 transitions, 1158 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:54:33,088 INFO L231 Difference]: Finished difference. Result has 155 places, 117 transitions, 938 flow [2024-06-14 15:54:33,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=938, PETRI_PLACES=155, PETRI_TRANSITIONS=117} [2024-06-14 15:54:33,089 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 124 predicate places. [2024-06-14 15:54:33,089 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 117 transitions, 938 flow [2024-06-14 15:54:33,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:33,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:33,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:33,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:54:33,090 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:54:33,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:33,090 INFO L85 PathProgramCache]: Analyzing trace with hash 83487561, now seen corresponding path program 3 times [2024-06-14 15:54:33,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:33,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611384639] [2024-06-14 15:54:33,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:33,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:41,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:41,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611384639] [2024-06-14 15:54:41,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611384639] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:41,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:41,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461679757] [2024-06-14 15:54:41,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:41,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:41,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:41,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:41,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:54:41,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 117 transitions, 938 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:41,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:41,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:54:41,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:41,747 INFO L124 PetriNetUnfolderBase]: 256/546 cut-off events. [2024-06-14 15:54:41,747 INFO L125 PetriNetUnfolderBase]: For 26159/26159 co-relation queries the response was YES. [2024-06-14 15:54:41,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2897 conditions, 546 events. 256/546 cut-off events. For 26159/26159 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2746 event pairs, 50 based on Foata normal form. 8/553 useless extension candidates. Maximal degree in co-relation 2822. Up to 401 conditions per place. [2024-06-14 15:54:41,751 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 99 selfloop transitions, 15 changer transitions 13/131 dead transitions. [2024-06-14 15:54:41,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 131 transitions, 1254 flow [2024-06-14 15:54:41,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-14 15:54:41,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-14 15:54:41,752 INFO L175 Difference]: Start difference. First operand has 155 places, 117 transitions, 938 flow. Second operand 11 states and 137 transitions. [2024-06-14 15:54:41,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 131 transitions, 1254 flow [2024-06-14 15:54:41,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 131 transitions, 1192 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:54:41,784 INFO L231 Difference]: Finished difference. Result has 158 places, 111 transitions, 868 flow [2024-06-14 15:54:41,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=868, PETRI_PLACES=158, PETRI_TRANSITIONS=111} [2024-06-14 15:54:41,785 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2024-06-14 15:54:41,785 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 111 transitions, 868 flow [2024-06-14 15:54:41,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:41,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:41,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:41,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 15:54:41,786 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:54:41,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:41,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2070086999, now seen corresponding path program 10 times [2024-06-14 15:54:41,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:41,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036852550] [2024-06-14 15:54:41,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:41,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:49,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:49,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036852550] [2024-06-14 15:54:49,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036852550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:49,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:49,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:49,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839543948] [2024-06-14 15:54:49,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:49,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:49,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:49,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:50,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:54:50,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 111 transitions, 868 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:50,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:50,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:54:50,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:50,340 INFO L124 PetriNetUnfolderBase]: 236/506 cut-off events. [2024-06-14 15:54:50,340 INFO L125 PetriNetUnfolderBase]: For 21200/21200 co-relation queries the response was YES. [2024-06-14 15:54:50,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2712 conditions, 506 events. 236/506 cut-off events. For 21200/21200 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2467 event pairs, 40 based on Foata normal form. 2/507 useless extension candidates. Maximal degree in co-relation 2636. Up to 404 conditions per place. [2024-06-14 15:54:50,344 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 106 selfloop transitions, 14 changer transitions 0/124 dead transitions. [2024-06-14 15:54:50,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 124 transitions, 1156 flow [2024-06-14 15:54:50,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:54:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:54:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 15:54:50,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-14 15:54:50,345 INFO L175 Difference]: Start difference. First operand has 158 places, 111 transitions, 868 flow. Second operand 10 states and 121 transitions. [2024-06-14 15:54:50,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 124 transitions, 1156 flow [2024-06-14 15:54:50,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 124 transitions, 1112 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-06-14 15:54:50,381 INFO L231 Difference]: Finished difference. Result has 151 places, 112 transitions, 880 flow [2024-06-14 15:54:50,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=880, PETRI_PLACES=151, PETRI_TRANSITIONS=112} [2024-06-14 15:54:50,383 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-14 15:54:50,384 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 112 transitions, 880 flow [2024-06-14 15:54:50,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:50,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:50,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:50,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 15:54:50,384 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:54:50,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:50,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1399444643, now seen corresponding path program 11 times [2024-06-14 15:54:50,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:50,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307226035] [2024-06-14 15:54:50,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:50,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:57,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307226035] [2024-06-14 15:54:57,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307226035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:57,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:57,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:57,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708751025] [2024-06-14 15:54:57,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:57,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:57,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:57,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:57,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:58,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:54:58,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 112 transitions, 880 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:58,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:58,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:54:58,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:58,334 INFO L124 PetriNetUnfolderBase]: 240/512 cut-off events. [2024-06-14 15:54:58,334 INFO L125 PetriNetUnfolderBase]: For 18900/18900 co-relation queries the response was YES. [2024-06-14 15:54:58,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2709 conditions, 512 events. 240/512 cut-off events. For 18900/18900 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2492 event pairs, 47 based on Foata normal form. 2/511 useless extension candidates. Maximal degree in co-relation 2636. Up to 354 conditions per place. [2024-06-14 15:54:58,338 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 78 selfloop transitions, 39 changer transitions 0/121 dead transitions. [2024-06-14 15:54:58,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 121 transitions, 1152 flow [2024-06-14 15:54:58,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:54:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:54:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 15:54:58,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:54:58,339 INFO L175 Difference]: Start difference. First operand has 151 places, 112 transitions, 880 flow. Second operand 10 states and 128 transitions. [2024-06-14 15:54:58,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 121 transitions, 1152 flow [2024-06-14 15:54:58,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 121 transitions, 1108 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:54:58,375 INFO L231 Difference]: Finished difference. Result has 153 places, 113 transitions, 942 flow [2024-06-14 15:54:58,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=942, PETRI_PLACES=153, PETRI_TRANSITIONS=113} [2024-06-14 15:54:58,376 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2024-06-14 15:54:58,376 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 113 transitions, 942 flow [2024-06-14 15:54:58,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:58,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:58,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:58,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 15:54:58,377 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:54:58,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:58,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1807295599, now seen corresponding path program 4 times [2024-06-14 15:54:58,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:58,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736079213] [2024-06-14 15:54:58,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:58,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:04,796 INFO 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:04,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:04,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736079213] [2024-06-14 15:55:04,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736079213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:04,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:04,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:55:04,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855992033] [2024-06-14 15:55:04,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:04,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:55:04,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:04,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:55:04,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:55:05,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:55:05,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 113 transitions, 942 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:05,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:05,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:55:05,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:05,374 INFO L124 PetriNetUnfolderBase]: 270/580 cut-off events. [2024-06-14 15:55:05,375 INFO L125 PetriNetUnfolderBase]: For 32079/32079 co-relation queries the response was YES. [2024-06-14 15:55:05,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 580 events. 270/580 cut-off events. For 32079/32079 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2983 event pairs, 59 based on Foata normal form. 6/583 useless extension candidates. Maximal degree in co-relation 3301. Up to 326 conditions per place. [2024-06-14 15:55:05,379 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 76 selfloop transitions, 43 changer transitions 6/129 dead transitions. [2024-06-14 15:55:05,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 129 transitions, 1364 flow [2024-06-14 15:55:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:55:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:55:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:55:05,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119318181818182 [2024-06-14 15:55:05,380 INFO L175 Difference]: Start difference. First operand has 153 places, 113 transitions, 942 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:55:05,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 129 transitions, 1364 flow [2024-06-14 15:55:05,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 129 transitions, 1268 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:55:05,424 INFO L231 Difference]: Finished difference. Result has 156 places, 111 transitions, 923 flow [2024-06-14 15:55:05,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=923, PETRI_PLACES=156, PETRI_TRANSITIONS=111} [2024-06-14 15:55:05,425 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-14 15:55:05,425 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 111 transitions, 923 flow [2024-06-14 15:55:05,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:05,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:05,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:05,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 15:55:05,425 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:55:05,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:05,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1399437699, now seen corresponding path program 5 times [2024-06-14 15:55:05,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:05,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922697961] [2024-06-14 15:55:05,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:05,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:13,127 INFO 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:13,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:13,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922697961] [2024-06-14 15:55:13,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922697961] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:13,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:13,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:55:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965444534] [2024-06-14 15:55:13,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:13,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:55:13,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:13,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:55:13,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:55:13,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:55:13,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 111 transitions, 923 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:13,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:13,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:55:13,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:13,738 INFO L124 PetriNetUnfolderBase]: 268/574 cut-off events. [2024-06-14 15:55:13,738 INFO L125 PetriNetUnfolderBase]: For 35517/35517 co-relation queries the response was YES. [2024-06-14 15:55:13,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3374 conditions, 574 events. 268/574 cut-off events. For 35517/35517 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2944 event pairs, 63 based on Foata normal form. 8/579 useless extension candidates. Maximal degree in co-relation 3299. Up to 351 conditions per place. [2024-06-14 15:55:13,742 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 62 selfloop transitions, 48 changer transitions 9/123 dead transitions. [2024-06-14 15:55:13,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 123 transitions, 1215 flow [2024-06-14 15:55:13,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:55:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:55:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:55:13,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119318181818182 [2024-06-14 15:55:13,743 INFO L175 Difference]: Start difference. First operand has 156 places, 111 transitions, 923 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:55:13,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 123 transitions, 1215 flow [2024-06-14 15:55:13,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 123 transitions, 1135 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:55:13,787 INFO L231 Difference]: Finished difference. Result has 155 places, 108 transitions, 918 flow [2024-06-14 15:55:13,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=918, PETRI_PLACES=155, PETRI_TRANSITIONS=108} [2024-06-14 15:55:13,788 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 124 predicate places. [2024-06-14 15:55:13,788 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 108 transitions, 918 flow [2024-06-14 15:55:13,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:13,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:13,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:13,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 15:55:13,789 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:55:13,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1399207059, now seen corresponding path program 6 times [2024-06-14 15:55:13,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:13,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939156778] [2024-06-14 15:55:13,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:13,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:19,767 INFO 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:19,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:19,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939156778] [2024-06-14 15:55:19,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939156778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:19,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:19,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:55:19,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376483263] [2024-06-14 15:55:19,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:19,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:55:19,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:19,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:55:19,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:55:20,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:55:20,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 108 transitions, 918 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:20,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:20,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:55:20,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:20,382 INFO L124 PetriNetUnfolderBase]: 263/567 cut-off events. [2024-06-14 15:55:20,382 INFO L125 PetriNetUnfolderBase]: For 34081/34081 co-relation queries the response was YES. [2024-06-14 15:55:20,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3338 conditions, 567 events. 263/567 cut-off events. For 34081/34081 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2897 event pairs, 63 based on Foata normal form. 8/572 useless extension candidates. Maximal degree in co-relation 3265. Up to 376 conditions per place. [2024-06-14 15:55:20,386 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 69 selfloop transitions, 37 changer transitions 10/120 dead transitions. [2024-06-14 15:55:20,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 120 transitions, 1204 flow [2024-06-14 15:55:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:55:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:55:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-14 15:55:20,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2024-06-14 15:55:20,387 INFO L175 Difference]: Start difference. First operand has 155 places, 108 transitions, 918 flow. Second operand 11 states and 142 transitions. [2024-06-14 15:55:20,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 120 transitions, 1204 flow [2024-06-14 15:55:20,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 120 transitions, 1104 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:55:20,429 INFO L231 Difference]: Finished difference. Result has 153 places, 104 transitions, 866 flow [2024-06-14 15:55:20,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=866, PETRI_PLACES=153, PETRI_TRANSITIONS=104} [2024-06-14 15:55:20,429 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2024-06-14 15:55:20,429 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 104 transitions, 866 flow [2024-06-14 15:55:20,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:20,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:20,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:20,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 15:55:20,430 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:55:20,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:20,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1627345793, now seen corresponding path program 12 times [2024-06-14 15:55:20,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:20,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332324165] [2024-06-14 15:55:20,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:20,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:29,422 INFO 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:29,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:29,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332324165] [2024-06-14 15:55:29,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332324165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:29,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:29,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:55:29,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253040437] [2024-06-14 15:55:29,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:29,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:55:29,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:29,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:55:29,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:55:29,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:55:29,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 104 transitions, 866 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:29,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:29,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:55:29,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:29,813 INFO L124 PetriNetUnfolderBase]: 249/535 cut-off events. [2024-06-14 15:55:29,813 INFO L125 PetriNetUnfolderBase]: For 26770/26770 co-relation queries the response was YES. [2024-06-14 15:55:29,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3189 conditions, 535 events. 249/535 cut-off events. For 26770/26770 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2658 event pairs, 61 based on Foata normal form. 2/534 useless extension candidates. Maximal degree in co-relation 3117. Up to 381 conditions per place. [2024-06-14 15:55:29,817 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 71 selfloop transitions, 38 changer transitions 0/113 dead transitions. [2024-06-14 15:55:29,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 113 transitions, 1124 flow [2024-06-14 15:55:29,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:55:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:55:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:55:29,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 15:55:29,818 INFO L175 Difference]: Start difference. First operand has 153 places, 104 transitions, 866 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:55:29,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 113 transitions, 1124 flow [2024-06-14 15:55:29,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 113 transitions, 1039 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-14 15:55:29,854 INFO L231 Difference]: Finished difference. Result has 148 places, 105 transitions, 887 flow [2024-06-14 15:55:29,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=887, PETRI_PLACES=148, PETRI_TRANSITIONS=105} [2024-06-14 15:55:29,855 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-14 15:55:29,855 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 105 transitions, 887 flow [2024-06-14 15:55:29,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:29,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:29,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:29,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 15:55:29,856 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:55:29,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:29,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1627523423, now seen corresponding path program 13 times [2024-06-14 15:55:29,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:29,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612023235] [2024-06-14 15:55:29,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:29,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:36,397 INFO 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:36,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:36,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612023235] [2024-06-14 15:55:36,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612023235] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:36,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:36,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:55:36,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780424165] [2024-06-14 15:55:36,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:36,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:55:36,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:36,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:55:36,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:55:36,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:55:36,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 105 transitions, 887 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:36,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:36,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:55:36,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:36,894 INFO L124 PetriNetUnfolderBase]: 282/602 cut-off events. [2024-06-14 15:55:36,894 INFO L125 PetriNetUnfolderBase]: For 35887/35887 co-relation queries the response was YES. [2024-06-14 15:55:36,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3934 conditions, 602 events. 282/602 cut-off events. For 35887/35887 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3103 event pairs, 72 based on Foata normal form. 2/601 useless extension candidates. Maximal degree in co-relation 3863. Up to 337 conditions per place. [2024-06-14 15:55:36,899 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 63 selfloop transitions, 53 changer transitions 0/120 dead transitions. [2024-06-14 15:55:36,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 120 transitions, 1313 flow [2024-06-14 15:55:36,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:55:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:55:36,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-14 15:55:36,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-14 15:55:36,900 INFO L175 Difference]: Start difference. First operand has 148 places, 105 transitions, 887 flow. Second operand 10 states and 136 transitions. [2024-06-14 15:55:36,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 120 transitions, 1313 flow [2024-06-14 15:55:36,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 120 transitions, 1217 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:55:36,942 INFO L231 Difference]: Finished difference. Result has 150 places, 107 transitions, 955 flow [2024-06-14 15:55:36,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=955, PETRI_PLACES=150, PETRI_TRANSITIONS=107} [2024-06-14 15:55:36,943 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 119 predicate places. [2024-06-14 15:55:36,943 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 107 transitions, 955 flow [2024-06-14 15:55:36,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:55:36,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:36,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:36,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 15:55:36,943 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:55:36,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:36,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1627338849, now seen corresponding path program 7 times [2024-06-14 15:55:36,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:36,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696466144] [2024-06-14 15:55:36,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:36,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:44,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:44,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696466144] [2024-06-14 15:55:44,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696466144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:44,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:44,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:55:44,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561955572] [2024-06-14 15:55:44,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:44,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:55:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:44,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:55:44,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:55:44,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:55:44,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 107 transitions, 955 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:44,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:44,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:55:44,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:45,434 INFO L124 PetriNetUnfolderBase]: 272/584 cut-off events. [2024-06-14 15:55:45,435 INFO L125 PetriNetUnfolderBase]: For 35526/35526 co-relation queries the response was YES. [2024-06-14 15:55:45,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 584 events. 272/584 cut-off events. For 35526/35526 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3025 event pairs, 66 based on Foata normal form. 8/589 useless extension candidates. Maximal degree in co-relation 3481. Up to 401 conditions per place. [2024-06-14 15:55:45,439 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 70 selfloop transitions, 36 changer transitions 9/119 dead transitions. [2024-06-14 15:55:45,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 119 transitions, 1237 flow [2024-06-14 15:55:45,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:55:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:55:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-14 15:55:45,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-14 15:55:45,440 INFO L175 Difference]: Start difference. First operand has 150 places, 107 transitions, 955 flow. Second operand 11 states and 140 transitions. [2024-06-14 15:55:45,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 119 transitions, 1237 flow [2024-06-14 15:55:45,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 119 transitions, 1126 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 15:55:45,481 INFO L231 Difference]: Finished difference. Result has 154 places, 104 transitions, 898 flow [2024-06-14 15:55:45,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=898, PETRI_PLACES=154, PETRI_TRANSITIONS=104} [2024-06-14 15:55:45,482 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 123 predicate places. [2024-06-14 15:55:45,482 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 104 transitions, 898 flow [2024-06-14 15:55:45,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:45,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:45,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:45,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 15:55:45,483 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:55:45,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:45,483 INFO L85 PathProgramCache]: Analyzing trace with hash -76431201, now seen corresponding path program 8 times [2024-06-14 15:55:45,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:45,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662114210] [2024-06-14 15:55:45,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:45,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:51,525 INFO 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:51,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:51,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662114210] [2024-06-14 15:55:51,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662114210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:51,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:51,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:55:51,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032338727] [2024-06-14 15:55:51,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:51,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:55:51,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:51,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:55:51,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:55:51,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:55:51,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 104 transitions, 898 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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:51,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:51,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:55:51,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:52,057 INFO L124 PetriNetUnfolderBase]: 285/629 cut-off events. [2024-06-14 15:55:52,057 INFO L125 PetriNetUnfolderBase]: For 42210/42210 co-relation queries the response was YES. [2024-06-14 15:55:52,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4010 conditions, 629 events. 285/629 cut-off events. For 42210/42210 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3360 event pairs, 74 based on Foata normal form. 6/634 useless extension candidates. Maximal degree in co-relation 3937. Up to 374 conditions per place. [2024-06-14 15:55:52,062 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 94 selfloop transitions, 16 changer transitions 9/123 dead transitions. [2024-06-14 15:55:52,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 123 transitions, 1314 flow [2024-06-14 15:55:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:55:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:55:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-14 15:55:52,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 15:55:52,063 INFO L175 Difference]: Start difference. First operand has 154 places, 104 transitions, 898 flow. Second operand 11 states and 144 transitions. [2024-06-14 15:55:52,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 123 transitions, 1314 flow [2024-06-14 15:55:52,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 123 transitions, 1234 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-14 15:55:52,116 INFO L231 Difference]: Finished difference. Result has 151 places, 101 transitions, 837 flow [2024-06-14 15:55:52,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=837, PETRI_PLACES=151, PETRI_TRANSITIONS=101} [2024-06-14 15:55:52,116 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-14 15:55:52,117 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 101 transitions, 837 flow [2024-06-14 15:55:52,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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:52,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:52,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:52,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 15:55:52,117 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:55:52,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:52,118 INFO L85 PathProgramCache]: Analyzing trace with hash -86262231, now seen corresponding path program 9 times [2024-06-14 15:55:52,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:52,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193092310] [2024-06-14 15:55:52,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:52,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:57,767 INFO 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:57,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:57,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193092310] [2024-06-14 15:55:57,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193092310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:57,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:57,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:55:57,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802660231] [2024-06-14 15:55:57,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:57,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:55:57,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:57,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:55:57,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:55:57,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:55:57,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 101 transitions, 837 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:57,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:57,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:55:57,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:58,321 INFO L124 PetriNetUnfolderBase]: 307/673 cut-off events. [2024-06-14 15:55:58,321 INFO L125 PetriNetUnfolderBase]: For 48273/48273 co-relation queries the response was YES. [2024-06-14 15:55:58,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4486 conditions, 673 events. 307/673 cut-off events. For 48273/48273 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3649 event pairs, 86 based on Foata normal form. 6/678 useless extension candidates. Maximal degree in co-relation 4414. Up to 499 conditions per place. [2024-06-14 15:55:58,326 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 94 selfloop transitions, 21 changer transitions 6/125 dead transitions. [2024-06-14 15:55:58,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 125 transitions, 1295 flow [2024-06-14 15:55:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:55:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:55:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 154 transitions. [2024-06-14 15:55:58,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010416666666667 [2024-06-14 15:55:58,327 INFO L175 Difference]: Start difference. First operand has 151 places, 101 transitions, 837 flow. Second operand 12 states and 154 transitions. [2024-06-14 15:55:58,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 125 transitions, 1295 flow [2024-06-14 15:55:58,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 125 transitions, 1254 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:55:58,376 INFO L231 Difference]: Finished difference. Result has 150 places, 103 transitions, 869 flow [2024-06-14 15:55:58,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=869, PETRI_PLACES=150, PETRI_TRANSITIONS=103} [2024-06-14 15:55:58,376 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 119 predicate places. [2024-06-14 15:55:58,376 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 103 transitions, 869 flow [2024-06-14 15:55:58,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:58,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:58,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:55:58,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 15:55:58,377 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:55:58,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:58,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1750443433, now seen corresponding path program 14 times [2024-06-14 15:55:58,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:58,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32246453] [2024-06-14 15:55:58,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:58,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:04,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:04,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32246453] [2024-06-14 15:56:04,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32246453] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:04,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:04,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:56:04,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371238441] [2024-06-14 15:56:04,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:04,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:56:04,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:04,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:56:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:56:04,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:56:04,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 103 transitions, 869 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:04,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:04,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:56:04,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:04,897 INFO L124 PetriNetUnfolderBase]: 309/673 cut-off events. [2024-06-14 15:56:04,897 INFO L125 PetriNetUnfolderBase]: For 48196/48196 co-relation queries the response was YES. [2024-06-14 15:56:04,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4487 conditions, 673 events. 309/673 cut-off events. For 48196/48196 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3668 event pairs, 90 based on Foata normal form. 10/680 useless extension candidates. Maximal degree in co-relation 4416. Up to 512 conditions per place. [2024-06-14 15:56:04,902 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 75 selfloop transitions, 30 changer transitions 6/115 dead transitions. [2024-06-14 15:56:04,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 115 transitions, 1167 flow [2024-06-14 15:56:04,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:56:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:56:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-14 15:56:04,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:56:04,903 INFO L175 Difference]: Start difference. First operand has 150 places, 103 transitions, 869 flow. Second operand 10 states and 130 transitions. [2024-06-14 15:56:04,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 115 transitions, 1167 flow [2024-06-14 15:56:04,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 115 transitions, 1099 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-14 15:56:04,977 INFO L231 Difference]: Finished difference. Result has 148 places, 101 transitions, 873 flow [2024-06-14 15:56:04,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=873, PETRI_PLACES=148, PETRI_TRANSITIONS=101} [2024-06-14 15:56:04,978 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-14 15:56:04,978 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 101 transitions, 873 flow [2024-06-14 15:56:04,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:04,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:04,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:04,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 15:56:04,978 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:56:04,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:04,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2050740645, now seen corresponding path program 10 times [2024-06-14 15:56:04,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:04,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123369408] [2024-06-14 15:56:04,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:04,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:11,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:11,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123369408] [2024-06-14 15:56:11,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123369408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:11,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:11,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:56:11,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587436386] [2024-06-14 15:56:11,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:11,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:56:11,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:11,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:56:11,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:56:11,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:56:11,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 101 transitions, 873 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:11,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:11,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:56:11,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:11,985 INFO L124 PetriNetUnfolderBase]: 315/689 cut-off events. [2024-06-14 15:56:11,985 INFO L125 PetriNetUnfolderBase]: For 49836/49836 co-relation queries the response was YES. [2024-06-14 15:56:11,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4761 conditions, 689 events. 315/689 cut-off events. For 49836/49836 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3790 event pairs, 95 based on Foata normal form. 6/692 useless extension candidates. Maximal degree in co-relation 4693. Up to 465 conditions per place. [2024-06-14 15:56:11,989 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 78 selfloop transitions, 28 changer transitions 7/117 dead transitions. [2024-06-14 15:56:11,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 117 transitions, 1263 flow [2024-06-14 15:56:11,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:56:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:56:11,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-14 15:56:11,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4005681818181818 [2024-06-14 15:56:11,990 INFO L175 Difference]: Start difference. First operand has 148 places, 101 transitions, 873 flow. Second operand 11 states and 141 transitions. [2024-06-14 15:56:11,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 117 transitions, 1263 flow [2024-06-14 15:56:12,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 117 transitions, 1160 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-06-14 15:56:12,031 INFO L231 Difference]: Finished difference. Result has 149 places, 98 transitions, 802 flow [2024-06-14 15:56:12,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=802, PETRI_PLACES=149, PETRI_TRANSITIONS=98} [2024-06-14 15:56:12,031 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 118 predicate places. [2024-06-14 15:56:12,031 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 98 transitions, 802 flow [2024-06-14 15:56:12,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:12,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:12,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:12,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 15:56:12,032 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:56:12,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:12,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1998590779, now seen corresponding path program 15 times [2024-06-14 15:56:12,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:12,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690862867] [2024-06-14 15:56:12,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:12,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:19,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:19,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690862867] [2024-06-14 15:56:19,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690862867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:19,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:19,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:56:19,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401741345] [2024-06-14 15:56:19,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:19,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:56:19,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:19,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:56:19,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:56:19,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:56:19,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 98 transitions, 802 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:19,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:19,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:56:19,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:19,583 INFO L124 PetriNetUnfolderBase]: 266/588 cut-off events. [2024-06-14 15:56:19,584 INFO L125 PetriNetUnfolderBase]: For 46120/46120 co-relation queries the response was YES. [2024-06-14 15:56:19,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 588 events. 266/588 cut-off events. For 46120/46120 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3058 event pairs, 74 based on Foata normal form. 18/605 useless extension candidates. Maximal degree in co-relation 3469. Up to 434 conditions per place. [2024-06-14 15:56:19,588 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 81 selfloop transitions, 16 changer transitions 10/111 dead transitions. [2024-06-14 15:56:19,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 111 transitions, 1072 flow [2024-06-14 15:56:19,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:56:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:56:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 15:56:19,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-14 15:56:19,590 INFO L175 Difference]: Start difference. First operand has 149 places, 98 transitions, 802 flow. Second operand 10 states and 129 transitions. [2024-06-14 15:56:19,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 111 transitions, 1072 flow [2024-06-14 15:56:19,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 111 transitions, 971 flow, removed 17 selfloop flow, removed 12 redundant places. [2024-06-14 15:56:19,638 INFO L231 Difference]: Finished difference. Result has 144 places, 91 transitions, 689 flow [2024-06-14 15:56:19,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=689, PETRI_PLACES=144, PETRI_TRANSITIONS=91} [2024-06-14 15:56:19,639 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-14 15:56:19,639 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 91 transitions, 689 flow [2024-06-14 15:56:19,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:19,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:19,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:19,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 15:56:19,640 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:56:19,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:19,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2007168603, now seen corresponding path program 11 times [2024-06-14 15:56:19,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:19,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432925164] [2024-06-14 15:56:19,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:19,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:26,246 INFO 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:26,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:26,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432925164] [2024-06-14 15:56:26,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432925164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:26,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:26,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:56:26,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567173100] [2024-06-14 15:56:26,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:26,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:56:26,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:26,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:56:26,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:56:26,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:56:26,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 91 transitions, 689 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:26,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:26,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:56:26,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:26,820 INFO L124 PetriNetUnfolderBase]: 253/559 cut-off events. [2024-06-14 15:56:26,820 INFO L125 PetriNetUnfolderBase]: For 36567/36567 co-relation queries the response was YES. [2024-06-14 15:56:26,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3453 conditions, 559 events. 253/559 cut-off events. For 36567/36567 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2815 event pairs, 77 based on Foata normal form. 6/564 useless extension candidates. Maximal degree in co-relation 3388. Up to 413 conditions per place. [2024-06-14 15:56:26,823 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 85 selfloop transitions, 13 changer transitions 7/109 dead transitions. [2024-06-14 15:56:26,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 109 transitions, 1057 flow [2024-06-14 15:56:26,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:56:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:56:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-14 15:56:26,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-14 15:56:26,824 INFO L175 Difference]: Start difference. First operand has 144 places, 91 transitions, 689 flow. Second operand 11 states and 139 transitions. [2024-06-14 15:56:26,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 109 transitions, 1057 flow [2024-06-14 15:56:26,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 109 transitions, 991 flow, removed 3 selfloop flow, removed 14 redundant places. [2024-06-14 15:56:26,864 INFO L231 Difference]: Finished difference. Result has 139 places, 88 transitions, 634 flow [2024-06-14 15:56:26,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=634, PETRI_PLACES=139, PETRI_TRANSITIONS=88} [2024-06-14 15:56:26,865 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 108 predicate places. [2024-06-14 15:56:26,865 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 88 transitions, 634 flow [2024-06-14 15:56:26,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:26,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:26,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:26,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 15:56:26,866 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:56:26,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:26,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1325274819, now seen corresponding path program 12 times [2024-06-14 15:56:26,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:26,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453900845] [2024-06-14 15:56:26,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:56:35,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:35,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453900845] [2024-06-14 15:56:35,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453900845] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:35,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:35,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:56:35,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152851450] [2024-06-14 15:56:35,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:35,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:56:35,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:35,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:56:35,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:56:35,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:56:35,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 88 transitions, 634 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:35,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:35,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:56:35,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:36,072 INFO L124 PetriNetUnfolderBase]: 250/548 cut-off events. [2024-06-14 15:56:36,073 INFO L125 PetriNetUnfolderBase]: For 40431/40431 co-relation queries the response was YES. [2024-06-14 15:56:36,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3432 conditions, 548 events. 250/548 cut-off events. For 40431/40431 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2760 event pairs, 81 based on Foata normal form. 8/553 useless extension candidates. Maximal degree in co-relation 3366. Up to 421 conditions per place. [2024-06-14 15:56:36,077 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 63 selfloop transitions, 24 changer transitions 9/100 dead transitions. [2024-06-14 15:56:36,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 100 transitions, 872 flow [2024-06-14 15:56:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:56:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:56:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:56:36,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 15:56:36,078 INFO L175 Difference]: Start difference. First operand has 139 places, 88 transitions, 634 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:56:36,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 100 transitions, 872 flow [2024-06-14 15:56:36,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 100 transitions, 844 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:56:36,117 INFO L231 Difference]: Finished difference. Result has 137 places, 85 transitions, 636 flow [2024-06-14 15:56:36,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=636, PETRI_PLACES=137, PETRI_TRANSITIONS=85} [2024-06-14 15:56:36,118 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 106 predicate places. [2024-06-14 15:56:36,118 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 85 transitions, 636 flow [2024-06-14 15:56:36,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:36,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:36,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:36,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 15:56:36,119 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:56:36,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:36,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1998597723, now seen corresponding path program 13 times [2024-06-14 15:56:36,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:36,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84152844] [2024-06-14 15:56:36,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:36,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:44,426 INFO 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:44,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:44,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84152844] [2024-06-14 15:56:44,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84152844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:44,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:44,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:56:44,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635562409] [2024-06-14 15:56:44,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:44,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:56:44,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:44,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:56:44,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:56:44,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:56:44,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 85 transitions, 636 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:44,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:44,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:56:44,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:44,877 INFO L124 PetriNetUnfolderBase]: 223/497 cut-off events. [2024-06-14 15:56:44,877 INFO L125 PetriNetUnfolderBase]: For 31483/31483 co-relation queries the response was YES. [2024-06-14 15:56:44,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2892 conditions, 497 events. 223/497 cut-off events. For 31483/31483 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2398 event pairs, 67 based on Foata normal form. 8/504 useless extension candidates. Maximal degree in co-relation 2827. Up to 400 conditions per place. [2024-06-14 15:56:44,881 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 76 selfloop transitions, 12 changer transitions 6/98 dead transitions. [2024-06-14 15:56:44,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 98 transitions, 874 flow [2024-06-14 15:56:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:56:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:56:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:56:44,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:56:44,883 INFO L175 Difference]: Start difference. First operand has 137 places, 85 transitions, 636 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:56:44,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 98 transitions, 874 flow [2024-06-14 15:56:44,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 98 transitions, 822 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:56:44,918 INFO L231 Difference]: Finished difference. Result has 134 places, 82 transitions, 590 flow [2024-06-14 15:56:44,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=590, PETRI_PLACES=134, PETRI_TRANSITIONS=82} [2024-06-14 15:56:44,919 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2024-06-14 15:56:44,919 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 82 transitions, 590 flow [2024-06-14 15:56:44,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:44,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:44,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:44,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 15:56:44,919 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:56:44,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:44,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1553182913, now seen corresponding path program 16 times [2024-06-14 15:56:44,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:44,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928754592] [2024-06-14 15:56:44,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:44,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:56:53,280 INFO 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:53,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:56:53,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928754592] [2024-06-14 15:56:53,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928754592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:56:53,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:56:53,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:56:53,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269272090] [2024-06-14 15:56:53,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:56:53,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:56:53,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:56:53,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:56:53,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:56:53,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:56:53,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 82 transitions, 590 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:53,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:56:53,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:56:53,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:56:53,633 INFO L124 PetriNetUnfolderBase]: 210/468 cut-off events. [2024-06-14 15:56:53,633 INFO L125 PetriNetUnfolderBase]: For 25279/25279 co-relation queries the response was YES. [2024-06-14 15:56:53,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2776 conditions, 468 events. 210/468 cut-off events. For 25279/25279 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2223 event pairs, 67 based on Foata normal form. 2/467 useless extension candidates. Maximal degree in co-relation 2712. Up to 367 conditions per place. [2024-06-14 15:56:53,636 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 61 selfloop transitions, 26 changer transitions 0/91 dead transitions. [2024-06-14 15:56:53,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 91 transitions, 808 flow [2024-06-14 15:56:53,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:56:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:56:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:56:53,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:56:53,637 INFO L175 Difference]: Start difference. First operand has 134 places, 82 transitions, 590 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:56:53,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 91 transitions, 808 flow [2024-06-14 15:56:53,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 91 transitions, 778 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-14 15:56:53,668 INFO L231 Difference]: Finished difference. Result has 131 places, 83 transitions, 646 flow [2024-06-14 15:56:53,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=646, PETRI_PLACES=131, PETRI_TRANSITIONS=83} [2024-06-14 15:56:53,668 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 100 predicate places. [2024-06-14 15:56:53,669 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 83 transitions, 646 flow [2024-06-14 15:56:53,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:56:53,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:56:53,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:56:53,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 15:56:53,669 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:53,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:56:53,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1553360543, now seen corresponding path program 17 times [2024-06-14 15:56:53,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:56:53,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997994001] [2024-06-14 15:56:53,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:56:53,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:56:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:57:02,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:02,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997994001] [2024-06-14 15:57:02,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997994001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:02,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:02,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:57:02,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604281493] [2024-06-14 15:57:02,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:02,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:57:02,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:02,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:57:02,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:57:02,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:57:02,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 83 transitions, 646 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:02,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:02,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:57:02,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:03,260 INFO L124 PetriNetUnfolderBase]: 214/476 cut-off events. [2024-06-14 15:57:03,260 INFO L125 PetriNetUnfolderBase]: For 24735/24735 co-relation queries the response was YES. [2024-06-14 15:57:03,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 476 events. 214/476 cut-off events. For 24735/24735 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2268 event pairs, 67 based on Foata normal form. 2/475 useless extension candidates. Maximal degree in co-relation 2787. Up to 358 conditions per place. [2024-06-14 15:57:03,264 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 63 selfloop transitions, 26 changer transitions 0/93 dead transitions. [2024-06-14 15:57:03,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 93 transitions, 872 flow [2024-06-14 15:57:03,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:57:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:57:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:57:03,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-14 15:57:03,265 INFO L175 Difference]: Start difference. First operand has 131 places, 83 transitions, 646 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:57:03,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 93 transitions, 872 flow [2024-06-14 15:57:03,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 93 transitions, 796 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 15:57:03,297 INFO L231 Difference]: Finished difference. Result has 133 places, 84 transitions, 658 flow [2024-06-14 15:57:03,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=658, PETRI_PLACES=133, PETRI_TRANSITIONS=84} [2024-06-14 15:57:03,297 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 102 predicate places. [2024-06-14 15:57:03,297 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 84 transitions, 658 flow [2024-06-14 15:57:03,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:03,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:03,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:03,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 15:57:03,298 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:57:03,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:03,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2007754621, now seen corresponding path program 14 times [2024-06-14 15:57:03,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:03,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540150551] [2024-06-14 15:57:03,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:57:11,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:11,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540150551] [2024-06-14 15:57:11,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540150551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:11,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:11,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:57:11,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795334537] [2024-06-14 15:57:11,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:11,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:57:11,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:11,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:57:11,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:57:11,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:57:11,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 84 transitions, 658 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:11,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:11,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:57:11,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:12,403 INFO L124 PetriNetUnfolderBase]: 204/458 cut-off events. [2024-06-14 15:57:12,403 INFO L125 PetriNetUnfolderBase]: For 23938/23938 co-relation queries the response was YES. [2024-06-14 15:57:12,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 458 events. 204/458 cut-off events. For 23938/23938 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2170 event pairs, 59 based on Foata normal form. 8/463 useless extension candidates. Maximal degree in co-relation 2395. Up to 331 conditions per place. [2024-06-14 15:57:12,407 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 60 selfloop transitions, 22 changer transitions 9/95 dead transitions. [2024-06-14 15:57:12,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 95 transitions, 870 flow [2024-06-14 15:57:12,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:57:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:57:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-14 15:57:12,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-14 15:57:12,408 INFO L175 Difference]: Start difference. First operand has 133 places, 84 transitions, 658 flow. Second operand 11 states and 137 transitions. [2024-06-14 15:57:12,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 95 transitions, 870 flow [2024-06-14 15:57:12,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 95 transitions, 788 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-14 15:57:12,435 INFO L231 Difference]: Finished difference. Result has 136 places, 80 transitions, 590 flow [2024-06-14 15:57:12,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=590, PETRI_PLACES=136, PETRI_TRANSITIONS=80} [2024-06-14 15:57:12,435 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 105 predicate places. [2024-06-14 15:57:12,435 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 80 transitions, 590 flow [2024-06-14 15:57:12,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:12,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:12,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:12,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 15:57:12,436 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:57:12,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:12,436 INFO L85 PathProgramCache]: Analyzing trace with hash 853754559, now seen corresponding path program 18 times [2024-06-14 15:57:12,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:12,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960209111] [2024-06-14 15:57:12,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:12,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:19,230 INFO 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:19,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:19,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960209111] [2024-06-14 15:57:19,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960209111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:19,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:19,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:57:19,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522121410] [2024-06-14 15:57:19,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:19,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:57:19,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:19,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:57:19,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:57:19,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:57:19,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 80 transitions, 590 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:19,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:19,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:57:19,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:19,568 INFO L124 PetriNetUnfolderBase]: 191/431 cut-off events. [2024-06-14 15:57:19,568 INFO L125 PetriNetUnfolderBase]: For 19967/19967 co-relation queries the response was YES. [2024-06-14 15:57:19,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2354 conditions, 431 events. 191/431 cut-off events. For 19967/19967 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1973 event pairs, 57 based on Foata normal form. 2/430 useless extension candidates. Maximal degree in co-relation 2289. Up to 348 conditions per place. [2024-06-14 15:57:19,571 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 66 selfloop transitions, 19 changer transitions 0/89 dead transitions. [2024-06-14 15:57:19,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 89 transitions, 808 flow [2024-06-14 15:57:19,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:57:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:57:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 15:57:19,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-14 15:57:19,572 INFO L175 Difference]: Start difference. First operand has 136 places, 80 transitions, 590 flow. Second operand 10 states and 121 transitions. [2024-06-14 15:57:19,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 89 transitions, 808 flow [2024-06-14 15:57:19,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 89 transitions, 733 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-06-14 15:57:19,595 INFO L231 Difference]: Finished difference. Result has 130 places, 81 transitions, 591 flow [2024-06-14 15:57:19,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=591, PETRI_PLACES=130, PETRI_TRANSITIONS=81} [2024-06-14 15:57:19,596 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 99 predicate places. [2024-06-14 15:57:19,596 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 81 transitions, 591 flow [2024-06-14 15:57:19,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:19,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:19,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:19,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 15:57:19,596 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:57:19,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:19,597 INFO L85 PathProgramCache]: Analyzing trace with hash 858218559, now seen corresponding path program 19 times [2024-06-14 15:57:19,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:19,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688506672] [2024-06-14 15:57:19,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:57:26,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688506672] [2024-06-14 15:57:26,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688506672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:26,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:26,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:57:26,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559085476] [2024-06-14 15:57:26,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:26,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:57:26,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:26,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:57:26,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:57:26,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:57:26,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 81 transitions, 591 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:26,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:26,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:57:26,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:27,085 INFO L124 PetriNetUnfolderBase]: 195/439 cut-off events. [2024-06-14 15:57:27,085 INFO L125 PetriNetUnfolderBase]: For 19359/19359 co-relation queries the response was YES. [2024-06-14 15:57:27,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 439 events. 195/439 cut-off events. For 19359/19359 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2025 event pairs, 57 based on Foata normal form. 2/438 useless extension candidates. Maximal degree in co-relation 2285. Up to 342 conditions per place. [2024-06-14 15:57:27,088 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 67 selfloop transitions, 20 changer transitions 0/91 dead transitions. [2024-06-14 15:57:27,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 91 transitions, 815 flow [2024-06-14 15:57:27,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:57:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:57:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 15:57:27,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 15:57:27,089 INFO L175 Difference]: Start difference. First operand has 130 places, 81 transitions, 591 flow. Second operand 10 states and 123 transitions. [2024-06-14 15:57:27,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 91 transitions, 815 flow [2024-06-14 15:57:27,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 91 transitions, 753 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 15:57:27,116 INFO L231 Difference]: Finished difference. Result has 133 places, 82 transitions, 607 flow [2024-06-14 15:57:27,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=607, PETRI_PLACES=133, PETRI_TRANSITIONS=82} [2024-06-14 15:57:27,116 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 102 predicate places. [2024-06-14 15:57:27,116 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 82 transitions, 607 flow [2024-06-14 15:57:27,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:27,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:27,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:27,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 15:57:27,117 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:57:27,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:27,117 INFO L85 PathProgramCache]: Analyzing trace with hash 119597883, now seen corresponding path program 20 times [2024-06-14 15:57:27,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:27,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957214498] [2024-06-14 15:57:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:27,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:35,132 INFO 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:35,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:35,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957214498] [2024-06-14 15:57:35,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957214498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:35,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:35,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:57:35,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763097835] [2024-06-14 15:57:35,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:35,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:57:35,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:35,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:57:35,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:57:35,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:57:35,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 82 transitions, 607 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:35,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:35,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:57:35,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:35,485 INFO L124 PetriNetUnfolderBase]: 192/434 cut-off events. [2024-06-14 15:57:35,486 INFO L125 PetriNetUnfolderBase]: For 18185/18185 co-relation queries the response was YES. [2024-06-14 15:57:35,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 434 events. 192/434 cut-off events. For 18185/18185 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2007 event pairs, 54 based on Foata normal form. 2/433 useless extension candidates. Maximal degree in co-relation 2143. Up to 341 conditions per place. [2024-06-14 15:57:35,488 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 70 selfloop transitions, 18 changer transitions 0/92 dead transitions. [2024-06-14 15:57:35,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 92 transitions, 803 flow [2024-06-14 15:57:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:57:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:57:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 15:57:35,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-14 15:57:35,489 INFO L175 Difference]: Start difference. First operand has 133 places, 82 transitions, 607 flow. Second operand 10 states and 122 transitions. [2024-06-14 15:57:35,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 92 transitions, 803 flow [2024-06-14 15:57:35,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 92 transitions, 735 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 15:57:35,514 INFO L231 Difference]: Finished difference. Result has 135 places, 82 transitions, 579 flow [2024-06-14 15:57:35,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=579, PETRI_PLACES=135, PETRI_TRANSITIONS=82} [2024-06-14 15:57:35,514 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 104 predicate places. [2024-06-14 15:57:35,515 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 82 transitions, 579 flow [2024-06-14 15:57:35,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:57:35,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:35,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:35,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 15:57:35,515 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:57:35,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:35,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1147730830, now seen corresponding path program 1 times [2024-06-14 15:57:35,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:35,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536495792] [2024-06-14 15:57:35,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:35,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:43,747 INFO 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:43,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:43,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536495792] [2024-06-14 15:57:43,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536495792] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:43,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:43,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:57:43,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736490017] [2024-06-14 15:57:43,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:43,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:57:43,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:43,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:57:43,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:57:43,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:57:43,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 82 transitions, 579 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:43,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:43,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:57:43,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:44,066 INFO L124 PetriNetUnfolderBase]: 196/444 cut-off events. [2024-06-14 15:57:44,067 INFO L125 PetriNetUnfolderBase]: For 18595/18595 co-relation queries the response was YES. [2024-06-14 15:57:44,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2199 conditions, 444 events. 196/444 cut-off events. For 18595/18595 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2077 event pairs, 43 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 2135. Up to 348 conditions per place. [2024-06-14 15:57:44,069 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 77 selfloop transitions, 14 changer transitions 0/95 dead transitions. [2024-06-14 15:57:44,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 95 transitions, 795 flow [2024-06-14 15:57:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:57:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:57:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-14 15:57:44,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-14 15:57:44,070 INFO L175 Difference]: Start difference. First operand has 135 places, 82 transitions, 579 flow. Second operand 10 states and 112 transitions. [2024-06-14 15:57:44,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 95 transitions, 795 flow [2024-06-14 15:57:44,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 95 transitions, 687 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-14 15:57:44,095 INFO L231 Difference]: Finished difference. Result has 135 places, 83 transitions, 513 flow [2024-06-14 15:57:44,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=513, PETRI_PLACES=135, PETRI_TRANSITIONS=83} [2024-06-14 15:57:44,096 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 104 predicate places. [2024-06-14 15:57:44,097 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 83 transitions, 513 flow [2024-06-14 15:57:44,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:44,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:44,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:44,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 15:57:44,097 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:44,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:44,097 INFO L85 PathProgramCache]: Analyzing trace with hash 580720686, now seen corresponding path program 2 times [2024-06-14 15:57:44,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:44,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472411682] [2024-06-14 15:57:44,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:44,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:57:56,677 INFO 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:56,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:57:56,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472411682] [2024-06-14 15:57:56,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472411682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:57:56,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:57:56,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:57:56,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861682950] [2024-06-14 15:57:56,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:57:56,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:57:56,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:57:56,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:57:56,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:57:56,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:57:56,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 83 transitions, 513 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:56,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:57:56,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:57:56,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:57:57,092 INFO L124 PetriNetUnfolderBase]: 189/431 cut-off events. [2024-06-14 15:57:57,093 INFO L125 PetriNetUnfolderBase]: For 16884/16884 co-relation queries the response was YES. [2024-06-14 15:57:57,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1802 conditions, 431 events. 189/431 cut-off events. For 16884/16884 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2012 event pairs, 44 based on Foata normal form. 6/436 useless extension candidates. Maximal degree in co-relation 1738. Up to 318 conditions per place. [2024-06-14 15:57:57,097 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 69 selfloop transitions, 11 changer transitions 13/97 dead transitions. [2024-06-14 15:57:57,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 97 transitions, 737 flow [2024-06-14 15:57:57,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:57:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:57:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 15:57:57,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-14 15:57:57,098 INFO L175 Difference]: Start difference. First operand has 135 places, 83 transitions, 513 flow. Second operand 11 states and 134 transitions. [2024-06-14 15:57:57,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 97 transitions, 737 flow [2024-06-14 15:57:57,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 97 transitions, 701 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:57:57,119 INFO L231 Difference]: Finished difference. Result has 137 places, 78 transitions, 473 flow [2024-06-14 15:57:57,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=473, PETRI_PLACES=137, PETRI_TRANSITIONS=78} [2024-06-14 15:57:57,120 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 106 predicate places. [2024-06-14 15:57:57,120 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 78 transitions, 473 flow [2024-06-14 15:57:57,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:57,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:57:57,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:57:57,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 15:57:57,121 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:57,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:57:57,121 INFO L85 PathProgramCache]: Analyzing trace with hash 381274746, now seen corresponding path program 3 times [2024-06-14 15:57:57,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:57:57,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699873247] [2024-06-14 15:57:57,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:57:57,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:57:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:07,112 INFO 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:58:07,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:07,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699873247] [2024-06-14 15:58:07,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699873247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:07,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:07,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:58:07,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101753244] [2024-06-14 15:58:07,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:07,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:58:07,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:07,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:58:07,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:58:07,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:58:07,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 78 transitions, 473 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:58:07,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:07,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:58:07,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:07,742 INFO L124 PetriNetUnfolderBase]: 179/411 cut-off events. [2024-06-14 15:58:07,742 INFO L125 PetriNetUnfolderBase]: For 17090/17090 co-relation queries the response was YES. [2024-06-14 15:58:07,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 411 events. 179/411 cut-off events. For 17090/17090 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1894 event pairs, 40 based on Foata normal form. 6/416 useless extension candidates. Maximal degree in co-relation 1652. Up to 300 conditions per place. [2024-06-14 15:58:07,751 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 64 selfloop transitions, 8 changer transitions 17/93 dead transitions. [2024-06-14 15:58:07,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 93 transitions, 691 flow [2024-06-14 15:58:07,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:58:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:58:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-14 15:58:07,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-14 15:58:07,753 INFO L175 Difference]: Start difference. First operand has 137 places, 78 transitions, 473 flow. Second operand 11 states and 133 transitions. [2024-06-14 15:58:07,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 93 transitions, 691 flow [2024-06-14 15:58:07,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 93 transitions, 657 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:58:07,772 INFO L231 Difference]: Finished difference. Result has 130 places, 71 transitions, 416 flow [2024-06-14 15:58:07,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=416, PETRI_PLACES=130, PETRI_TRANSITIONS=71} [2024-06-14 15:58:07,773 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 99 predicate places. [2024-06-14 15:58:07,773 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 71 transitions, 416 flow [2024-06-14 15:58:07,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:58:07,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:07,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:07,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 15:58:07,774 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:58:07,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:07,774 INFO L85 PathProgramCache]: Analyzing trace with hash 952562832, now seen corresponding path program 4 times [2024-06-14 15:58:07,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:07,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749277291] [2024-06-14 15:58:07,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:07,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:16,391 INFO 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:58:16,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:16,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749277291] [2024-06-14 15:58:16,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749277291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:16,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:16,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:58:16,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129342899] [2024-06-14 15:58:16,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:16,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:58:16,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:16,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:58:16,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:58:16,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:58:16,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 71 transitions, 416 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:58:16,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:16,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:58:16,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:16,914 INFO L124 PetriNetUnfolderBase]: 164/378 cut-off events. [2024-06-14 15:58:16,914 INFO L125 PetriNetUnfolderBase]: For 14940/14940 co-relation queries the response was YES. [2024-06-14 15:58:16,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 378 events. 164/378 cut-off events. For 14940/14940 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1691 event pairs, 43 based on Foata normal form. 6/381 useless extension candidates. Maximal degree in co-relation 1511. Up to 233 conditions per place. [2024-06-14 15:58:16,916 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 46 selfloop transitions, 22 changer transitions 11/83 dead transitions. [2024-06-14 15:58:16,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 83 transitions, 604 flow [2024-06-14 15:58:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:58:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:58:16,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-14 15:58:16,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-14 15:58:16,917 INFO L175 Difference]: Start difference. First operand has 130 places, 71 transitions, 416 flow. Second operand 11 states and 133 transitions. [2024-06-14 15:58:16,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 83 transitions, 604 flow [2024-06-14 15:58:16,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 83 transitions, 578 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 15:58:16,937 INFO L231 Difference]: Finished difference. Result has 121 places, 67 transitions, 417 flow [2024-06-14 15:58:16,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=417, PETRI_PLACES=121, PETRI_TRANSITIONS=67} [2024-06-14 15:58:16,937 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 90 predicate places. [2024-06-14 15:58:16,937 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 67 transitions, 417 flow [2024-06-14 15:58:16,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:58:16,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:16,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:16,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 15:58:16,938 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:58:16,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:16,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2071717894, now seen corresponding path program 5 times [2024-06-14 15:58:16,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:16,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899795506] [2024-06-14 15:58:16,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:16,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:24,578 INFO 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:58:24,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:24,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899795506] [2024-06-14 15:58:24,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899795506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:24,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:24,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:58:24,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836647635] [2024-06-14 15:58:24,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:24,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:58:24,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:24,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:58:24,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:58:24,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:58:24,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 67 transitions, 417 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:58:24,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:24,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:58:24,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:25,229 INFO L124 PetriNetUnfolderBase]: 156/360 cut-off events. [2024-06-14 15:58:25,230 INFO L125 PetriNetUnfolderBase]: For 12199/12199 co-relation queries the response was YES. [2024-06-14 15:58:25,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 360 events. 156/360 cut-off events. For 12199/12199 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1579 event pairs, 43 based on Foata normal form. 6/363 useless extension candidates. Maximal degree in co-relation 1440. Up to 223 conditions per place. [2024-06-14 15:58:25,232 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 43 selfloop transitions, 22 changer transitions 10/79 dead transitions. [2024-06-14 15:58:25,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 79 transitions, 597 flow [2024-06-14 15:58:25,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:58:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:58:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 15:58:25,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 15:58:25,233 INFO L175 Difference]: Start difference. First operand has 121 places, 67 transitions, 417 flow. Second operand 11 states and 131 transitions. [2024-06-14 15:58:25,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 79 transitions, 597 flow [2024-06-14 15:58:25,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 79 transitions, 545 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-14 15:58:25,247 INFO L231 Difference]: Finished difference. Result has 115 places, 64 transitions, 398 flow [2024-06-14 15:58:25,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=398, PETRI_PLACES=115, PETRI_TRANSITIONS=64} [2024-06-14 15:58:25,248 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-14 15:58:25,248 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 64 transitions, 398 flow [2024-06-14 15:58:25,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:58:25,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:25,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:25,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 15:58:25,249 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:58:25,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:25,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1086382220, now seen corresponding path program 6 times [2024-06-14 15:58:25,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:25,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278775112] [2024-06-14 15:58:25,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:25,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:58:33,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:33,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278775112] [2024-06-14 15:58:33,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278775112] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:33,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:33,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:58:33,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921502383] [2024-06-14 15:58:33,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:33,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:58:33,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:33,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:58:33,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:58:33,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:58:33,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 64 transitions, 398 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:58:33,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:33,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:58:33,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:33,783 INFO L124 PetriNetUnfolderBase]: 149/347 cut-off events. [2024-06-14 15:58:33,783 INFO L125 PetriNetUnfolderBase]: For 10363/10363 co-relation queries the response was YES. [2024-06-14 15:58:33,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 347 events. 149/347 cut-off events. For 10363/10363 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1508 event pairs, 39 based on Foata normal form. 6/350 useless extension candidates. Maximal degree in co-relation 1368. Up to 199 conditions per place. [2024-06-14 15:58:33,785 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 42 selfloop transitions, 20 changer transitions 11/77 dead transitions. [2024-06-14 15:58:33,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 77 transitions, 576 flow [2024-06-14 15:58:33,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:58:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:58:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-14 15:58:33,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:58:33,808 INFO L175 Difference]: Start difference. First operand has 115 places, 64 transitions, 398 flow. Second operand 11 states and 132 transitions. [2024-06-14 15:58:33,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 77 transitions, 576 flow [2024-06-14 15:58:33,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 77 transitions, 526 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:58:33,831 INFO L231 Difference]: Finished difference. Result has 111 places, 59 transitions, 365 flow [2024-06-14 15:58:33,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=365, PETRI_PLACES=111, PETRI_TRANSITIONS=59} [2024-06-14 15:58:33,832 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 80 predicate places. [2024-06-14 15:58:33,832 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 59 transitions, 365 flow [2024-06-14 15:58:33,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:58:33,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:33,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:33,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 15:58:33,832 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:58:33,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:33,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1325284898, now seen corresponding path program 7 times [2024-06-14 15:58:33,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:33,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727153412] [2024-06-14 15:58:33,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:33,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:42,262 INFO 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:58:42,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:42,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727153412] [2024-06-14 15:58:42,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727153412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:42,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:42,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:58:42,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591468206] [2024-06-14 15:58:42,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:42,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:58:42,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:42,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:58:42,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:58:42,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:58:42,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 59 transitions, 365 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:58:42,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:42,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:58:42,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:42,802 INFO L124 PetriNetUnfolderBase]: 122/288 cut-off events. [2024-06-14 15:58:42,802 INFO L125 PetriNetUnfolderBase]: For 6196/6196 co-relation queries the response was YES. [2024-06-14 15:58:42,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 288 events. 122/288 cut-off events. For 6196/6196 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1169 event pairs, 27 based on Foata normal form. 6/293 useless extension candidates. Maximal degree in co-relation 996. Up to 212 conditions per place. [2024-06-14 15:58:42,803 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 48 selfloop transitions, 5 changer transitions 16/73 dead transitions. [2024-06-14 15:58:42,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 73 transitions, 539 flow [2024-06-14 15:58:42,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:58:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:58:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 15:58:42,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 15:58:42,805 INFO L175 Difference]: Start difference. First operand has 111 places, 59 transitions, 365 flow. Second operand 11 states and 131 transitions. [2024-06-14 15:58:42,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 73 transitions, 539 flow [2024-06-14 15:58:42,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 73 transitions, 489 flow, removed 5 selfloop flow, removed 13 redundant places. [2024-06-14 15:58:42,810 INFO L231 Difference]: Finished difference. Result has 103 places, 53 transitions, 299 flow [2024-06-14 15:58:42,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=299, PETRI_PLACES=103, PETRI_TRANSITIONS=53} [2024-06-14 15:58:42,813 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-14 15:58:42,813 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 53 transitions, 299 flow [2024-06-14 15:58:42,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:58:42,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:42,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:42,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 15:58:42,814 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:58:42,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:42,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1990391262, now seen corresponding path program 8 times [2024-06-14 15:58:42,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:42,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862426453] [2024-06-14 15:58:42,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:51,315 INFO 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:58:51,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:51,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862426453] [2024-06-14 15:58:51,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862426453] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:51,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:51,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:58:51,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995250158] [2024-06-14 15:58:51,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:51,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:58:51,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:51,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:58:51,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:58:51,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:58:51,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 53 transitions, 299 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:58:51,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:51,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:58:51,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:58:51,613 INFO L124 PetriNetUnfolderBase]: 112/260 cut-off events. [2024-06-14 15:58:51,614 INFO L125 PetriNetUnfolderBase]: For 4710/4710 co-relation queries the response was YES. [2024-06-14 15:58:51,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 260 events. 112/260 cut-off events. For 4710/4710 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1002 event pairs, 28 based on Foata normal form. 6/263 useless extension candidates. Maximal degree in co-relation 873. Up to 152 conditions per place. [2024-06-14 15:58:51,615 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 33 selfloop transitions, 17 changer transitions 11/65 dead transitions. [2024-06-14 15:58:51,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 65 transitions, 451 flow [2024-06-14 15:58:51,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:58:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:58:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-14 15:58:51,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2024-06-14 15:58:51,616 INFO L175 Difference]: Start difference. First operand has 103 places, 53 transitions, 299 flow. Second operand 11 states and 120 transitions. [2024-06-14 15:58:51,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 65 transitions, 451 flow [2024-06-14 15:58:51,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 65 transitions, 423 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 15:58:51,620 INFO L231 Difference]: Finished difference. Result has 93 places, 49 transitions, 290 flow [2024-06-14 15:58:51,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=290, PETRI_PLACES=93, PETRI_TRANSITIONS=49} [2024-06-14 15:58:51,621 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 62 predicate places. [2024-06-14 15:58:51,621 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 49 transitions, 290 flow [2024-06-14 15:58:51,621 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:58:51,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:58:51,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:58:51,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 15:58:51,621 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:58:51,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:58:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1698758748, now seen corresponding path program 9 times [2024-06-14 15:58:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:58:51,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538056059] [2024-06-14 15:58:51,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:58:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:58:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:58:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:58:59,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:58:59,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538056059] [2024-06-14 15:58:59,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538056059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:58:59,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:58:59,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:58:59,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909957166] [2024-06-14 15:58:59,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:58:59,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:58:59,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:58:59,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:58:59,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:58:59,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:58:59,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 49 transitions, 290 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:58:59,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:58:59,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:58:59,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:00,316 INFO L124 PetriNetUnfolderBase]: 104/242 cut-off events. [2024-06-14 15:59:00,317 INFO L125 PetriNetUnfolderBase]: For 3571/3571 co-relation queries the response was YES. [2024-06-14 15:59:00,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 242 events. 104/242 cut-off events. For 3571/3571 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 892 event pairs, 28 based on Foata normal form. 6/245 useless extension candidates. Maximal degree in co-relation 800. Up to 142 conditions per place. [2024-06-14 15:59:00,318 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 32 selfloop transitions, 15 changer transitions 10/61 dead transitions. [2024-06-14 15:59:00,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 61 transitions, 430 flow [2024-06-14 15:59:00,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:59:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:59:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 15:59:00,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 15:59:00,319 INFO L175 Difference]: Start difference. First operand has 93 places, 49 transitions, 290 flow. Second operand 11 states and 131 transitions. [2024-06-14 15:59:00,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 61 transitions, 430 flow [2024-06-14 15:59:00,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 61 transitions, 385 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-14 15:59:00,323 INFO L231 Difference]: Finished difference. Result has 87 places, 46 transitions, 264 flow [2024-06-14 15:59:00,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=264, PETRI_PLACES=87, PETRI_TRANSITIONS=46} [2024-06-14 15:59:00,324 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-14 15:59:00,324 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 46 transitions, 264 flow [2024-06-14 15:59:00,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:59:00,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:00,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:00,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 15:59:00,324 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:00,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:00,325 INFO L85 PathProgramCache]: Analyzing trace with hash 412950812, now seen corresponding path program 10 times [2024-06-14 15:59:00,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:00,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525862449] [2024-06-14 15:59:00,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:00,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:09,445 INFO 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:59:09,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:09,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525862449] [2024-06-14 15:59:09,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525862449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:09,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:09,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:59:09,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376323204] [2024-06-14 15:59:09,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:09,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:59:09,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:09,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:59:09,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:59:09,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:59:09,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 46 transitions, 264 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:59:09,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:09,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:59:09,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:09,839 INFO L124 PetriNetUnfolderBase]: 97/229 cut-off events. [2024-06-14 15:59:09,840 INFO L125 PetriNetUnfolderBase]: For 3019/3019 co-relation queries the response was YES. [2024-06-14 15:59:09,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 229 events. 97/229 cut-off events. For 3019/3019 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 815 event pairs, 26 based on Foata normal form. 6/232 useless extension candidates. Maximal degree in co-relation 742. Up to 124 conditions per place. [2024-06-14 15:59:09,841 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 29 selfloop transitions, 12 changer transitions 14/59 dead transitions. [2024-06-14 15:59:09,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 59 transitions, 402 flow [2024-06-14 15:59:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:59:09,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:59:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 15:59:09,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 15:59:09,842 INFO L175 Difference]: Start difference. First operand has 87 places, 46 transitions, 264 flow. Second operand 11 states and 131 transitions. [2024-06-14 15:59:09,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 59 transitions, 402 flow [2024-06-14 15:59:09,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 59 transitions, 366 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:59:09,845 INFO L231 Difference]: Finished difference. Result has 83 places, 41 transitions, 231 flow [2024-06-14 15:59:09,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=231, PETRI_PLACES=83, PETRI_TRANSITIONS=41} [2024-06-14 15:59:09,846 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 52 predicate places. [2024-06-14 15:59:09,846 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 41 transitions, 231 flow [2024-06-14 15:59:09,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:59:09,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:09,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:09,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 15:59:09,846 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:09,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:09,847 INFO L85 PathProgramCache]: Analyzing trace with hash -439822542, now seen corresponding path program 11 times [2024-06-14 15:59:09,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:09,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689857669] [2024-06-14 15:59:09,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:09,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:16,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:16,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689857669] [2024-06-14 15:59:16,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689857669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:16,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:16,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:59:16,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240075966] [2024-06-14 15:59:16,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:16,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:59:16,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:16,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:59:16,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:59:16,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:59:16,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 41 transitions, 231 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:59:16,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:16,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:59:16,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:16,996 INFO L124 PetriNetUnfolderBase]: 85/203 cut-off events. [2024-06-14 15:59:16,996 INFO L125 PetriNetUnfolderBase]: For 2503/2503 co-relation queries the response was YES. [2024-06-14 15:59:16,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 203 events. 85/203 cut-off events. For 2503/2503 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 680 event pairs, 26 based on Foata normal form. 6/206 useless extension candidates. Maximal degree in co-relation 656. Up to 114 conditions per place. [2024-06-14 15:59:16,998 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 27 selfloop transitions, 12 changer transitions 10/53 dead transitions. [2024-06-14 15:59:16,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 53 transitions, 355 flow [2024-06-14 15:59:17,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:59:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:59:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-14 15:59:17,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 15:59:17,001 INFO L175 Difference]: Start difference. First operand has 83 places, 41 transitions, 231 flow. Second operand 11 states and 128 transitions. [2024-06-14 15:59:17,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 53 transitions, 355 flow [2024-06-14 15:59:17,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 53 transitions, 320 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-14 15:59:17,004 INFO L231 Difference]: Finished difference. Result has 76 places, 38 transitions, 209 flow [2024-06-14 15:59:17,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=209, PETRI_PLACES=76, PETRI_TRANSITIONS=38} [2024-06-14 15:59:17,004 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2024-06-14 15:59:17,004 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 38 transitions, 209 flow [2024-06-14 15:59:17,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:59:17,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:17,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:17,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 15:59:17,005 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:17,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:17,005 INFO L85 PathProgramCache]: Analyzing trace with hash 834972334, now seen corresponding path program 12 times [2024-06-14 15:59:17,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:17,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547364464] [2024-06-14 15:59:17,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:17,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:59:23,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:23,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547364464] [2024-06-14 15:59:23,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547364464] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:23,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:23,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:59:23,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990434114] [2024-06-14 15:59:23,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:23,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:59:23,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:23,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:59:23,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:59:24,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:59:24,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 38 transitions, 209 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:59:24,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:24,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:59:24,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:24,175 INFO L124 PetriNetUnfolderBase]: 78/190 cut-off events. [2024-06-14 15:59:24,175 INFO L125 PetriNetUnfolderBase]: For 1839/1839 co-relation queries the response was YES. [2024-06-14 15:59:24,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 190 events. 78/190 cut-off events. For 1839/1839 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 622 event pairs, 24 based on Foata normal form. 6/193 useless extension candidates. Maximal degree in co-relation 600. Up to 96 conditions per place. [2024-06-14 15:59:24,176 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 24 selfloop transitions, 10 changer transitions 13/51 dead transitions. [2024-06-14 15:59:24,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 51 transitions, 331 flow [2024-06-14 15:59:24,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:59:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:59:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-14 15:59:24,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 15:59:24,178 INFO L175 Difference]: Start difference. First operand has 76 places, 38 transitions, 209 flow. Second operand 11 states and 128 transitions. [2024-06-14 15:59:24,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 51 transitions, 331 flow [2024-06-14 15:59:24,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 51 transitions, 301 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:59:24,180 INFO L231 Difference]: Finished difference. Result has 72 places, 34 transitions, 184 flow [2024-06-14 15:59:24,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=184, PETRI_PLACES=72, PETRI_TRANSITIONS=34} [2024-06-14 15:59:24,180 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2024-06-14 15:59:24,180 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 34 transitions, 184 flow [2024-06-14 15:59:24,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:59:24,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:24,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:24,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 15:59:24,181 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:24,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash 692869264, now seen corresponding path program 13 times [2024-06-14 15:59:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:24,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936824159] [2024-06-14 15:59:24,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:24,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59: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:59:31,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:31,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936824159] [2024-06-14 15:59:31,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936824159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:31,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:31,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:59:31,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119096088] [2024-06-14 15:59:31,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:31,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:59:31,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:31,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:59:31,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:59:31,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:59:31,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 34 transitions, 184 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:59:31,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:31,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:59:31,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:31,506 INFO L124 PetriNetUnfolderBase]: 60/156 cut-off events. [2024-06-14 15:59:31,507 INFO L125 PetriNetUnfolderBase]: For 1245/1245 co-relation queries the response was YES. [2024-06-14 15:59:31,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 156 events. 60/156 cut-off events. For 1245/1245 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 461 event pairs, 17 based on Foata normal form. 6/159 useless extension candidates. Maximal degree in co-relation 466. Up to 57 conditions per place. [2024-06-14 15:59:31,507 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 18 selfloop transitions, 6 changer transitions 19/47 dead transitions. [2024-06-14 15:59:31,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 47 transitions, 296 flow [2024-06-14 15:59:31,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:59:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:59:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-14 15:59:31,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 15:59:31,508 INFO L175 Difference]: Start difference. First operand has 72 places, 34 transitions, 184 flow. Second operand 11 states and 128 transitions. [2024-06-14 15:59:31,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 47 transitions, 296 flow [2024-06-14 15:59:31,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 47 transitions, 268 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-14 15:59:31,510 INFO L231 Difference]: Finished difference. Result has 66 places, 26 transitions, 134 flow [2024-06-14 15:59:31,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=134, PETRI_PLACES=66, PETRI_TRANSITIONS=26} [2024-06-14 15:59:31,510 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-14 15:59:31,510 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 26 transitions, 134 flow [2024-06-14 15:59:31,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:59:31,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:59:31,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:31,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 15:59:31,511 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:59:31,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:59:31,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1846289262, now seen corresponding path program 1 times [2024-06-14 15:59:31,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:59:31,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014478882] [2024-06-14 15:59:31,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:59:31,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:59:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:59:38,071 INFO 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:59:38,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:59:38,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014478882] [2024-06-14 15:59:38,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014478882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:59:38,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:59:38,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:59:38,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753132042] [2024-06-14 15:59:38,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:59:38,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:59:38,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:59:38,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:59:38,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:59:38,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:59:38,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 26 transitions, 134 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:59:38,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:59:38,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:59:38,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:59:38,454 INFO L124 PetriNetUnfolderBase]: 31/91 cut-off events. [2024-06-14 15:59:38,454 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2024-06-14 15:59:38,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 91 events. 31/91 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 190 event pairs, 0 based on Foata normal form. 4/95 useless extension candidates. Maximal degree in co-relation 242. Up to 19 conditions per place. [2024-06-14 15:59:38,454 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2024-06-14 15:59:38,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 37 transitions, 200 flow [2024-06-14 15:59:38,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:59:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:59:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-14 15:59:38,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2024-06-14 15:59:38,455 INFO L175 Difference]: Start difference. First operand has 66 places, 26 transitions, 134 flow. Second operand 11 states and 120 transitions. [2024-06-14 15:59:38,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 37 transitions, 200 flow [2024-06-14 15:59:38,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 37 transitions, 165 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-06-14 15:59:38,455 INFO L231 Difference]: Finished difference. Result has 50 places, 0 transitions, 0 flow [2024-06-14 15:59:38,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=50, PETRI_TRANSITIONS=0} [2024-06-14 15:59:38,456 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 19 predicate places. [2024-06-14 15:59:38,456 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 0 transitions, 0 flow [2024-06-14 15:59:38,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:59:38,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-14 15:59:38,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 15:59:38,462 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-14 15:59:38,462 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 15:59:38,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 15:59:38,462 INFO L445 BasicCegarLoop]: Path program histogram: [20, 14, 13, 10, 8, 7, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:59:38,465 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-14 15:59:38,465 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-14 15:59:38,467 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-14 15:59:38,467 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-14 15:59:38,480 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 03:59:38 BasicIcfg [2024-06-14 15:59:38,480 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-14 15:59:38,481 INFO L158 Benchmark]: Toolchain (without parser) took 771465.14ms. Allocated memory was 169.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 140.2MB in the beginning and 1.1GB in the end (delta: -986.6MB). Peak memory consumption was 906.0MB. Max. memory is 16.1GB. [2024-06-14 15:59:38,481 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 109.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 15:59:38,481 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 169.9MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 15:59:38,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 644.04ms. Allocated memory is still 169.9MB. Free memory was 140.2MB in the beginning and 87.7MB in the end (delta: 52.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-06-14 15:59:38,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.39ms. Allocated memory is still 169.9MB. Free memory was 87.7MB in the beginning and 73.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-14 15:59:38,487 INFO L158 Benchmark]: Boogie Preprocessor took 109.64ms. Allocated memory is still 169.9MB. Free memory was 73.1MB in the beginning and 65.7MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-14 15:59:38,487 INFO L158 Benchmark]: RCFGBuilder took 1062.05ms. Allocated memory was 169.9MB in the beginning and 266.3MB in the end (delta: 96.5MB). Free memory was 65.7MB in the beginning and 114.7MB in the end (delta: -49.0MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. [2024-06-14 15:59:38,487 INFO L158 Benchmark]: TraceAbstraction took 769512.37ms. Allocated memory was 266.3MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 218.9MB in the beginning and 1.1GB in the end (delta: -907.9MB). Peak memory consumption was 888.3MB. Max. memory is 16.1GB. [2024-06-14 15:59:38,488 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.75ms. Allocated memory is still 109.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 169.9MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 644.04ms. Allocated memory is still 169.9MB. Free memory was 140.2MB in the beginning and 87.7MB in the end (delta: 52.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.39ms. Allocated memory is still 169.9MB. Free memory was 87.7MB in the beginning and 73.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.64ms. Allocated memory is still 169.9MB. Free memory was 73.1MB in the beginning and 65.7MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1062.05ms. Allocated memory was 169.9MB in the beginning and 266.3MB in the end (delta: 96.5MB). Free memory was 65.7MB in the beginning and 114.7MB in the end (delta: -49.0MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. * TraceAbstraction took 769512.37ms. Allocated memory was 266.3MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 218.9MB in the beginning and 1.1GB in the end (delta: -907.9MB). Peak memory consumption was 888.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 826]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 827]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 769.4s, OverallIterations: 106, TraceHistogramMax: 1, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 50.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6036 SdHoareTripleChecker+Valid, 31.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5111 mSDsluCounter, 1990 SdHoareTripleChecker+Invalid, 28.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1696 mSDsCounter, 894 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39164 IncrementalHoareTripleChecker+Invalid, 40058 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 894 mSolverCounterUnsat, 294 mSDtfsCounter, 39164 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1094 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1087 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 30.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1385occurred in iteration=54, InterpolantAutomatonStates: 986, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 713.1s InterpolantComputationTime, 1849 NumberOfCodeBlocks, 1849 NumberOfCodeBlocksAsserted, 106 NumberOfCheckSat, 1743 ConstructedInterpolants, 0 QuantifiedInterpolants, 83048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 106 InterpolantComputations, 106 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-14 15:59:38,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE