./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix022_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix022_tso.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 16:57:34,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 16:57:34,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 16:57:34,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 16:57:34,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 16:57:34,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 16:57:34,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 16:57:34,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 16:57:34,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 16:57:34,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 16:57:34,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 16:57:34,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 16:57:34,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 16:57:34,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 16:57:34,979 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 16:57:34,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 16:57:34,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 16:57:34,980 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 16:57:34,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 16:57:34,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 16:57:34,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 16:57:34,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 16:57:34,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 16:57:34,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 16:57:34,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 16:57:34,982 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 16:57:34,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 16:57:34,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 16:57:34,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 16:57:34,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 16:57:34,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 16:57:34,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 16:57:34,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:57:34,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 16:57:34,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 16:57:34,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 16:57:34,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 16:57:34,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 16:57:34,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 16:57:34,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 16:57:34,987 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 16:57:34,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 16:57:34,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 16:57:34,987 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 16:57:35,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 16:57:35,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 16:57:35,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 16:57:35,299 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 16:57:35,299 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 16:57:35,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i [2024-06-04 16:57:36,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 16:57:36,726 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 16:57:36,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.i [2024-06-04 16:57:36,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceb4c6069/c5871a9af43045bfa511c032f618faae/FLAGd91843d52 [2024-06-04 16:57:36,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceb4c6069/c5871a9af43045bfa511c032f618faae [2024-06-04 16:57:36,761 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 16:57:36,761 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 16:57:36,762 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/mix022_tso.yml/witness.yml [2024-06-04 16:57:36,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 16:57:36,932 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 16:57:36,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 16:57:36,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 16:57:36,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 16:57:36,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:57:36" (1/2) ... [2024-06-04 16:57:36,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e4cc538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:57:36, skipping insertion in model container [2024-06-04 16:57:36,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:57:36" (1/2) ... [2024-06-04 16:57:36,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@42ad331c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:57:36, skipping insertion in model container [2024-06-04 16:57:36,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:57:36" (2/2) ... [2024-06-04 16:57:36,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e4cc538 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:36, skipping insertion in model container [2024-06-04 16:57:36,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:57:36" (2/2) ... [2024-06-04 16:57:36,943 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 16:57:37,020 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 16:57:37,022 INFO L97 edCorrectnessWitness]: Location invariant before [L814-L814] (((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$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) && (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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (1LL + (long long )x) - (long long )y >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p1_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 16:57:37,023 INFO L97 edCorrectnessWitness]: Location invariant before [L813-L813] (((((((((((((((! multithreaded || x$r_buff1_thd0 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$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) && (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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (1LL + (long long )x) - (long long )y >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p1_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 16:57:37,023 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 16:57:37,023 INFO L106 edCorrectnessWitness]: ghost_update [L811-L811] multithreaded = 1; [2024-06-04 16:57:37,070 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 16:57:37,463 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:57:37,476 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 16:57:37,754 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:57:37,787 INFO L206 MainTranslator]: Completed translation [2024-06-04 16:57:37,788 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:37 WrapperNode [2024-06-04 16:57:37,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 16:57:37,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 16:57:37,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 16:57:37,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 16:57:37,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:37" (1/1) ... [2024-06-04 16:57:37,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:37" (1/1) ... [2024-06-04 16:57:37,914 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2024-06-04 16:57:37,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 16:57:37,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 16:57:37,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 16:57:37,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 16:57:37,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:37" (1/1) ... [2024-06-04 16:57:37,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:37" (1/1) ... [2024-06-04 16:57:37,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:37" (1/1) ... [2024-06-04 16:57:37,987 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 16:57:37,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:37" (1/1) ... [2024-06-04 16:57:37,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:37" (1/1) ... [2024-06-04 16:57:38,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:37" (1/1) ... [2024-06-04 16:57:38,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:37" (1/1) ... [2024-06-04 16:57:38,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:37" (1/1) ... [2024-06-04 16:57:38,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:37" (1/1) ... [2024-06-04 16:57:38,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 16:57:38,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 16:57:38,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 16:57:38,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 16:57:38,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:37" (1/1) ... [2024-06-04 16:57:38,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:57:38,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:57:38,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 16:57:38,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 16:57:38,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 16:57:38,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 16:57:38,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 16:57:38,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 16:57:38,193 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 16:57:38,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 16:57:38,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 16:57:38,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 16:57:38,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 16:57:38,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 16:57:38,195 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 16:57:38,303 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 16:57:38,305 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 16:57:39,040 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 16:57:39,040 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 16:57:39,261 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 16:57:39,262 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 16:57:39,265 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:57:39 BoogieIcfgContainer [2024-06-04 16:57:39,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 16:57:39,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 16:57:39,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 16:57:39,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 16:57:39,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:57:36" (1/4) ... [2024-06-04 16:57:39,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6279f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:57:39, skipping insertion in model container [2024-06-04 16:57:39,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:57:36" (2/4) ... [2024-06-04 16:57:39,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6279f7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:57:39, skipping insertion in model container [2024-06-04 16:57:39,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:57:37" (3/4) ... [2024-06-04 16:57:39,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6279f7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:57:39, skipping insertion in model container [2024-06-04 16:57:39,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:57:39" (4/4) ... [2024-06-04 16:57:39,281 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_tso.i [2024-06-04 16:57:39,298 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 16:57:39,298 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 16:57:39,298 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 16:57:39,385 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 16:57:39,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-04 16:57:39,469 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-04 16:57:39,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:57:39,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 16:57:39,476 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-04 16:57:39,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-04 16:57:39,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:57:39,501 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;@4fee0a12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:57:39,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:57:39,513 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:57:39,513 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 16:57:39,513 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:57:39,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:39,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 16:57:39,515 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:39,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:39,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1606705191, now seen corresponding path program 1 times [2024-06-04 16:57:39,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:39,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104045047] [2024-06-04 16:57:39,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:39,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:43,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:43,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104045047] [2024-06-04 16:57:43,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104045047] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:43,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:43,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:57:43,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120231933] [2024-06-04 16:57:43,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:43,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:57:43,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:43,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:57:43,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:57:43,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:57:43,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:43,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:43,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:57:43,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:43,524 INFO L124 PetriNetUnfolderBase]: 162/309 cut-off events. [2024-06-04 16:57:43,524 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-04 16:57:43,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 309 events. 162/309 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1128 event pairs, 97 based on Foata normal form. 1/298 useless extension candidates. Maximal degree in co-relation 608. Up to 288 conditions per place. [2024-06-04 16:57:43,531 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-04 16:57:43,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 119 flow [2024-06-04 16:57:43,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:57:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:57:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-06-04 16:57:43,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5268817204301075 [2024-06-04 16:57:43,544 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 49 transitions. [2024-06-04 16:57:43,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 119 flow [2024-06-04 16:57:43,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:57:43,548 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-04 16:57:43,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-04 16:57:43,553 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-04 16:57:43,553 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-04 16:57:43,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:43,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:43,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:43,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 16:57:43,555 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:43,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2144571448, now seen corresponding path program 1 times [2024-06-04 16:57:43,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:43,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549406416] [2024-06-04 16:57:43,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:43,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:46,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:46,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549406416] [2024-06-04 16:57:46,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549406416] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:46,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:46,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:57:46,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011470865] [2024-06-04 16:57:46,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:46,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:57:46,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:46,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:57:46,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:57:46,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:57:46,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:46,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:46,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:57:46,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:46,477 INFO L124 PetriNetUnfolderBase]: 186/337 cut-off events. [2024-06-04 16:57:46,478 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-06-04 16:57:46,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 337 events. 186/337 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1172 event pairs, 94 based on Foata normal form. 2/338 useless extension candidates. Maximal degree in co-relation 766. Up to 319 conditions per place. [2024-06-04 16:57:46,481 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 28 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-04 16:57:46,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 163 flow [2024-06-04 16:57:46,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:57:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:57:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2024-06-04 16:57:46,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47580645161290325 [2024-06-04 16:57:46,483 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 59 transitions. [2024-06-04 16:57:46,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 163 flow [2024-06-04 16:57:46,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:57:46,485 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-04 16:57:46,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-04 16:57:46,486 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-04 16:57:46,486 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-04 16:57:46,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:46,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:46,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:46,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 16:57:46,487 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:46,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2057206554, now seen corresponding path program 1 times [2024-06-04 16:57:46,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:46,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985204131] [2024-06-04 16:57:46,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:46,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:48,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:48,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985204131] [2024-06-04 16:57:48,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985204131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:48,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:48,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:57:48,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044176461] [2024-06-04 16:57:48,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:48,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:57:48,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:48,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:57:48,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:57:48,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:57:48,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:48,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:48,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:57:48,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:49,144 INFO L124 PetriNetUnfolderBase]: 180/327 cut-off events. [2024-06-04 16:57:49,145 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2024-06-04 16:57:49,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 327 events. 180/327 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1119 event pairs, 52 based on Foata normal form. 4/330 useless extension candidates. Maximal degree in co-relation 822. Up to 291 conditions per place. [2024-06-04 16:57:49,148 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 33 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-04 16:57:49,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 215 flow [2024-06-04 16:57:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:57:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:57:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-06-04 16:57:49,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645161290322581 [2024-06-04 16:57:49,150 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 72 transitions. [2024-06-04 16:57:49,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 215 flow [2024-06-04 16:57:49,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 16:57:49,152 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 119 flow [2024-06-04 16:57:49,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-06-04 16:57:49,153 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-04 16:57:49,153 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 119 flow [2024-06-04 16:57:49,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:49,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:49,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:49,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 16:57:49,154 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:49,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:49,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1290578649, now seen corresponding path program 1 times [2024-06-04 16:57:49,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:49,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917835965] [2024-06-04 16:57:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:49,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:52,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:52,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917835965] [2024-06-04 16:57:52,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917835965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:52,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:52,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:57:52,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245608723] [2024-06-04 16:57:52,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:52,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:57:52,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:52,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:57:52,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:57:52,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:57:52,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 119 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:52,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:52,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:57:52,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:52,786 INFO L124 PetriNetUnfolderBase]: 176/319 cut-off events. [2024-06-04 16:57:52,787 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2024-06-04 16:57:52,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 319 events. 176/319 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1082 event pairs, 30 based on Foata normal form. 4/322 useless extension candidates. Maximal degree in co-relation 873. Up to 265 conditions per place. [2024-06-04 16:57:52,790 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 33 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-04 16:57:52,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 229 flow [2024-06-04 16:57:52,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:57:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:57:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-06-04 16:57:52,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42473118279569894 [2024-06-04 16:57:52,794 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 119 flow. Second operand 6 states and 79 transitions. [2024-06-04 16:57:52,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 229 flow [2024-06-04 16:57:52,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 214 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 16:57:52,796 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 116 flow [2024-06-04 16:57:52,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2024-06-04 16:57:52,797 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-04 16:57:52,797 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 116 flow [2024-06-04 16:57:52,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:52,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:52,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:52,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 16:57:52,798 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:52,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash 672537551, now seen corresponding path program 1 times [2024-06-04 16:57:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:52,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206297663] [2024-06-04 16:57:52,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:52,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:57:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:57:56,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:57:56,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206297663] [2024-06-04 16:57:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206297663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:57:56,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:57:56,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:57:56,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292878020] [2024-06-04 16:57:56,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:57:56,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:57:56,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:57:56,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:57:56,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:57:56,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:57:56,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:56,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:57:56,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:57:56,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:57:57,126 INFO L124 PetriNetUnfolderBase]: 147/283 cut-off events. [2024-06-04 16:57:57,127 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2024-06-04 16:57:57,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 283 events. 147/283 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 985 event pairs, 53 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 792. Up to 259 conditions per place. [2024-06-04 16:57:57,130 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 26 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2024-06-04 16:57:57,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 198 flow [2024-06-04 16:57:57,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:57:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:57:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2024-06-04 16:57:57,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255 [2024-06-04 16:57:57,132 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 116 flow. Second operand 5 states and 59 transitions. [2024-06-04 16:57:57,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 198 flow [2024-06-04 16:57:57,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 178 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 16:57:57,139 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 123 flow [2024-06-04 16:57:57,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2024-06-04 16:57:57,141 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2024-06-04 16:57:57,143 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 123 flow [2024-06-04 16:57:57,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:57:57,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:57:57,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:57:57,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 16:57:57,150 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:57:57,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:57:57,151 INFO L85 PathProgramCache]: Analyzing trace with hash -616340437, now seen corresponding path program 1 times [2024-06-04 16:57:57,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:57:57,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352525905] [2024-06-04 16:57:57,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:57:57,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:57:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:01,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:01,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352525905] [2024-06-04 16:58:01,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352525905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:01,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:01,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:58:01,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143831982] [2024-06-04 16:58:01,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:01,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:58:01,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:01,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:58:01,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:58:01,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-04 16:58:01,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 123 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:01,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:01,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-04 16:58:01,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:02,006 INFO L124 PetriNetUnfolderBase]: 145/280 cut-off events. [2024-06-04 16:58:02,007 INFO L125 PetriNetUnfolderBase]: For 477/477 co-relation queries the response was YES. [2024-06-04 16:58:02,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 280 events. 145/280 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 965 event pairs, 52 based on Foata normal form. 1/280 useless extension candidates. Maximal degree in co-relation 816. Up to 253 conditions per place. [2024-06-04 16:58:02,012 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 27 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2024-06-04 16:58:02,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 215 flow [2024-06-04 16:58:02,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:58:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:58:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2024-06-04 16:58:02,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-04 16:58:02,014 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 123 flow. Second operand 6 states and 74 transitions. [2024-06-04 16:58:02,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 215 flow [2024-06-04 16:58:02,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 204 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 16:58:02,016 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 145 flow [2024-06-04 16:58:02,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2024-06-04 16:58:02,019 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2024-06-04 16:58:02,019 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 145 flow [2024-06-04 16:58:02,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:02,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:02,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:02,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 16:58:02,020 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:02,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:02,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1661963166, now seen corresponding path program 1 times [2024-06-04 16:58:02,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:02,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818699063] [2024-06-04 16:58:02,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:02,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:06,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:06,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818699063] [2024-06-04 16:58:06,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818699063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:06,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:06,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:58:06,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580861925] [2024-06-04 16:58:06,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:06,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:58:06,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:06,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:58:06,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:58:06,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:58:06,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 145 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:06,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:06,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:58:06,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:06,494 INFO L124 PetriNetUnfolderBase]: 173/315 cut-off events. [2024-06-04 16:58:06,494 INFO L125 PetriNetUnfolderBase]: For 745/745 co-relation queries the response was YES. [2024-06-04 16:58:06,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 315 events. 173/315 cut-off events. For 745/745 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1051 event pairs, 62 based on Foata normal form. 1/315 useless extension candidates. Maximal degree in co-relation 1006. Up to 294 conditions per place. [2024-06-04 16:58:06,497 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 33 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-04 16:58:06,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 257 flow [2024-06-04 16:58:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:58:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:58:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2024-06-04 16:58:06,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-04 16:58:06,498 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 145 flow. Second operand 6 states and 66 transitions. [2024-06-04 16:58:06,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 257 flow [2024-06-04 16:58:06,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 240 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 16:58:06,501 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 161 flow [2024-06-04 16:58:06,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-04 16:58:06,502 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-04 16:58:06,502 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 161 flow [2024-06-04 16:58:06,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:06,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:06,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:06,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 16:58:06,503 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:06,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:06,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1926691336, now seen corresponding path program 2 times [2024-06-04 16:58:06,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:06,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795251265] [2024-06-04 16:58:06,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:06,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:09,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:09,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795251265] [2024-06-04 16:58:09,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795251265] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:09,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:09,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:58:09,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254637503] [2024-06-04 16:58:09,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:09,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:58:09,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:09,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:58:09,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:58:09,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:58:09,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 161 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:09,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:09,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:58:09,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:09,804 INFO L124 PetriNetUnfolderBase]: 171/313 cut-off events. [2024-06-04 16:58:09,804 INFO L125 PetriNetUnfolderBase]: For 969/972 co-relation queries the response was YES. [2024-06-04 16:58:09,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 313 events. 171/313 cut-off events. For 969/972 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1066 event pairs, 66 based on Foata normal form. 3/314 useless extension candidates. Maximal degree in co-relation 1055. Up to 285 conditions per place. [2024-06-04 16:58:09,807 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 29 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2024-06-04 16:58:09,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 267 flow [2024-06-04 16:58:09,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:58:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:58:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2024-06-04 16:58:09,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34946236559139787 [2024-06-04 16:58:09,808 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 161 flow. Second operand 6 states and 65 transitions. [2024-06-04 16:58:09,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 267 flow [2024-06-04 16:58:09,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 250 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 16:58:09,811 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 187 flow [2024-06-04 16:58:09,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2024-06-04 16:58:09,813 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-04 16:58:09,813 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 187 flow [2024-06-04 16:58:09,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:09,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:09,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:09,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 16:58:09,814 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:09,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:09,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1214428462, now seen corresponding path program 1 times [2024-06-04 16:58:09,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:09,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976911588] [2024-06-04 16:58:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:09,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:13,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:13,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976911588] [2024-06-04 16:58:13,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976911588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:13,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:13,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:58:13,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358855507] [2024-06-04 16:58:13,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:13,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:58:13,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:13,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:58:13,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:58:13,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:58:13,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 187 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:13,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:13,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:58:13,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:13,956 INFO L124 PetriNetUnfolderBase]: 189/344 cut-off events. [2024-06-04 16:58:13,956 INFO L125 PetriNetUnfolderBase]: For 1297/1297 co-relation queries the response was YES. [2024-06-04 16:58:13,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 344 events. 189/344 cut-off events. For 1297/1297 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1190 event pairs, 62 based on Foata normal form. 2/345 useless extension candidates. Maximal degree in co-relation 1226. Up to 307 conditions per place. [2024-06-04 16:58:13,959 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 43 selfloop transitions, 15 changer transitions 0/60 dead transitions. [2024-06-04 16:58:13,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 389 flow [2024-06-04 16:58:13,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:58:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:58:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-04 16:58:13,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33691756272401435 [2024-06-04 16:58:13,961 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 187 flow. Second operand 9 states and 94 transitions. [2024-06-04 16:58:13,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 389 flow [2024-06-04 16:58:13,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 358 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 16:58:13,965 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 259 flow [2024-06-04 16:58:13,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=259, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-06-04 16:58:13,966 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2024-06-04 16:58:13,967 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 259 flow [2024-06-04 16:58:13,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:13,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:13,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:13,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 16:58:13,968 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:13,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash -632825254, now seen corresponding path program 2 times [2024-06-04 16:58:13,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:13,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203097366] [2024-06-04 16:58:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:13,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:17,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:17,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203097366] [2024-06-04 16:58:17,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203097366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:17,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:17,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:58:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729339445] [2024-06-04 16:58:17,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:17,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:58:17,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:17,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:58:17,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:58:17,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:58:17,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 259 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:17,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:17,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:58:17,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:17,965 INFO L124 PetriNetUnfolderBase]: 195/354 cut-off events. [2024-06-04 16:58:17,965 INFO L125 PetriNetUnfolderBase]: For 1710/1710 co-relation queries the response was YES. [2024-06-04 16:58:17,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 354 events. 195/354 cut-off events. For 1710/1710 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1228 event pairs, 43 based on Foata normal form. 2/355 useless extension candidates. Maximal degree in co-relation 1397. Up to 293 conditions per place. [2024-06-04 16:58:17,968 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 44 selfloop transitions, 20 changer transitions 0/66 dead transitions. [2024-06-04 16:58:17,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 66 transitions, 463 flow [2024-06-04 16:58:17,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:58:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:58:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-04 16:58:17,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355 [2024-06-04 16:58:17,970 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 259 flow. Second operand 8 states and 89 transitions. [2024-06-04 16:58:17,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 66 transitions, 463 flow [2024-06-04 16:58:17,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 445 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 16:58:17,975 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 327 flow [2024-06-04 16:58:17,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=327, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2024-06-04 16:58:17,977 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2024-06-04 16:58:17,977 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 327 flow [2024-06-04 16:58:17,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:17,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:17,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:17,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 16:58:17,978 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:17,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:17,979 INFO L85 PathProgramCache]: Analyzing trace with hash 277308802, now seen corresponding path program 3 times [2024-06-04 16:58:17,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:17,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158014800] [2024-06-04 16:58:17,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:17,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:21,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:21,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158014800] [2024-06-04 16:58:21,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158014800] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:21,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:21,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:58:21,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884597128] [2024-06-04 16:58:21,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:21,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:58:21,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:21,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:58:21,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:58:21,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:58:21,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 327 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:21,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:21,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:58:21,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:22,009 INFO L124 PetriNetUnfolderBase]: 206/372 cut-off events. [2024-06-04 16:58:22,010 INFO L125 PetriNetUnfolderBase]: For 2269/2269 co-relation queries the response was YES. [2024-06-04 16:58:22,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 372 events. 206/372 cut-off events. For 2269/2269 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1307 event pairs, 43 based on Foata normal form. 2/373 useless extension candidates. Maximal degree in co-relation 1641. Up to 294 conditions per place. [2024-06-04 16:58:22,013 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 43 selfloop transitions, 24 changer transitions 0/69 dead transitions. [2024-06-04 16:58:22,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 69 transitions, 571 flow [2024-06-04 16:58:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:58:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:58:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-04 16:58:22,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-04 16:58:22,016 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 327 flow. Second operand 8 states and 90 transitions. [2024-06-04 16:58:22,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 69 transitions, 571 flow [2024-06-04 16:58:22,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 511 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-04 16:58:22,021 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 370 flow [2024-06-04 16:58:22,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=370, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-06-04 16:58:22,022 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2024-06-04 16:58:22,022 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 370 flow [2024-06-04 16:58:22,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:22,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:22,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:22,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 16:58:22,023 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:22,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:22,023 INFO L85 PathProgramCache]: Analyzing trace with hash -632705098, now seen corresponding path program 1 times [2024-06-04 16:58:22,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:22,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143151138] [2024-06-04 16:58:22,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:22,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:26,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143151138] [2024-06-04 16:58:26,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143151138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:26,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:26,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:58:26,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477430419] [2024-06-04 16:58:26,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:26,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:58:26,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:26,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:58:26,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:58:26,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:58:26,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 370 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:26,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:26,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:58:26,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:27,009 INFO L124 PetriNetUnfolderBase]: 209/377 cut-off events. [2024-06-04 16:58:27,010 INFO L125 PetriNetUnfolderBase]: For 2179/2179 co-relation queries the response was YES. [2024-06-04 16:58:27,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 377 events. 209/377 cut-off events. For 2179/2179 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1340 event pairs, 43 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 1633. Up to 348 conditions per place. [2024-06-04 16:58:27,013 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 50 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2024-06-04 16:58:27,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 528 flow [2024-06-04 16:58:27,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:58:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:58:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-04 16:58:27,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34101382488479265 [2024-06-04 16:58:27,015 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 370 flow. Second operand 7 states and 74 transitions. [2024-06-04 16:58:27,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 528 flow [2024-06-04 16:58:27,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 498 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 16:58:27,019 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 383 flow [2024-06-04 16:58:27,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=383, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-06-04 16:58:27,020 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-06-04 16:58:27,021 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 383 flow [2024-06-04 16:58:27,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:27,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:27,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:27,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 16:58:27,021 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:27,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:27,022 INFO L85 PathProgramCache]: Analyzing trace with hash -455573578, now seen corresponding path program 2 times [2024-06-04 16:58:27,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:27,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557093066] [2024-06-04 16:58:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:27,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:31,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:31,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557093066] [2024-06-04 16:58:31,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557093066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:31,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:31,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:58:31,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054173967] [2024-06-04 16:58:31,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:31,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:58:31,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:31,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:58:31,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:58:31,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:58:31,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 383 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:31,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:31,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:58:31,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:31,526 INFO L124 PetriNetUnfolderBase]: 212/383 cut-off events. [2024-06-04 16:58:31,526 INFO L125 PetriNetUnfolderBase]: For 2499/2502 co-relation queries the response was YES. [2024-06-04 16:58:31,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1751 conditions, 383 events. 212/383 cut-off events. For 2499/2502 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1349 event pairs, 46 based on Foata normal form. 3/383 useless extension candidates. Maximal degree in co-relation 1717. Up to 347 conditions per place. [2024-06-04 16:58:31,530 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 47 selfloop transitions, 15 changer transitions 0/64 dead transitions. [2024-06-04 16:58:31,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 539 flow [2024-06-04 16:58:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:58:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:58:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2024-06-04 16:58:31,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33640552995391704 [2024-06-04 16:58:31,531 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 383 flow. Second operand 7 states and 73 transitions. [2024-06-04 16:58:31,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 539 flow [2024-06-04 16:58:31,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 512 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 16:58:31,536 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 409 flow [2024-06-04 16:58:31,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=409, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2024-06-04 16:58:31,536 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2024-06-04 16:58:31,537 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 409 flow [2024-06-04 16:58:31,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:31,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:31,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:31,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 16:58:31,537 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:31,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:31,538 INFO L85 PathProgramCache]: Analyzing trace with hash -455573764, now seen corresponding path program 4 times [2024-06-04 16:58:31,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:31,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818504108] [2024-06-04 16:58:31,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:31,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:35,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:35,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818504108] [2024-06-04 16:58:35,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818504108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:35,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:35,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:58:35,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32487791] [2024-06-04 16:58:35,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:35,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:58:35,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:35,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:58:35,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:58:35,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:58:35,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 409 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:35,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:35,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:58:35,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:35,876 INFO L124 PetriNetUnfolderBase]: 208/377 cut-off events. [2024-06-04 16:58:35,876 INFO L125 PetriNetUnfolderBase]: For 2811/2814 co-relation queries the response was YES. [2024-06-04 16:58:35,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 377 events. 208/377 cut-off events. For 2811/2814 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1335 event pairs, 44 based on Foata normal form. 4/378 useless extension candidates. Maximal degree in co-relation 1735. Up to 286 conditions per place. [2024-06-04 16:58:35,879 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 43 selfloop transitions, 28 changer transitions 0/73 dead transitions. [2024-06-04 16:58:35,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 73 transitions, 635 flow [2024-06-04 16:58:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:58:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:58:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-04 16:58:35,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355 [2024-06-04 16:58:35,880 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 409 flow. Second operand 8 states and 89 transitions. [2024-06-04 16:58:35,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 73 transitions, 635 flow [2024-06-04 16:58:35,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 73 transitions, 598 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-04 16:58:35,885 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 457 flow [2024-06-04 16:58:35,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=457, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2024-06-04 16:58:35,885 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2024-06-04 16:58:35,886 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 457 flow [2024-06-04 16:58:35,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:35,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:35,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:35,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 16:58:35,887 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:35,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:35,887 INFO L85 PathProgramCache]: Analyzing trace with hash 23398478, now seen corresponding path program 3 times [2024-06-04 16:58:35,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:35,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421076414] [2024-06-04 16:58:35,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:35,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:39,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:39,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421076414] [2024-06-04 16:58:39,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421076414] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:39,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:39,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:58:39,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037146110] [2024-06-04 16:58:39,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:39,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:58:39,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:39,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:58:39,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:58:40,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:58:40,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 59 transitions, 457 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:40,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:40,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:58:40,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:40,233 INFO L124 PetriNetUnfolderBase]: 206/374 cut-off events. [2024-06-04 16:58:40,233 INFO L125 PetriNetUnfolderBase]: For 3149/3152 co-relation queries the response was YES. [2024-06-04 16:58:40,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 374 events. 206/374 cut-off events. For 3149/3152 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1320 event pairs, 45 based on Foata normal form. 3/374 useless extension candidates. Maximal degree in co-relation 1799. Up to 329 conditions per place. [2024-06-04 16:58:40,236 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 48 selfloop transitions, 20 changer transitions 0/70 dead transitions. [2024-06-04 16:58:40,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 70 transitions, 639 flow [2024-06-04 16:58:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:58:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:58:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-04 16:58:40,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34101382488479265 [2024-06-04 16:58:40,237 INFO L175 Difference]: Start difference. First operand has 72 places, 59 transitions, 457 flow. Second operand 7 states and 74 transitions. [2024-06-04 16:58:40,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 70 transitions, 639 flow [2024-06-04 16:58:40,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 570 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 16:58:40,242 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 476 flow [2024-06-04 16:58:40,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2024-06-04 16:58:40,243 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2024-06-04 16:58:40,243 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 476 flow [2024-06-04 16:58:40,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:40,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:40,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:40,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 16:58:40,244 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:40,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash -455327500, now seen corresponding path program 1 times [2024-06-04 16:58:40,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:40,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230326202] [2024-06-04 16:58:40,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:44,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:44,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230326202] [2024-06-04 16:58:44,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230326202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:44,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:44,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:58:44,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458314050] [2024-06-04 16:58:44,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:44,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:58:44,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:44,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:58:44,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:58:45,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:58:45,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 476 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:45,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:45,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:58:45,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:45,331 INFO L124 PetriNetUnfolderBase]: 204/370 cut-off events. [2024-06-04 16:58:45,331 INFO L125 PetriNetUnfolderBase]: For 3419/3419 co-relation queries the response was YES. [2024-06-04 16:58:45,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1831 conditions, 370 events. 204/370 cut-off events. For 3419/3419 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1312 event pairs, 47 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 1793. Up to 348 conditions per place. [2024-06-04 16:58:45,334 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 59 selfloop transitions, 12 changer transitions 0/73 dead transitions. [2024-06-04 16:58:45,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 73 transitions, 648 flow [2024-06-04 16:58:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:58:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:58:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2024-06-04 16:58:45,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3185483870967742 [2024-06-04 16:58:45,336 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 476 flow. Second operand 8 states and 79 transitions. [2024-06-04 16:58:45,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 73 transitions, 648 flow [2024-06-04 16:58:45,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 73 transitions, 618 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-04 16:58:45,341 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 489 flow [2024-06-04 16:58:45,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=489, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2024-06-04 16:58:45,342 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-06-04 16:58:45,342 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 489 flow [2024-06-04 16:58:45,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:45,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:45,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:45,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 16:58:45,342 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:45,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:45,343 INFO L85 PathProgramCache]: Analyzing trace with hash 577446209, now seen corresponding path program 1 times [2024-06-04 16:58:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:45,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665821416] [2024-06-04 16:58:45,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:45,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:49,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:49,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665821416] [2024-06-04 16:58:49,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665821416] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:49,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:49,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:58:49,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57992083] [2024-06-04 16:58:49,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:49,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:58:49,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:49,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:58:49,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:58:49,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:58:49,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 489 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:49,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:49,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:58:49,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:49,932 INFO L124 PetriNetUnfolderBase]: 202/367 cut-off events. [2024-06-04 16:58:49,932 INFO L125 PetriNetUnfolderBase]: For 3583/3583 co-relation queries the response was YES. [2024-06-04 16:58:49,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 367 events. 202/367 cut-off events. For 3583/3583 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1291 event pairs, 40 based on Foata normal form. 1/367 useless extension candidates. Maximal degree in co-relation 1821. Up to 301 conditions per place. [2024-06-04 16:58:49,936 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 56 selfloop transitions, 20 changer transitions 0/78 dead transitions. [2024-06-04 16:58:49,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 78 transitions, 679 flow [2024-06-04 16:58:49,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:58:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:58:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-04 16:58:49,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3640552995391705 [2024-06-04 16:58:49,937 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 489 flow. Second operand 7 states and 79 transitions. [2024-06-04 16:58:49,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 78 transitions, 679 flow [2024-06-04 16:58:49,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 78 transitions, 624 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 16:58:49,944 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 486 flow [2024-06-04 16:58:49,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=486, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2024-06-04 16:58:49,945 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-06-04 16:58:49,945 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 486 flow [2024-06-04 16:58:49,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:49,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:49,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:49,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 16:58:49,947 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:49,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:49,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2920132, now seen corresponding path program 1 times [2024-06-04 16:58:49,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:49,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020890947] [2024-06-04 16:58:49,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:49,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:54,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:54,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020890947] [2024-06-04 16:58:54,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020890947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:54,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:54,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:58:54,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590034433] [2024-06-04 16:58:54,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:54,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:58:54,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:54,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:58:54,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:58:54,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:58:54,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 486 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:54,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:54,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:58:54,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:54,783 INFO L124 PetriNetUnfolderBase]: 222/403 cut-off events. [2024-06-04 16:58:54,783 INFO L125 PetriNetUnfolderBase]: For 4304/4304 co-relation queries the response was YES. [2024-06-04 16:58:54,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2073 conditions, 403 events. 222/403 cut-off events. For 4304/4304 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1476 event pairs, 47 based on Foata normal form. 2/401 useless extension candidates. Maximal degree in co-relation 2033. Up to 331 conditions per place. [2024-06-04 16:58:54,787 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 63 selfloop transitions, 24 changer transitions 0/89 dead transitions. [2024-06-04 16:58:54,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 89 transitions, 816 flow [2024-06-04 16:58:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:58:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:58:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 16:58:54,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-04 16:58:54,789 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 486 flow. Second operand 9 states and 96 transitions. [2024-06-04 16:58:54,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 89 transitions, 816 flow [2024-06-04 16:58:54,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 89 transitions, 754 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-04 16:58:54,796 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 637 flow [2024-06-04 16:58:54,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=637, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2024-06-04 16:58:54,797 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-04 16:58:54,797 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 637 flow [2024-06-04 16:58:54,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:54,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:54,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:54,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 16:58:54,798 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:54,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1466247788, now seen corresponding path program 2 times [2024-06-04 16:58:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:54,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453778036] [2024-06-04 16:58:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:58:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:58:58,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:58:58,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453778036] [2024-06-04 16:58:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453778036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:58:58,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:58:58,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:58:58,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683783266] [2024-06-04 16:58:58,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:58:58,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:58:58,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:58:58,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:58:58,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:58:58,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:58:58,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 77 transitions, 637 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:58,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:58:58,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:58:58,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:58:59,117 INFO L124 PetriNetUnfolderBase]: 228/414 cut-off events. [2024-06-04 16:58:59,117 INFO L125 PetriNetUnfolderBase]: For 4923/4923 co-relation queries the response was YES. [2024-06-04 16:58:59,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2238 conditions, 414 events. 228/414 cut-off events. For 4923/4923 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1538 event pairs, 44 based on Foata normal form. 2/415 useless extension candidates. Maximal degree in co-relation 2192. Up to 317 conditions per place. [2024-06-04 16:58:59,122 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 59 selfloop transitions, 33 changer transitions 0/94 dead transitions. [2024-06-04 16:58:59,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 94 transitions, 895 flow [2024-06-04 16:58:59,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:58:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:58:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-04 16:58:59,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 16:58:59,124 INFO L175 Difference]: Start difference. First operand has 87 places, 77 transitions, 637 flow. Second operand 8 states and 96 transitions. [2024-06-04 16:58:59,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 94 transitions, 895 flow [2024-06-04 16:58:59,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 94 transitions, 851 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-06-04 16:58:59,132 INFO L231 Difference]: Finished difference. Result has 93 places, 79 transitions, 694 flow [2024-06-04 16:58:59,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=694, PETRI_PLACES=93, PETRI_TRANSITIONS=79} [2024-06-04 16:58:59,133 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2024-06-04 16:58:59,133 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 79 transitions, 694 flow [2024-06-04 16:58:59,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:58:59,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:58:59,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:58:59,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 16:58:59,134 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:58:59,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:58:59,135 INFO L85 PathProgramCache]: Analyzing trace with hash -634876266, now seen corresponding path program 3 times [2024-06-04 16:58:59,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:58:59,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467885756] [2024-06-04 16:58:59,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:58:59,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:58:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:03,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:03,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467885756] [2024-06-04 16:59:03,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467885756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:03,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:03,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524182252] [2024-06-04 16:59:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:03,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:03,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:03,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:03,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:03,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:59:03,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 79 transitions, 694 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:03,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:03,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:59:03,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:03,414 INFO L124 PetriNetUnfolderBase]: 240/433 cut-off events. [2024-06-04 16:59:03,414 INFO L125 PetriNetUnfolderBase]: For 5694/5694 co-relation queries the response was YES. [2024-06-04 16:59:03,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2412 conditions, 433 events. 240/433 cut-off events. For 5694/5694 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1627 event pairs, 76 based on Foata normal form. 2/434 useless extension candidates. Maximal degree in co-relation 2364. Up to 398 conditions per place. [2024-06-04 16:59:03,419 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 79 selfloop transitions, 17 changer transitions 0/98 dead transitions. [2024-06-04 16:59:03,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 98 transitions, 976 flow [2024-06-04 16:59:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:59:03,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:59:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2024-06-04 16:59:03,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32974910394265233 [2024-06-04 16:59:03,421 INFO L175 Difference]: Start difference. First operand has 93 places, 79 transitions, 694 flow. Second operand 9 states and 92 transitions. [2024-06-04 16:59:03,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 98 transitions, 976 flow [2024-06-04 16:59:03,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 98 transitions, 893 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-04 16:59:03,431 INFO L231 Difference]: Finished difference. Result has 98 places, 85 transitions, 718 flow [2024-06-04 16:59:03,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=718, PETRI_PLACES=98, PETRI_TRANSITIONS=85} [2024-06-04 16:59:03,431 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 68 predicate places. [2024-06-04 16:59:03,431 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 85 transitions, 718 flow [2024-06-04 16:59:03,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:03,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:03,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:03,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 16:59:03,432 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:59:03,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:03,433 INFO L85 PathProgramCache]: Analyzing trace with hash -634876049, now seen corresponding path program 1 times [2024-06-04 16:59:03,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:03,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240666846] [2024-06-04 16:59:03,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:03,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:07,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:07,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240666846] [2024-06-04 16:59:07,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240666846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:07,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:07,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:07,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344335978] [2024-06-04 16:59:07,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:07,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:07,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:07,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:07,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:07,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:59:07,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 85 transitions, 718 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:07,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:07,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:59:07,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:08,157 INFO L124 PetriNetUnfolderBase]: 243/438 cut-off events. [2024-06-04 16:59:08,157 INFO L125 PetriNetUnfolderBase]: For 5471/5471 co-relation queries the response was YES. [2024-06-04 16:59:08,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2398 conditions, 438 events. 243/438 cut-off events. For 5471/5471 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1643 event pairs, 75 based on Foata normal form. 1/438 useless extension candidates. Maximal degree in co-relation 2347. Up to 406 conditions per place. [2024-06-04 16:59:08,162 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 80 selfloop transitions, 17 changer transitions 0/99 dead transitions. [2024-06-04 16:59:08,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 966 flow [2024-06-04 16:59:08,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:59:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:59:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-04 16:59:08,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32616487455197135 [2024-06-04 16:59:08,164 INFO L175 Difference]: Start difference. First operand has 98 places, 85 transitions, 718 flow. Second operand 9 states and 91 transitions. [2024-06-04 16:59:08,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 966 flow [2024-06-04 16:59:08,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 99 transitions, 923 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 16:59:08,173 INFO L231 Difference]: Finished difference. Result has 102 places, 87 transitions, 736 flow [2024-06-04 16:59:08,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=736, PETRI_PLACES=102, PETRI_TRANSITIONS=87} [2024-06-04 16:59:08,173 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2024-06-04 16:59:08,174 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 87 transitions, 736 flow [2024-06-04 16:59:08,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:08,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:08,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:08,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 16:59:08,175 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:59:08,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1141228112, now seen corresponding path program 4 times [2024-06-04 16:59:08,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:08,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833159553] [2024-06-04 16:59:08,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:08,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:12,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:12,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833159553] [2024-06-04 16:59:12,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833159553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:12,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:12,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:12,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267296738] [2024-06-04 16:59:12,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:12,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:12,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:12,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:12,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 16:59:12,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 87 transitions, 736 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:12,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:12,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 16:59:12,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:12,601 INFO L124 PetriNetUnfolderBase]: 249/449 cut-off events. [2024-06-04 16:59:12,601 INFO L125 PetriNetUnfolderBase]: For 6060/6060 co-relation queries the response was YES. [2024-06-04 16:59:12,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 449 events. 249/449 cut-off events. For 6060/6060 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1680 event pairs, 45 based on Foata normal form. 2/450 useless extension candidates. Maximal degree in co-relation 2439. Up to 343 conditions per place. [2024-06-04 16:59:12,606 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 67 selfloop transitions, 33 changer transitions 0/102 dead transitions. [2024-06-04 16:59:12,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 102 transitions, 1004 flow [2024-06-04 16:59:12,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:59:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:59:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-04 16:59:12,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-04 16:59:12,607 INFO L175 Difference]: Start difference. First operand has 102 places, 87 transitions, 736 flow. Second operand 8 states and 96 transitions. [2024-06-04 16:59:12,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 102 transitions, 1004 flow [2024-06-04 16:59:12,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 102 transitions, 959 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 16:59:12,617 INFO L231 Difference]: Finished difference. Result has 103 places, 89 transitions, 792 flow [2024-06-04 16:59:12,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=792, PETRI_PLACES=103, PETRI_TRANSITIONS=89} [2024-06-04 16:59:12,618 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2024-06-04 16:59:12,618 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 792 flow [2024-06-04 16:59:12,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:12,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:12,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:12,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 16:59:12,619 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:59:12,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:12,619 INFO L85 PathProgramCache]: Analyzing trace with hash 6644999, now seen corresponding path program 2 times [2024-06-04 16:59:12,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:12,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208483785] [2024-06-04 16:59:12,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:12,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:16,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:16,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208483785] [2024-06-04 16:59:16,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208483785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:16,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:16,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:16,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84711155] [2024-06-04 16:59:16,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:16,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:16,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:16,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:16,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:16,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:59:16,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 792 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:16,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:16,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:59:16,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:17,126 INFO L124 PetriNetUnfolderBase]: 255/458 cut-off events. [2024-06-04 16:59:17,126 INFO L125 PetriNetUnfolderBase]: For 6888/6888 co-relation queries the response was YES. [2024-06-04 16:59:17,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2638 conditions, 458 events. 255/458 cut-off events. For 6888/6888 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1734 event pairs, 77 based on Foata normal form. 2/459 useless extension candidates. Maximal degree in co-relation 2585. Up to 412 conditions per place. [2024-06-04 16:59:17,131 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 79 selfloop transitions, 21 changer transitions 0/102 dead transitions. [2024-06-04 16:59:17,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 102 transitions, 1048 flow [2024-06-04 16:59:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:59:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:59:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-04 16:59:17,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3346774193548387 [2024-06-04 16:59:17,133 INFO L175 Difference]: Start difference. First operand has 103 places, 89 transitions, 792 flow. Second operand 8 states and 83 transitions. [2024-06-04 16:59:17,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 102 transitions, 1048 flow [2024-06-04 16:59:17,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 102 transitions, 963 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-04 16:59:17,144 INFO L231 Difference]: Finished difference. Result has 105 places, 91 transitions, 780 flow [2024-06-04 16:59:17,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=780, PETRI_PLACES=105, PETRI_TRANSITIONS=91} [2024-06-04 16:59:17,145 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 75 predicate places. [2024-06-04 16:59:17,145 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 91 transitions, 780 flow [2024-06-04 16:59:17,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:17,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:17,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:17,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 16:59:17,146 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:59:17,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:17,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1860979188, now seen corresponding path program 5 times [2024-06-04 16:59:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:17,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057237758] [2024-06-04 16:59:17,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:17,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:20,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:20,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057237758] [2024-06-04 16:59:20,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057237758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:20,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:20,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:20,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674214759] [2024-06-04 16:59:20,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:20,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:20,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:20,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:20,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:21,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:59:21,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 91 transitions, 780 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:21,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:21,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:59:21,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:21,335 INFO L124 PetriNetUnfolderBase]: 261/468 cut-off events. [2024-06-04 16:59:21,335 INFO L125 PetriNetUnfolderBase]: For 7362/7362 co-relation queries the response was YES. [2024-06-04 16:59:21,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 468 events. 261/468 cut-off events. For 7362/7362 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1789 event pairs, 77 based on Foata normal form. 2/469 useless extension candidates. Maximal degree in co-relation 2647. Up to 421 conditions per place. [2024-06-04 16:59:21,340 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 80 selfloop transitions, 22 changer transitions 0/104 dead transitions. [2024-06-04 16:59:21,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 1048 flow [2024-06-04 16:59:21,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:59:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:59:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-04 16:59:21,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3346774193548387 [2024-06-04 16:59:21,342 INFO L175 Difference]: Start difference. First operand has 105 places, 91 transitions, 780 flow. Second operand 8 states and 83 transitions. [2024-06-04 16:59:21,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 104 transitions, 1048 flow [2024-06-04 16:59:21,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 997 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 16:59:21,351 INFO L231 Difference]: Finished difference. Result has 107 places, 93 transitions, 815 flow [2024-06-04 16:59:21,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=815, PETRI_PLACES=107, PETRI_TRANSITIONS=93} [2024-06-04 16:59:21,351 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 77 predicate places. [2024-06-04 16:59:21,352 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 93 transitions, 815 flow [2024-06-04 16:59:21,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:21,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:21,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:21,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 16:59:21,352 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:59:21,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1583038802, now seen corresponding path program 6 times [2024-06-04 16:59:21,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:21,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253809162] [2024-06-04 16:59:21,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:21,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:25,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:25,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253809162] [2024-06-04 16:59:25,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253809162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:25,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:25,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:25,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321374925] [2024-06-04 16:59:25,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:25,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:25,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:25,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:25,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:25,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:59:25,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 93 transitions, 815 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:25,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:25,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:59:25,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:25,546 INFO L124 PetriNetUnfolderBase]: 277/495 cut-off events. [2024-06-04 16:59:25,547 INFO L125 PetriNetUnfolderBase]: For 8863/8863 co-relation queries the response was YES. [2024-06-04 16:59:25,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2963 conditions, 495 events. 277/495 cut-off events. For 8863/8863 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1909 event pairs, 81 based on Foata normal form. 2/494 useless extension candidates. Maximal degree in co-relation 2908. Up to 417 conditions per place. [2024-06-04 16:59:25,550 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 76 selfloop transitions, 30 changer transitions 0/108 dead transitions. [2024-06-04 16:59:25,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 108 transitions, 1173 flow [2024-06-04 16:59:25,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:59:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:59:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-04 16:59:25,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-06-04 16:59:25,552 INFO L175 Difference]: Start difference. First operand has 107 places, 93 transitions, 815 flow. Second operand 8 states and 86 transitions. [2024-06-04 16:59:25,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 108 transitions, 1173 flow [2024-06-04 16:59:25,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 1097 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-04 16:59:25,562 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 878 flow [2024-06-04 16:59:25,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=878, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2024-06-04 16:59:25,562 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 79 predicate places. [2024-06-04 16:59:25,562 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 878 flow [2024-06-04 16:59:25,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:25,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:25,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:25,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 16:59:25,563 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:59:25,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:25,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1230526417, now seen corresponding path program 3 times [2024-06-04 16:59:25,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:25,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206795001] [2024-06-04 16:59:25,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:25,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:29,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:29,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206795001] [2024-06-04 16:59:29,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206795001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:29,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:29,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:29,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089064910] [2024-06-04 16:59:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:29,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:29,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:29,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:29,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:30,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:59:30,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 878 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:30,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:30,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:59:30,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:30,267 INFO L124 PetriNetUnfolderBase]: 285/508 cut-off events. [2024-06-04 16:59:30,268 INFO L125 PetriNetUnfolderBase]: For 8906/8906 co-relation queries the response was YES. [2024-06-04 16:59:30,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3047 conditions, 508 events. 285/508 cut-off events. For 8906/8906 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1973 event pairs, 80 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 2991. Up to 437 conditions per place. [2024-06-04 16:59:30,273 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 80 selfloop transitions, 32 changer transitions 0/114 dead transitions. [2024-06-04 16:59:30,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 1296 flow [2024-06-04 16:59:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:59:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:59:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-04 16:59:30,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-06-04 16:59:30,274 INFO L175 Difference]: Start difference. First operand has 109 places, 97 transitions, 878 flow. Second operand 8 states and 86 transitions. [2024-06-04 16:59:30,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 1296 flow [2024-06-04 16:59:30,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 1244 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-04 16:59:30,290 INFO L231 Difference]: Finished difference. Result has 114 places, 104 transitions, 994 flow [2024-06-04 16:59:30,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=994, PETRI_PLACES=114, PETRI_TRANSITIONS=104} [2024-06-04 16:59:30,291 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 84 predicate places. [2024-06-04 16:59:30,291 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 104 transitions, 994 flow [2024-06-04 16:59:30,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:30,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:30,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:30,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 16:59:30,292 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:59:30,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:30,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1237878284, now seen corresponding path program 7 times [2024-06-04 16:59:30,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:30,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261146720] [2024-06-04 16:59:30,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:30,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:34,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:34,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261146720] [2024-06-04 16:59:34,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261146720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:34,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:34,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:34,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615513879] [2024-06-04 16:59:34,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:34,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:34,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:34,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:34,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:34,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:59:34,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 104 transitions, 994 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:34,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:34,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:59:34,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:34,372 INFO L124 PetriNetUnfolderBase]: 281/502 cut-off events. [2024-06-04 16:59:34,372 INFO L125 PetriNetUnfolderBase]: For 9227/9227 co-relation queries the response was YES. [2024-06-04 16:59:34,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3061 conditions, 502 events. 281/502 cut-off events. For 9227/9227 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1965 event pairs, 80 based on Foata normal form. 2/501 useless extension candidates. Maximal degree in co-relation 3002. Up to 457 conditions per place. [2024-06-04 16:59:34,377 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 91 selfloop transitions, 20 changer transitions 0/113 dead transitions. [2024-06-04 16:59:34,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 113 transitions, 1244 flow [2024-06-04 16:59:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:59:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:59:34,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-04 16:59:34,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33064516129032256 [2024-06-04 16:59:34,379 INFO L175 Difference]: Start difference. First operand has 114 places, 104 transitions, 994 flow. Second operand 8 states and 82 transitions. [2024-06-04 16:59:34,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 113 transitions, 1244 flow [2024-06-04 16:59:34,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 1191 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-04 16:59:34,391 INFO L231 Difference]: Finished difference. Result has 119 places, 104 transitions, 986 flow [2024-06-04 16:59:34,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=986, PETRI_PLACES=119, PETRI_TRANSITIONS=104} [2024-06-04 16:59:34,391 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2024-06-04 16:59:34,392 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 104 transitions, 986 flow [2024-06-04 16:59:34,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:34,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:34,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:34,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 16:59:34,392 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:59:34,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:34,393 INFO L85 PathProgramCache]: Analyzing trace with hash -419445262, now seen corresponding path program 8 times [2024-06-04 16:59:34,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:34,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009420885] [2024-06-04 16:59:34,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:34,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:38,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:38,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009420885] [2024-06-04 16:59:38,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009420885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:38,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:38,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:38,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580385251] [2024-06-04 16:59:38,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:38,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:38,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:38,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:38,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:38,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:59:38,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 104 transitions, 986 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:38,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:38,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:59:38,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:39,173 INFO L124 PetriNetUnfolderBase]: 282/504 cut-off events. [2024-06-04 16:59:39,173 INFO L125 PetriNetUnfolderBase]: For 9551/9551 co-relation queries the response was YES. [2024-06-04 16:59:39,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3095 conditions, 504 events. 282/504 cut-off events. For 9551/9551 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1966 event pairs, 50 based on Foata normal form. 2/505 useless extension candidates. Maximal degree in co-relation 3034. Up to 315 conditions per place. [2024-06-04 16:59:39,177 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 69 selfloop transitions, 52 changer transitions 0/123 dead transitions. [2024-06-04 16:59:39,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 123 transitions, 1386 flow [2024-06-04 16:59:39,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:59:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:59:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-04 16:59:39,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36200716845878134 [2024-06-04 16:59:39,180 INFO L175 Difference]: Start difference. First operand has 119 places, 104 transitions, 986 flow. Second operand 9 states and 101 transitions. [2024-06-04 16:59:39,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 123 transitions, 1386 flow [2024-06-04 16:59:39,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 123 transitions, 1308 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 16:59:39,193 INFO L231 Difference]: Finished difference. Result has 120 places, 108 transitions, 1085 flow [2024-06-04 16:59:39,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1085, PETRI_PLACES=120, PETRI_TRANSITIONS=108} [2024-06-04 16:59:39,194 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 90 predicate places. [2024-06-04 16:59:39,194 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 1085 flow [2024-06-04 16:59:39,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:39,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:39,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:39,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 16:59:39,195 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:59:39,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:39,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1237878067, now seen corresponding path program 4 times [2024-06-04 16:59:39,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:39,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809382355] [2024-06-04 16:59:39,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:39,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:43,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:43,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809382355] [2024-06-04 16:59:43,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809382355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:43,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:43,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:43,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842590302] [2024-06-04 16:59:43,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:43,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:43,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:43,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:43,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:59:43,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 1085 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:43,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:43,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:59:43,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:43,633 INFO L124 PetriNetUnfolderBase]: 283/506 cut-off events. [2024-06-04 16:59:43,633 INFO L125 PetriNetUnfolderBase]: For 10269/10269 co-relation queries the response was YES. [2024-06-04 16:59:43,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3162 conditions, 506 events. 283/506 cut-off events. For 10269/10269 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1998 event pairs, 81 based on Foata normal form. 2/505 useless extension candidates. Maximal degree in co-relation 3101. Up to 461 conditions per place. [2024-06-04 16:59:43,638 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 96 selfloop transitions, 21 changer transitions 0/119 dead transitions. [2024-06-04 16:59:43,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 119 transitions, 1378 flow [2024-06-04 16:59:43,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:59:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:59:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2024-06-04 16:59:43,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33064516129032256 [2024-06-04 16:59:43,640 INFO L175 Difference]: Start difference. First operand has 120 places, 108 transitions, 1085 flow. Second operand 8 states and 82 transitions. [2024-06-04 16:59:43,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 119 transitions, 1378 flow [2024-06-04 16:59:43,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 119 transitions, 1302 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-04 16:59:43,657 INFO L231 Difference]: Finished difference. Result has 123 places, 110 transitions, 1087 flow [2024-06-04 16:59:43,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1087, PETRI_PLACES=123, PETRI_TRANSITIONS=110} [2024-06-04 16:59:43,658 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 93 predicate places. [2024-06-04 16:59:43,659 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 110 transitions, 1087 flow [2024-06-04 16:59:43,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:43,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:43,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:43,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 16:59:43,659 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:59:43,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash -411820905, now seen corresponding path program 5 times [2024-06-04 16:59:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:43,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988941843] [2024-06-04 16:59:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:43,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:47,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:47,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988941843] [2024-06-04 16:59:47,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988941843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:47,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:47,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:59:47,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85811016] [2024-06-04 16:59:47,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:47,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:59:47,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:47,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:59:47,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:59:48,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:59:48,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 110 transitions, 1087 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:48,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:48,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:59:48,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:48,321 INFO L124 PetriNetUnfolderBase]: 281/503 cut-off events. [2024-06-04 16:59:48,321 INFO L125 PetriNetUnfolderBase]: For 9947/9947 co-relation queries the response was YES. [2024-06-04 16:59:48,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 503 events. 281/503 cut-off events. For 9947/9947 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1974 event pairs, 96 based on Foata normal form. 1/503 useless extension candidates. Maximal degree in co-relation 3073. Up to 478 conditions per place. [2024-06-04 16:59:48,325 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 103 selfloop transitions, 13 changer transitions 0/118 dead transitions. [2024-06-04 16:59:48,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 118 transitions, 1343 flow [2024-06-04 16:59:48,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:59:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:59:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2024-06-04 16:59:48,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3185483870967742 [2024-06-04 16:59:48,326 INFO L175 Difference]: Start difference. First operand has 123 places, 110 transitions, 1087 flow. Second operand 8 states and 79 transitions. [2024-06-04 16:59:48,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 118 transitions, 1343 flow [2024-06-04 16:59:48,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 118 transitions, 1263 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-04 16:59:48,339 INFO L231 Difference]: Finished difference. Result has 125 places, 110 transitions, 1038 flow [2024-06-04 16:59:48,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1038, PETRI_PLACES=125, PETRI_TRANSITIONS=110} [2024-06-04 16:59:48,339 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 95 predicate places. [2024-06-04 16:59:48,339 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 110 transitions, 1038 flow [2024-06-04 16:59:48,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:48,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:48,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:48,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 16:59:48,340 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:59:48,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1230249587, now seen corresponding path program 1 times [2024-06-04 16:59:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:48,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020371593] [2024-06-04 16:59:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:53,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:53,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020371593] [2024-06-04 16:59:53,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020371593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:53,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:53,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:59:53,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979709641] [2024-06-04 16:59:53,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:53,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:59:53,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:53,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:59:53,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:59:53,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:59:53,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 110 transitions, 1038 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:53,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:53,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:59:53,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:53,502 INFO L124 PetriNetUnfolderBase]: 278/497 cut-off events. [2024-06-04 16:59:53,502 INFO L125 PetriNetUnfolderBase]: For 10143/10143 co-relation queries the response was YES. [2024-06-04 16:59:53,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 497 events. 278/497 cut-off events. For 10143/10143 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1941 event pairs, 95 based on Foata normal form. 2/498 useless extension candidates. Maximal degree in co-relation 2973. Up to 467 conditions per place. [2024-06-04 16:59:53,506 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 104 selfloop transitions, 14 changer transitions 0/120 dead transitions. [2024-06-04 16:59:53,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 120 transitions, 1302 flow [2024-06-04 16:59:53,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:59:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:59:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2024-06-04 16:59:53,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30824372759856633 [2024-06-04 16:59:53,507 INFO L175 Difference]: Start difference. First operand has 125 places, 110 transitions, 1038 flow. Second operand 9 states and 86 transitions. [2024-06-04 16:59:53,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 120 transitions, 1302 flow [2024-06-04 16:59:53,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 120 transitions, 1271 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 16:59:53,526 INFO L231 Difference]: Finished difference. Result has 127 places, 110 transitions, 1039 flow [2024-06-04 16:59:53,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1039, PETRI_PLACES=127, PETRI_TRANSITIONS=110} [2024-06-04 16:59:53,527 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2024-06-04 16:59:53,527 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 110 transitions, 1039 flow [2024-06-04 16:59:53,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:53,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:53,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:53,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 16:59:53,528 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:59:53,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:53,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1128295633, now seen corresponding path program 1 times [2024-06-04 16:59:53,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:53,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647483662] [2024-06-04 16:59:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:53,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:59:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:59:57,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:59:57,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647483662] [2024-06-04 16:59:57,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647483662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:59:57,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:59:57,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:59:57,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259723647] [2024-06-04 16:59:57,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:59:57,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:59:57,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:59:57,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:59:57,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:59:57,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 16:59:57,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 110 transitions, 1039 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:57,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:59:57,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 16:59:57,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:59:57,834 INFO L124 PetriNetUnfolderBase]: 287/518 cut-off events. [2024-06-04 16:59:57,834 INFO L125 PetriNetUnfolderBase]: For 10968/10968 co-relation queries the response was YES. [2024-06-04 16:59:57,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3138 conditions, 518 events. 287/518 cut-off events. For 10968/10968 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2096 event pairs, 64 based on Foata normal form. 2/519 useless extension candidates. Maximal degree in co-relation 3073. Up to 440 conditions per place. [2024-06-04 16:59:57,838 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 105 selfloop transitions, 23 changer transitions 0/130 dead transitions. [2024-06-04 16:59:57,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 130 transitions, 1372 flow [2024-06-04 16:59:57,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:59:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:59:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 16:59:57,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-04 16:59:57,839 INFO L175 Difference]: Start difference. First operand has 127 places, 110 transitions, 1039 flow. Second operand 9 states and 97 transitions. [2024-06-04 16:59:57,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 130 transitions, 1372 flow [2024-06-04 16:59:57,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 130 transitions, 1338 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 16:59:57,854 INFO L231 Difference]: Finished difference. Result has 131 places, 113 transitions, 1100 flow [2024-06-04 16:59:57,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1100, PETRI_PLACES=131, PETRI_TRANSITIONS=113} [2024-06-04 16:59:57,854 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 101 predicate places. [2024-06-04 16:59:57,855 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 113 transitions, 1100 flow [2024-06-04 16:59:57,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:59:57,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:59:57,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:59:57,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 16:59:57,855 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:59:57,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:59:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1693774289, now seen corresponding path program 1 times [2024-06-04 16:59:57,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:59:57,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203464950] [2024-06-04 16:59:57,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:59:57,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:59:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:02,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:02,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203464950] [2024-06-04 17:00:02,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203464950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:02,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:02,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:00:02,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896273324] [2024-06-04 17:00:02,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:02,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:00:02,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:02,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:00:02,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:00:02,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:00:02,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 113 transitions, 1100 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:02,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:02,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:00:02,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:02,893 INFO L124 PetriNetUnfolderBase]: 299/538 cut-off events. [2024-06-04 17:00:02,893 INFO L125 PetriNetUnfolderBase]: For 11360/11360 co-relation queries the response was YES. [2024-06-04 17:00:02,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3319 conditions, 538 events. 299/538 cut-off events. For 11360/11360 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2214 event pairs, 64 based on Foata normal form. 1/538 useless extension candidates. Maximal degree in co-relation 3251. Up to 458 conditions per place. [2024-06-04 17:00:02,898 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 104 selfloop transitions, 29 changer transitions 0/135 dead transitions. [2024-06-04 17:00:02,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 135 transitions, 1485 flow [2024-06-04 17:00:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:00:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:00:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:00:02,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-04 17:00:02,900 INFO L175 Difference]: Start difference. First operand has 131 places, 113 transitions, 1100 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:00:02,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 135 transitions, 1485 flow [2024-06-04 17:00:02,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 135 transitions, 1435 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-04 17:00:02,926 INFO L231 Difference]: Finished difference. Result has 136 places, 119 transitions, 1202 flow [2024-06-04 17:00:02,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1202, PETRI_PLACES=136, PETRI_TRANSITIONS=119} [2024-06-04 17:00:02,926 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 106 predicate places. [2024-06-04 17:00:02,927 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 119 transitions, 1202 flow [2024-06-04 17:00:02,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:02,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:02,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:02,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:00:02,927 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:00:02,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1118049823, now seen corresponding path program 2 times [2024-06-04 17:00:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:02,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6472336] [2024-06-04 17:00:02,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:02,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:07,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:07,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6472336] [2024-06-04 17:00:07,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6472336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:07,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:07,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:00:07,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593211574] [2024-06-04 17:00:07,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:07,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:00:07,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:07,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:00:07,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:00:07,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:00:07,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 119 transitions, 1202 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:07,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:07,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:00:07,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:07,725 INFO L124 PetriNetUnfolderBase]: 303/546 cut-off events. [2024-06-04 17:00:07,725 INFO L125 PetriNetUnfolderBase]: For 12836/12836 co-relation queries the response was YES. [2024-06-04 17:00:07,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3415 conditions, 546 events. 303/546 cut-off events. For 12836/12836 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2258 event pairs, 69 based on Foata normal form. 2/547 useless extension candidates. Maximal degree in co-relation 3346. Up to 469 conditions per place. [2024-06-04 17:00:07,732 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 108 selfloop transitions, 26 changer transitions 0/136 dead transitions. [2024-06-04 17:00:07,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 136 transitions, 1535 flow [2024-06-04 17:00:07,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:00:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:00:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 17:00:07,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-04 17:00:07,734 INFO L175 Difference]: Start difference. First operand has 136 places, 119 transitions, 1202 flow. Second operand 9 states and 97 transitions. [2024-06-04 17:00:07,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 136 transitions, 1535 flow [2024-06-04 17:00:07,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 1447 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-04 17:00:07,762 INFO L231 Difference]: Finished difference. Result has 137 places, 120 transitions, 1189 flow [2024-06-04 17:00:07,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1189, PETRI_PLACES=137, PETRI_TRANSITIONS=120} [2024-06-04 17:00:07,763 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places. [2024-06-04 17:00:07,763 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 120 transitions, 1189 flow [2024-06-04 17:00:07,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:07,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:07,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:07,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:00:07,764 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:00:07,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:07,764 INFO L85 PathProgramCache]: Analyzing trace with hash -541078773, now seen corresponding path program 3 times [2024-06-04 17:00:07,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:07,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339883850] [2024-06-04 17:00:07,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:07,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:12,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:12,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:12,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339883850] [2024-06-04 17:00:12,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339883850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:12,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:12,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:00:12,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707929013] [2024-06-04 17:00:12,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:12,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:00:12,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:12,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:00:12,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:00:12,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:00:12,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 120 transitions, 1189 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:12,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:12,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:00:12,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:12,376 INFO L124 PetriNetUnfolderBase]: 312/565 cut-off events. [2024-06-04 17:00:12,377 INFO L125 PetriNetUnfolderBase]: For 13728/13728 co-relation queries the response was YES. [2024-06-04 17:00:12,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3480 conditions, 565 events. 312/565 cut-off events. For 13728/13728 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2380 event pairs, 52 based on Foata normal form. 2/566 useless extension candidates. Maximal degree in co-relation 3412. Up to 459 conditions per place. [2024-06-04 17:00:12,382 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 111 selfloop transitions, 25 changer transitions 0/138 dead transitions. [2024-06-04 17:00:12,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 138 transitions, 1525 flow [2024-06-04 17:00:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:00:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:00:12,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-04 17:00:12,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33691756272401435 [2024-06-04 17:00:12,383 INFO L175 Difference]: Start difference. First operand has 137 places, 120 transitions, 1189 flow. Second operand 9 states and 94 transitions. [2024-06-04 17:00:12,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 138 transitions, 1525 flow [2024-06-04 17:00:12,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 138 transitions, 1462 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:00:12,411 INFO L231 Difference]: Finished difference. Result has 139 places, 122 transitions, 1206 flow [2024-06-04 17:00:12,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1206, PETRI_PLACES=139, PETRI_TRANSITIONS=122} [2024-06-04 17:00:12,412 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2024-06-04 17:00:12,412 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 122 transitions, 1206 flow [2024-06-04 17:00:12,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:12,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:12,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:12,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:00:12,412 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:00:12,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash -81736695, now seen corresponding path program 1 times [2024-06-04 17:00:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:12,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465561032] [2024-06-04 17:00:12,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:16,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:16,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465561032] [2024-06-04 17:00:16,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465561032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:16,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:16,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:00:16,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783589176] [2024-06-04 17:00:16,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:16,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:00:16,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:16,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:00:16,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:00:17,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:00:17,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 122 transitions, 1206 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:17,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:17,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:00:17,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:17,288 INFO L124 PetriNetUnfolderBase]: 318/576 cut-off events. [2024-06-04 17:00:17,288 INFO L125 PetriNetUnfolderBase]: For 14528/14528 co-relation queries the response was YES. [2024-06-04 17:00:17,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3544 conditions, 576 events. 318/576 cut-off events. For 14528/14528 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2454 event pairs, 53 based on Foata normal form. 2/577 useless extension candidates. Maximal degree in co-relation 3475. Up to 493 conditions per place. [2024-06-04 17:00:17,292 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 110 selfloop transitions, 31 changer transitions 0/143 dead transitions. [2024-06-04 17:00:17,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 143 transitions, 1580 flow [2024-06-04 17:00:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:00:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:00:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:00:17,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-04 17:00:17,293 INFO L175 Difference]: Start difference. First operand has 139 places, 122 transitions, 1206 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:00:17,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 143 transitions, 1580 flow [2024-06-04 17:00:17,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 143 transitions, 1506 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:00:17,315 INFO L231 Difference]: Finished difference. Result has 143 places, 126 transitions, 1258 flow [2024-06-04 17:00:17,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1258, PETRI_PLACES=143, PETRI_TRANSITIONS=126} [2024-06-04 17:00:17,316 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 113 predicate places. [2024-06-04 17:00:17,316 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 126 transitions, 1258 flow [2024-06-04 17:00:17,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:17,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:17,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:17,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:00:17,317 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:00:17,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:17,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1729116271, now seen corresponding path program 4 times [2024-06-04 17:00:17,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:17,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160603769] [2024-06-04 17:00:17,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:17,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:21,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:21,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160603769] [2024-06-04 17:00:21,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160603769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:21,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:21,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:00:21,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000830282] [2024-06-04 17:00:21,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:21,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:00:21,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:21,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:00:21,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:00:21,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:00:21,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 126 transitions, 1258 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:21,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:21,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:00:21,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:21,981 INFO L124 PetriNetUnfolderBase]: 327/594 cut-off events. [2024-06-04 17:00:21,981 INFO L125 PetriNetUnfolderBase]: For 15292/15292 co-relation queries the response was YES. [2024-06-04 17:00:21,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3670 conditions, 594 events. 327/594 cut-off events. For 15292/15292 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2576 event pairs, 51 based on Foata normal form. 2/595 useless extension candidates. Maximal degree in co-relation 3600. Up to 516 conditions per place. [2024-06-04 17:00:21,985 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 118 selfloop transitions, 23 changer transitions 0/143 dead transitions. [2024-06-04 17:00:21,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 143 transitions, 1606 flow [2024-06-04 17:00:21,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:00:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:00:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:00:21,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-04 17:00:21,989 INFO L175 Difference]: Start difference. First operand has 143 places, 126 transitions, 1258 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:00:21,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 143 transitions, 1606 flow [2024-06-04 17:00:22,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 143 transitions, 1520 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 17:00:22,021 INFO L231 Difference]: Finished difference. Result has 147 places, 128 transitions, 1254 flow [2024-06-04 17:00:22,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1172, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1254, PETRI_PLACES=147, PETRI_TRANSITIONS=128} [2024-06-04 17:00:22,022 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2024-06-04 17:00:22,022 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 128 transitions, 1254 flow [2024-06-04 17:00:22,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:22,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:22,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:22,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:00:22,023 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:00:22,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:22,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1136424781, now seen corresponding path program 5 times [2024-06-04 17:00:22,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:22,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072683666] [2024-06-04 17:00:22,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:22,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:26,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:26,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072683666] [2024-06-04 17:00:26,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072683666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:26,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:26,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:00:26,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933777324] [2024-06-04 17:00:26,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:26,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:00:26,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:26,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:00:26,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:00:26,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:00:26,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 128 transitions, 1254 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:26,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:26,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:00:26,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:26,662 INFO L124 PetriNetUnfolderBase]: 334/607 cut-off events. [2024-06-04 17:00:26,663 INFO L125 PetriNetUnfolderBase]: For 16471/16471 co-relation queries the response was YES. [2024-06-04 17:00:26,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3745 conditions, 607 events. 334/607 cut-off events. For 16471/16471 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2677 event pairs, 84 based on Foata normal form. 2/608 useless extension candidates. Maximal degree in co-relation 3673. Up to 555 conditions per place. [2024-06-04 17:00:26,667 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 124 selfloop transitions, 19 changer transitions 0/145 dead transitions. [2024-06-04 17:00:26,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 145 transitions, 1620 flow [2024-06-04 17:00:26,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:00:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:00:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-04 17:00:26,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33691756272401435 [2024-06-04 17:00:26,676 INFO L175 Difference]: Start difference. First operand has 147 places, 128 transitions, 1254 flow. Second operand 9 states and 94 transitions. [2024-06-04 17:00:26,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 145 transitions, 1620 flow [2024-06-04 17:00:26,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 145 transitions, 1568 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-04 17:00:26,712 INFO L231 Difference]: Finished difference. Result has 152 places, 131 transitions, 1299 flow [2024-06-04 17:00:26,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1299, PETRI_PLACES=152, PETRI_TRANSITIONS=131} [2024-06-04 17:00:26,713 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 122 predicate places. [2024-06-04 17:00:26,713 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 131 transitions, 1299 flow [2024-06-04 17:00:26,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:26,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:26,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:26,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:00:26,714 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:00:26,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1136424657, now seen corresponding path program 2 times [2024-06-04 17:00:26,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:26,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171687411] [2024-06-04 17:00:26,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:26,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:31,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:31,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171687411] [2024-06-04 17:00:31,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171687411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:31,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:31,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:00:31,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956669337] [2024-06-04 17:00:31,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:31,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:00:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:31,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:00:31,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:00:31,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:00:31,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 131 transitions, 1299 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:31,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:31,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:00:31,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:31,414 INFO L124 PetriNetUnfolderBase]: 337/612 cut-off events. [2024-06-04 17:00:31,415 INFO L125 PetriNetUnfolderBase]: For 16710/16710 co-relation queries the response was YES. [2024-06-04 17:00:31,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3806 conditions, 612 events. 337/612 cut-off events. For 16710/16710 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2707 event pairs, 51 based on Foata normal form. 1/612 useless extension candidates. Maximal degree in co-relation 3732. Up to 532 conditions per place. [2024-06-04 17:00:31,421 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 116 selfloop transitions, 29 changer transitions 0/147 dead transitions. [2024-06-04 17:00:31,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 147 transitions, 1669 flow [2024-06-04 17:00:31,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:00:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:00:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 17:00:31,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-04 17:00:31,422 INFO L175 Difference]: Start difference. First operand has 152 places, 131 transitions, 1299 flow. Second operand 9 states and 99 transitions. [2024-06-04 17:00:31,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 147 transitions, 1669 flow [2024-06-04 17:00:31,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 147 transitions, 1616 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-04 17:00:31,463 INFO L231 Difference]: Finished difference. Result has 155 places, 133 transitions, 1356 flow [2024-06-04 17:00:31,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1356, PETRI_PLACES=155, PETRI_TRANSITIONS=133} [2024-06-04 17:00:31,463 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places. [2024-06-04 17:00:31,464 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 133 transitions, 1356 flow [2024-06-04 17:00:31,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:31,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:31,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:31,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:00:31,464 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:00:31,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1133623311, now seen corresponding path program 2 times [2024-06-04 17:00:31,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:31,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51804186] [2024-06-04 17:00:31,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:31,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:35,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:35,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51804186] [2024-06-04 17:00:35,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51804186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:35,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:35,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:00:35,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15064838] [2024-06-04 17:00:35,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:35,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:00:35,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:35,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:00:35,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:00:35,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:00:35,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 133 transitions, 1356 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:35,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:35,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:00:35,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:35,893 INFO L124 PetriNetUnfolderBase]: 343/623 cut-off events. [2024-06-04 17:00:35,893 INFO L125 PetriNetUnfolderBase]: For 18213/18213 co-relation queries the response was YES. [2024-06-04 17:00:35,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 623 events. 343/623 cut-off events. For 18213/18213 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2768 event pairs, 53 based on Foata normal form. 2/624 useless extension candidates. Maximal degree in co-relation 3812. Up to 540 conditions per place. [2024-06-04 17:00:35,899 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 121 selfloop transitions, 28 changer transitions 0/151 dead transitions. [2024-06-04 17:00:35,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 151 transitions, 1730 flow [2024-06-04 17:00:35,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:00:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:00:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:00:35,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-04 17:00:35,900 INFO L175 Difference]: Start difference. First operand has 155 places, 133 transitions, 1356 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:00:35,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 151 transitions, 1730 flow [2024-06-04 17:00:35,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 151 transitions, 1639 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-04 17:00:35,941 INFO L231 Difference]: Finished difference. Result has 157 places, 135 transitions, 1360 flow [2024-06-04 17:00:35,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1265, 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=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1360, PETRI_PLACES=157, PETRI_TRANSITIONS=135} [2024-06-04 17:00:35,941 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places. [2024-06-04 17:00:35,941 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 135 transitions, 1360 flow [2024-06-04 17:00:35,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:35,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:35,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:35,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:00:35,942 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:00:35,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:35,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1018159161, now seen corresponding path program 3 times [2024-06-04 17:00:35,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:35,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528570410] [2024-06-04 17:00:35,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:35,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:39,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:39,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528570410] [2024-06-04 17:00:39,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528570410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:39,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:39,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:00:39,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53516414] [2024-06-04 17:00:39,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:39,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:00:39,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:39,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:00:39,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:00:39,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:00:39,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 135 transitions, 1360 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:39,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:39,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:00:39,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:40,117 INFO L124 PetriNetUnfolderBase]: 382/685 cut-off events. [2024-06-04 17:00:40,117 INFO L125 PetriNetUnfolderBase]: For 23303/23303 co-relation queries the response was YES. [2024-06-04 17:00:40,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4464 conditions, 685 events. 382/685 cut-off events. For 23303/23303 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3068 event pairs, 90 based on Foata normal form. 2/686 useless extension candidates. Maximal degree in co-relation 4389. Up to 599 conditions per place. [2024-06-04 17:00:40,122 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 133 selfloop transitions, 26 changer transitions 0/161 dead transitions. [2024-06-04 17:00:40,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 161 transitions, 1990 flow [2024-06-04 17:00:40,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:00:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:00:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-04 17:00:40,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-04 17:00:40,124 INFO L175 Difference]: Start difference. First operand has 157 places, 135 transitions, 1360 flow. Second operand 10 states and 109 transitions. [2024-06-04 17:00:40,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 161 transitions, 1990 flow [2024-06-04 17:00:40,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 161 transitions, 1905 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-04 17:00:40,174 INFO L231 Difference]: Finished difference. Result has 160 places, 144 transitions, 1469 flow [2024-06-04 17:00:40,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1469, PETRI_PLACES=160, PETRI_TRANSITIONS=144} [2024-06-04 17:00:40,175 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 130 predicate places. [2024-06-04 17:00:40,175 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 144 transitions, 1469 flow [2024-06-04 17:00:40,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:40,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:40,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:40,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:00:40,176 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:00:40,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:40,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1018152651, now seen corresponding path program 4 times [2024-06-04 17:00:40,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:40,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499861208] [2024-06-04 17:00:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:40,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:44,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:44,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499861208] [2024-06-04 17:00:44,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499861208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:44,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:44,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:00:44,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913041966] [2024-06-04 17:00:44,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:44,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:00:44,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:44,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:00:44,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:00:44,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:00:44,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 144 transitions, 1469 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:44,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:44,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:00:44,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:44,565 INFO L124 PetriNetUnfolderBase]: 374/673 cut-off events. [2024-06-04 17:00:44,565 INFO L125 PetriNetUnfolderBase]: For 23042/23042 co-relation queries the response was YES. [2024-06-04 17:00:44,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4314 conditions, 673 events. 374/673 cut-off events. For 23042/23042 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3023 event pairs, 88 based on Foata normal form. 4/676 useless extension candidates. Maximal degree in co-relation 4237. Up to 595 conditions per place. [2024-06-04 17:00:44,570 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 133 selfloop transitions, 25 changer transitions 0/160 dead transitions. [2024-06-04 17:00:44,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 160 transitions, 1905 flow [2024-06-04 17:00:44,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:00:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:00:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:00:44,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-04 17:00:44,571 INFO L175 Difference]: Start difference. First operand has 160 places, 144 transitions, 1469 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:00:44,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 160 transitions, 1905 flow [2024-06-04 17:00:44,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 160 transitions, 1823 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-04 17:00:44,611 INFO L231 Difference]: Finished difference. Result has 165 places, 144 transitions, 1444 flow [2024-06-04 17:00:44,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1444, PETRI_PLACES=165, PETRI_TRANSITIONS=144} [2024-06-04 17:00:44,612 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2024-06-04 17:00:44,612 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 144 transitions, 1444 flow [2024-06-04 17:00:44,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:44,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:44,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:44,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:00:44,613 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:00:44,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:44,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1018337101, now seen corresponding path program 6 times [2024-06-04 17:00:44,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372184771] [2024-06-04 17:00:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:48,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:48,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372184771] [2024-06-04 17:00:48,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372184771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:48,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:48,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:00:48,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495081097] [2024-06-04 17:00:48,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:48,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:00:48,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:48,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:00:48,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:00:48,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:00:48,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 144 transitions, 1444 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:48,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:48,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:00:48,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:48,699 INFO L124 PetriNetUnfolderBase]: 384/691 cut-off events. [2024-06-04 17:00:48,699 INFO L125 PetriNetUnfolderBase]: For 22919/22919 co-relation queries the response was YES. [2024-06-04 17:00:48,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4400 conditions, 691 events. 384/691 cut-off events. For 22919/22919 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3137 event pairs, 91 based on Foata normal form. 2/692 useless extension candidates. Maximal degree in co-relation 4321. Up to 632 conditions per place. [2024-06-04 17:00:48,704 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 138 selfloop transitions, 23 changer transitions 0/163 dead transitions. [2024-06-04 17:00:48,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 163 transitions, 1848 flow [2024-06-04 17:00:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:00:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:00:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2024-06-04 17:00:48,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33548387096774196 [2024-06-04 17:00:48,705 INFO L175 Difference]: Start difference. First operand has 165 places, 144 transitions, 1444 flow. Second operand 10 states and 104 transitions. [2024-06-04 17:00:48,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 163 transitions, 1848 flow [2024-06-04 17:00:48,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 163 transitions, 1798 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-04 17:00:48,755 INFO L231 Difference]: Finished difference. Result has 168 places, 147 transitions, 1491 flow [2024-06-04 17:00:48,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1394, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1491, PETRI_PLACES=168, PETRI_TRANSITIONS=147} [2024-06-04 17:00:48,756 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 138 predicate places. [2024-06-04 17:00:48,756 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 147 transitions, 1491 flow [2024-06-04 17:00:48,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:48,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:48,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:48,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:00:48,756 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:00:48,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1793500217, now seen corresponding path program 5 times [2024-06-04 17:00:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169338040] [2024-06-04 17:00:48,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:53,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:53,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169338040] [2024-06-04 17:00:53,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169338040] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:53,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:53,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:00:53,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700734797] [2024-06-04 17:00:53,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:53,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:00:53,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:53,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:00:53,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:00:53,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:00:53,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 147 transitions, 1491 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:53,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:53,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:00:53,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:53,799 INFO L124 PetriNetUnfolderBase]: 411/736 cut-off events. [2024-06-04 17:00:53,799 INFO L125 PetriNetUnfolderBase]: For 26325/26325 co-relation queries the response was YES. [2024-06-04 17:00:53,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4819 conditions, 736 events. 411/736 cut-off events. For 26325/26325 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3367 event pairs, 65 based on Foata normal form. 2/737 useless extension candidates. Maximal degree in co-relation 4738. Up to 516 conditions per place. [2024-06-04 17:00:53,804 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 118 selfloop transitions, 51 changer transitions 0/171 dead transitions. [2024-06-04 17:00:53,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 171 transitions, 2055 flow [2024-06-04 17:00:53,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:00:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:00:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 17:00:53,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-04 17:00:53,805 INFO L175 Difference]: Start difference. First operand has 168 places, 147 transitions, 1491 flow. Second operand 10 states and 115 transitions. [2024-06-04 17:00:53,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 171 transitions, 2055 flow [2024-06-04 17:00:53,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 171 transitions, 1992 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:00:53,848 INFO L231 Difference]: Finished difference. Result has 173 places, 153 transitions, 1659 flow [2024-06-04 17:00:53,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1659, PETRI_PLACES=173, PETRI_TRANSITIONS=153} [2024-06-04 17:00:53,849 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 143 predicate places. [2024-06-04 17:00:53,849 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 153 transitions, 1659 flow [2024-06-04 17:00:53,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:53,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:53,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:53,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:00:53,850 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:00:53,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:53,850 INFO L85 PathProgramCache]: Analyzing trace with hash 720903653, now seen corresponding path program 7 times [2024-06-04 17:00:53,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:53,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340861902] [2024-06-04 17:00:53,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:53,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:00:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:00:57,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:00:57,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340861902] [2024-06-04 17:00:57,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340861902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:00:57,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:00:57,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:00:57,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396665980] [2024-06-04 17:00:57,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:00:57,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:00:57,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:00:57,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:00:57,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:00:57,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:00:57,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 153 transitions, 1659 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:57,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:00:57,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:00:57,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:00:58,224 INFO L124 PetriNetUnfolderBase]: 415/743 cut-off events. [2024-06-04 17:00:58,224 INFO L125 PetriNetUnfolderBase]: For 27813/27813 co-relation queries the response was YES. [2024-06-04 17:00:58,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 743 events. 415/743 cut-off events. For 27813/27813 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3408 event pairs, 101 based on Foata normal form. 2/743 useless extension candidates. Maximal degree in co-relation 4976. Up to 680 conditions per place. [2024-06-04 17:00:58,230 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 147 selfloop transitions, 19 changer transitions 0/168 dead transitions. [2024-06-04 17:00:58,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 168 transitions, 2055 flow [2024-06-04 17:00:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:00:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:00:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2024-06-04 17:00:58,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3258064516129032 [2024-06-04 17:00:58,231 INFO L175 Difference]: Start difference. First operand has 173 places, 153 transitions, 1659 flow. Second operand 10 states and 101 transitions. [2024-06-04 17:00:58,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 168 transitions, 2055 flow [2024-06-04 17:00:58,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 168 transitions, 1983 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-04 17:00:58,286 INFO L231 Difference]: Finished difference. Result has 178 places, 154 transitions, 1657 flow [2024-06-04 17:00:58,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1657, PETRI_PLACES=178, PETRI_TRANSITIONS=154} [2024-06-04 17:00:58,286 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 148 predicate places. [2024-06-04 17:00:58,286 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 154 transitions, 1657 flow [2024-06-04 17:00:58,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:00:58,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:00:58,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:00:58,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:00:58,287 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:00:58,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:00:58,288 INFO L85 PathProgramCache]: Analyzing trace with hash 720964103, now seen corresponding path program 8 times [2024-06-04 17:00:58,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:00:58,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454728341] [2024-06-04 17:00:58,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:00:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:00:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:02,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:02,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454728341] [2024-06-04 17:01:02,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454728341] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:02,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:02,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:02,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697471650] [2024-06-04 17:01:02,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:02,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:02,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:02,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:02,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:02,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:01:02,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 154 transitions, 1657 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:02,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:02,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:01:02,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:03,101 INFO L124 PetriNetUnfolderBase]: 419/751 cut-off events. [2024-06-04 17:01:03,101 INFO L125 PetriNetUnfolderBase]: For 29185/29185 co-relation queries the response was YES. [2024-06-04 17:01:03,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5148 conditions, 751 events. 419/751 cut-off events. For 29185/29185 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3462 event pairs, 81 based on Foata normal form. 2/752 useless extension candidates. Maximal degree in co-relation 5062. Up to 640 conditions per place. [2024-06-04 17:01:03,107 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 131 selfloop transitions, 35 changer transitions 0/168 dead transitions. [2024-06-04 17:01:03,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 168 transitions, 2051 flow [2024-06-04 17:01:03,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:01:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:01:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-04 17:01:03,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-04 17:01:03,109 INFO L175 Difference]: Start difference. First operand has 178 places, 154 transitions, 1657 flow. Second operand 8 states and 87 transitions. [2024-06-04 17:01:03,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 168 transitions, 2051 flow [2024-06-04 17:01:03,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 168 transitions, 1955 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-04 17:01:03,160 INFO L231 Difference]: Finished difference. Result has 177 places, 155 transitions, 1672 flow [2024-06-04 17:01:03,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1672, PETRI_PLACES=177, PETRI_TRANSITIONS=155} [2024-06-04 17:01:03,160 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2024-06-04 17:01:03,160 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 155 transitions, 1672 flow [2024-06-04 17:01:03,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:03,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:03,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:03,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:01:03,161 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:01:03,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:03,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1737515447, now seen corresponding path program 3 times [2024-06-04 17:01:03,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:03,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417114162] [2024-06-04 17:01:03,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:03,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:08,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:08,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417114162] [2024-06-04 17:01:08,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417114162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:08,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:08,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:08,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895701239] [2024-06-04 17:01:08,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:08,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:08,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:08,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:08,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:08,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:01:08,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 155 transitions, 1672 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:08,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:08,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:01:08,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:08,625 INFO L124 PetriNetUnfolderBase]: 417/748 cut-off events. [2024-06-04 17:01:08,625 INFO L125 PetriNetUnfolderBase]: For 28525/28525 co-relation queries the response was YES. [2024-06-04 17:01:08,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5058 conditions, 748 events. 417/748 cut-off events. For 28525/28525 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3460 event pairs, 78 based on Foata normal form. 1/748 useless extension candidates. Maximal degree in co-relation 4975. Up to 628 conditions per place. [2024-06-04 17:01:08,631 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 122 selfloop transitions, 44 changer transitions 0/168 dead transitions. [2024-06-04 17:01:08,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 168 transitions, 2040 flow [2024-06-04 17:01:08,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:01:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:01:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-04 17:01:08,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-04 17:01:08,632 INFO L175 Difference]: Start difference. First operand has 177 places, 155 transitions, 1672 flow. Second operand 8 states and 88 transitions. [2024-06-04 17:01:08,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 168 transitions, 2040 flow [2024-06-04 17:01:08,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 168 transitions, 1943 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-04 17:01:08,684 INFO L231 Difference]: Finished difference. Result has 179 places, 155 transitions, 1683 flow [2024-06-04 17:01:08,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1683, PETRI_PLACES=179, PETRI_TRANSITIONS=155} [2024-06-04 17:01:08,685 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2024-06-04 17:01:08,685 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 155 transitions, 1683 flow [2024-06-04 17:01:08,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:08,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:08,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:08,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:01:08,685 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:01:08,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:08,686 INFO L85 PathProgramCache]: Analyzing trace with hash 723765573, now seen corresponding path program 6 times [2024-06-04 17:01:08,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:08,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913301349] [2024-06-04 17:01:08,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:08,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:12,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:12,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913301349] [2024-06-04 17:01:12,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913301349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:12,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:12,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:12,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292120225] [2024-06-04 17:01:12,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:12,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:12,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:12,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:12,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:12,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:01:12,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 155 transitions, 1683 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:12,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:12,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:01:12,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:13,303 INFO L124 PetriNetUnfolderBase]: 423/759 cut-off events. [2024-06-04 17:01:13,303 INFO L125 PetriNetUnfolderBase]: For 27876/27876 co-relation queries the response was YES. [2024-06-04 17:01:13,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5104 conditions, 759 events. 423/759 cut-off events. For 27876/27876 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3505 event pairs, 61 based on Foata normal form. 2/760 useless extension candidates. Maximal degree in co-relation 5020. Up to 632 conditions per place. [2024-06-04 17:01:13,310 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 128 selfloop transitions, 42 changer transitions 0/172 dead transitions. [2024-06-04 17:01:13,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 172 transitions, 2107 flow [2024-06-04 17:01:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:01:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:01:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 17:01:13,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-04 17:01:13,311 INFO L175 Difference]: Start difference. First operand has 179 places, 155 transitions, 1683 flow. Second operand 9 states and 97 transitions. [2024-06-04 17:01:13,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 172 transitions, 2107 flow [2024-06-04 17:01:13,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 172 transitions, 1953 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-04 17:01:13,362 INFO L231 Difference]: Finished difference. Result has 180 places, 157 transitions, 1670 flow [2024-06-04 17:01:13,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1670, PETRI_PLACES=180, PETRI_TRANSITIONS=157} [2024-06-04 17:01:13,363 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 150 predicate places. [2024-06-04 17:01:13,363 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 157 transitions, 1670 flow [2024-06-04 17:01:13,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:13,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:13,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:13,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:01:13,363 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:01:13,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1855603003, now seen corresponding path program 9 times [2024-06-04 17:01:13,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:13,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635770069] [2024-06-04 17:01:13,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:13,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:17,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:17,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635770069] [2024-06-04 17:01:17,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635770069] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:17,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:17,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:17,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663263766] [2024-06-04 17:01:17,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:17,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:17,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:17,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:17,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:17,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:01:17,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 157 transitions, 1670 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:17,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:17,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:01:17,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:18,042 INFO L124 PetriNetUnfolderBase]: 427/766 cut-off events. [2024-06-04 17:01:18,042 INFO L125 PetriNetUnfolderBase]: For 27012/27012 co-relation queries the response was YES. [2024-06-04 17:01:18,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5123 conditions, 766 events. 427/766 cut-off events. For 27012/27012 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3567 event pairs, 74 based on Foata normal form. 2/767 useless extension candidates. Maximal degree in co-relation 5039. Up to 649 conditions per place. [2024-06-04 17:01:18,048 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 129 selfloop transitions, 42 changer transitions 0/173 dead transitions. [2024-06-04 17:01:18,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 173 transitions, 2078 flow [2024-06-04 17:01:18,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:01:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:01:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 17:01:18,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-04 17:01:18,049 INFO L175 Difference]: Start difference. First operand has 180 places, 157 transitions, 1670 flow. Second operand 9 states and 97 transitions. [2024-06-04 17:01:18,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 173 transitions, 2078 flow [2024-06-04 17:01:18,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 173 transitions, 1975 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 17:01:18,099 INFO L231 Difference]: Finished difference. Result has 182 places, 158 transitions, 1685 flow [2024-06-04 17:01:18,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1685, PETRI_PLACES=182, PETRI_TRANSITIONS=158} [2024-06-04 17:01:18,100 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2024-06-04 17:01:18,100 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 158 transitions, 1685 flow [2024-06-04 17:01:18,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:18,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:18,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:18,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:01:18,100 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:01:18,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:18,101 INFO L85 PathProgramCache]: Analyzing trace with hash 839056743, now seen corresponding path program 7 times [2024-06-04 17:01:18,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:18,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291639175] [2024-06-04 17:01:18,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:18,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:22,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:22,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291639175] [2024-06-04 17:01:22,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291639175] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:22,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:22,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:22,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623140515] [2024-06-04 17:01:22,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:22,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:22,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:22,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:22,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:22,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:01:22,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 158 transitions, 1685 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:22,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:22,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:01:22,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:22,902 INFO L124 PetriNetUnfolderBase]: 468/833 cut-off events. [2024-06-04 17:01:22,902 INFO L125 PetriNetUnfolderBase]: For 35123/35123 co-relation queries the response was YES. [2024-06-04 17:01:22,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5917 conditions, 833 events. 468/833 cut-off events. For 35123/35123 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3921 event pairs, 73 based on Foata normal form. 2/834 useless extension candidates. Maximal degree in co-relation 5832. Up to 495 conditions per place. [2024-06-04 17:01:22,908 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 111 selfloop transitions, 70 changer transitions 0/183 dead transitions. [2024-06-04 17:01:22,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 183 transitions, 2430 flow [2024-06-04 17:01:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:01:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:01:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-04 17:01:22,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-04 17:01:22,910 INFO L175 Difference]: Start difference. First operand has 182 places, 158 transitions, 1685 flow. Second operand 9 states and 105 transitions. [2024-06-04 17:01:22,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 183 transitions, 2430 flow [2024-06-04 17:01:22,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 183 transitions, 2320 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 17:01:22,962 INFO L231 Difference]: Finished difference. Result has 185 places, 165 transitions, 1901 flow [2024-06-04 17:01:22,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1901, PETRI_PLACES=185, PETRI_TRANSITIONS=165} [2024-06-04 17:01:22,963 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 155 predicate places. [2024-06-04 17:01:22,963 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 165 transitions, 1901 flow [2024-06-04 17:01:22,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:22,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:22,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:22,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:01:22,963 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:01:22,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:22,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2001108975, now seen corresponding path program 8 times [2024-06-04 17:01:22,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:22,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872025384] [2024-06-04 17:01:22,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:22,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:26,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872025384] [2024-06-04 17:01:26,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872025384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:26,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:26,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:26,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941782469] [2024-06-04 17:01:26,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:26,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:26,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:26,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:26,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:26,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:01:26,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 165 transitions, 1901 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:26,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:26,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:01:26,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:27,115 INFO L124 PetriNetUnfolderBase]: 480/852 cut-off events. [2024-06-04 17:01:27,115 INFO L125 PetriNetUnfolderBase]: For 36973/36973 co-relation queries the response was YES. [2024-06-04 17:01:27,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6255 conditions, 852 events. 480/852 cut-off events. For 36973/36973 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4020 event pairs, 107 based on Foata normal form. 4/855 useless extension candidates. Maximal degree in co-relation 6168. Up to 716 conditions per place. [2024-06-04 17:01:27,121 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 144 selfloop transitions, 38 changer transitions 0/184 dead transitions. [2024-06-04 17:01:27,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 184 transitions, 2492 flow [2024-06-04 17:01:27,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:01:27,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:01:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:01:27,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-04 17:01:27,122 INFO L175 Difference]: Start difference. First operand has 185 places, 165 transitions, 1901 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:01:27,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 184 transitions, 2492 flow [2024-06-04 17:01:27,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 184 transitions, 2418 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-06-04 17:01:27,179 INFO L231 Difference]: Finished difference. Result has 191 places, 169 transitions, 2035 flow [2024-06-04 17:01:27,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1829, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2035, PETRI_PLACES=191, PETRI_TRANSITIONS=169} [2024-06-04 17:01:27,179 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 161 predicate places. [2024-06-04 17:01:27,179 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 169 transitions, 2035 flow [2024-06-04 17:01:27,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:27,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:27,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:27,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 17:01:27,180 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:01:27,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:27,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2019549511, now seen corresponding path program 9 times [2024-06-04 17:01:27,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:27,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771383094] [2024-06-04 17:01:27,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:27,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:30,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:30,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771383094] [2024-06-04 17:01:30,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771383094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:30,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:30,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:30,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920773822] [2024-06-04 17:01:30,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:30,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:30,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:30,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:30,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:30,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:01:30,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 169 transitions, 2035 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:30,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:30,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:01:30,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:31,233 INFO L124 PetriNetUnfolderBase]: 476/846 cut-off events. [2024-06-04 17:01:31,234 INFO L125 PetriNetUnfolderBase]: For 34688/34688 co-relation queries the response was YES. [2024-06-04 17:01:31,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6230 conditions, 846 events. 476/846 cut-off events. For 34688/34688 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4000 event pairs, 113 based on Foata normal form. 2/846 useless extension candidates. Maximal degree in co-relation 6140. Up to 768 conditions per place. [2024-06-04 17:01:31,241 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 155 selfloop transitions, 26 changer transitions 0/183 dead transitions. [2024-06-04 17:01:31,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 183 transitions, 2528 flow [2024-06-04 17:01:31,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:01:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:01:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-04 17:01:31,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:01:31,244 INFO L175 Difference]: Start difference. First operand has 191 places, 169 transitions, 2035 flow. Second operand 10 states and 105 transitions. [2024-06-04 17:01:31,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 183 transitions, 2528 flow [2024-06-04 17:01:31,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 183 transitions, 2395 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-06-04 17:01:31,312 INFO L231 Difference]: Finished difference. Result has 194 places, 169 transitions, 1961 flow [2024-06-04 17:01:31,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1904, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1961, PETRI_PLACES=194, PETRI_TRANSITIONS=169} [2024-06-04 17:01:31,312 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 164 predicate places. [2024-06-04 17:01:31,312 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 169 transitions, 1961 flow [2024-06-04 17:01:31,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:31,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:31,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:31,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 17:01:31,313 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:01:31,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:31,313 INFO L85 PathProgramCache]: Analyzing trace with hash -117905231, now seen corresponding path program 10 times [2024-06-04 17:01:31,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:31,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33981385] [2024-06-04 17:01:31,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:31,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:35,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:35,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33981385] [2024-06-04 17:01:35,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33981385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:35,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:35,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:35,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909418255] [2024-06-04 17:01:35,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:35,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:35,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:35,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:35,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:35,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:01:35,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 169 transitions, 1961 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:35,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:35,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:01:35,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:35,894 INFO L124 PetriNetUnfolderBase]: 473/842 cut-off events. [2024-06-04 17:01:35,895 INFO L125 PetriNetUnfolderBase]: For 32739/32739 co-relation queries the response was YES. [2024-06-04 17:01:35,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5966 conditions, 842 events. 473/842 cut-off events. For 32739/32739 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3997 event pairs, 69 based on Foata normal form. 2/841 useless extension candidates. Maximal degree in co-relation 5876. Up to 718 conditions per place. [2024-06-04 17:01:35,901 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 137 selfloop transitions, 43 changer transitions 0/182 dead transitions. [2024-06-04 17:01:35,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 182 transitions, 2355 flow [2024-06-04 17:01:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:01:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:01:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 17:01:35,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-04 17:01:35,903 INFO L175 Difference]: Start difference. First operand has 194 places, 169 transitions, 1961 flow. Second operand 9 states and 96 transitions. [2024-06-04 17:01:35,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 182 transitions, 2355 flow [2024-06-04 17:01:35,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 182 transitions, 2239 flow, removed 21 selfloop flow, removed 10 redundant places. [2024-06-04 17:01:35,969 INFO L231 Difference]: Finished difference. Result has 193 places, 169 transitions, 1935 flow [2024-06-04 17:01:35,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1935, PETRI_PLACES=193, PETRI_TRANSITIONS=169} [2024-06-04 17:01:35,970 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2024-06-04 17:01:35,970 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 169 transitions, 1935 flow [2024-06-04 17:01:35,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:35,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:35,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:35,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 17:01:35,970 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:01:35,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:35,971 INFO L85 PathProgramCache]: Analyzing trace with hash -117900271, now seen corresponding path program 10 times [2024-06-04 17:01:35,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:35,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248504983] [2024-06-04 17:01:35,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:35,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:40,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:40,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248504983] [2024-06-04 17:01:40,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248504983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:40,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:40,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:40,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437802579] [2024-06-04 17:01:40,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:40,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:40,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:40,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:40,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:40,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:01:40,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 169 transitions, 1935 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:40,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:40,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:01:40,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:40,724 INFO L124 PetriNetUnfolderBase]: 479/852 cut-off events. [2024-06-04 17:01:40,724 INFO L125 PetriNetUnfolderBase]: For 33020/33020 co-relation queries the response was YES. [2024-06-04 17:01:40,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5984 conditions, 852 events. 479/852 cut-off events. For 33020/33020 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4027 event pairs, 72 based on Foata normal form. 2/849 useless extension candidates. Maximal degree in co-relation 5896. Up to 718 conditions per place. [2024-06-04 17:01:40,731 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 138 selfloop transitions, 43 changer transitions 0/183 dead transitions. [2024-06-04 17:01:40,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 183 transitions, 2379 flow [2024-06-04 17:01:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:01:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:01:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 17:01:40,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-04 17:01:40,732 INFO L175 Difference]: Start difference. First operand has 193 places, 169 transitions, 1935 flow. Second operand 9 states and 96 transitions. [2024-06-04 17:01:40,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 183 transitions, 2379 flow [2024-06-04 17:01:40,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 183 transitions, 2235 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-04 17:01:40,794 INFO L231 Difference]: Finished difference. Result has 194 places, 171 transitions, 1934 flow [2024-06-04 17:01:40,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1791, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1934, PETRI_PLACES=194, PETRI_TRANSITIONS=171} [2024-06-04 17:01:40,795 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 164 predicate places. [2024-06-04 17:01:40,795 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 171 transitions, 1934 flow [2024-06-04 17:01:40,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:40,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:40,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:40,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 17:01:40,796 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:01:40,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:40,796 INFO L85 PathProgramCache]: Analyzing trace with hash 110180369, now seen corresponding path program 11 times [2024-06-04 17:01:40,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:40,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575961822] [2024-06-04 17:01:40,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:40,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:44,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:44,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575961822] [2024-06-04 17:01:44,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575961822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:44,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:44,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:44,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127256317] [2024-06-04 17:01:44,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:44,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:44,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:44,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:44,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:44,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:01:44,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 171 transitions, 1934 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:44,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:44,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:01:44,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:44,814 INFO L124 PetriNetUnfolderBase]: 548/964 cut-off events. [2024-06-04 17:01:44,814 INFO L125 PetriNetUnfolderBase]: For 47550/47550 co-relation queries the response was YES. [2024-06-04 17:01:44,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7305 conditions, 964 events. 548/964 cut-off events. For 47550/47550 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4659 event pairs, 121 based on Foata normal form. 4/965 useless extension candidates. Maximal degree in co-relation 7216. Up to 682 conditions per place. [2024-06-04 17:01:44,822 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 149 selfloop transitions, 49 changer transitions 0/200 dead transitions. [2024-06-04 17:01:44,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 200 transitions, 2934 flow [2024-06-04 17:01:44,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:01:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:01:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 17:01:44,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-04 17:01:44,823 INFO L175 Difference]: Start difference. First operand has 194 places, 171 transitions, 1934 flow. Second operand 9 states and 106 transitions. [2024-06-04 17:01:44,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 200 transitions, 2934 flow [2024-06-04 17:01:44,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 200 transitions, 2769 flow, removed 29 selfloop flow, removed 8 redundant places. [2024-06-04 17:01:44,900 INFO L231 Difference]: Finished difference. Result has 196 places, 181 transitions, 2101 flow [2024-06-04 17:01:44,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1777, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2101, PETRI_PLACES=196, PETRI_TRANSITIONS=181} [2024-06-04 17:01:44,901 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 166 predicate places. [2024-06-04 17:01:44,901 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 181 transitions, 2101 flow [2024-06-04 17:01:44,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:44,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:44,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:44,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 17:01:44,902 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:01:44,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:44,902 INFO L85 PathProgramCache]: Analyzing trace with hash 110180617, now seen corresponding path program 1 times [2024-06-04 17:01:44,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:44,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466720543] [2024-06-04 17:01:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:44,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:49,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:49,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466720543] [2024-06-04 17:01:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466720543] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:49,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:49,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:49,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893776909] [2024-06-04 17:01:49,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:49,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:49,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:49,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:49,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:49,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:01:49,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 181 transitions, 2101 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:49,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:49,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:01:49,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:50,122 INFO L124 PetriNetUnfolderBase]: 544/957 cut-off events. [2024-06-04 17:01:50,122 INFO L125 PetriNetUnfolderBase]: For 46044/46044 co-relation queries the response was YES. [2024-06-04 17:01:50,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7229 conditions, 957 events. 544/957 cut-off events. For 46044/46044 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4626 event pairs, 127 based on Foata normal form. 1/955 useless extension candidates. Maximal degree in co-relation 7139. Up to 883 conditions per place. [2024-06-04 17:01:50,130 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 154 selfloop transitions, 34 changer transitions 0/190 dead transitions. [2024-06-04 17:01:50,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 190 transitions, 2510 flow [2024-06-04 17:01:50,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:01:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:01:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2024-06-04 17:01:50,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32974910394265233 [2024-06-04 17:01:50,131 INFO L175 Difference]: Start difference. First operand has 196 places, 181 transitions, 2101 flow. Second operand 9 states and 92 transitions. [2024-06-04 17:01:50,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 190 transitions, 2510 flow [2024-06-04 17:01:50,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 190 transitions, 2423 flow, removed 34 selfloop flow, removed 3 redundant places. [2024-06-04 17:01:50,203 INFO L231 Difference]: Finished difference. Result has 202 places, 182 transitions, 2104 flow [2024-06-04 17:01:50,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2016, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2104, PETRI_PLACES=202, PETRI_TRANSITIONS=182} [2024-06-04 17:01:50,204 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 172 predicate places. [2024-06-04 17:01:50,204 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 182 transitions, 2104 flow [2024-06-04 17:01:50,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:50,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:50,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:50,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 17:01:50,204 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:01:50,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:50,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1823313969, now seen corresponding path program 12 times [2024-06-04 17:01:50,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:50,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966309733] [2024-06-04 17:01:50,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:50,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:54,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:54,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966309733] [2024-06-04 17:01:54,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966309733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:54,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:54,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:54,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463464943] [2024-06-04 17:01:54,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:54,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:54,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:54,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:54,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:54,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:01:54,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 182 transitions, 2104 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:54,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:54,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:01:54,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:54,834 INFO L124 PetriNetUnfolderBase]: 556/977 cut-off events. [2024-06-04 17:01:54,834 INFO L125 PetriNetUnfolderBase]: For 50222/50222 co-relation queries the response was YES. [2024-06-04 17:01:54,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7365 conditions, 977 events. 556/977 cut-off events. For 50222/50222 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4745 event pairs, 129 based on Foata normal form. 4/978 useless extension candidates. Maximal degree in co-relation 7273. Up to 884 conditions per place. [2024-06-04 17:01:54,842 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 170 selfloop transitions, 27 changer transitions 0/199 dead transitions. [2024-06-04 17:01:54,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 199 transitions, 2725 flow [2024-06-04 17:01:54,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:01:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:01:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 17:01:54,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-04 17:01:54,843 INFO L175 Difference]: Start difference. First operand has 202 places, 182 transitions, 2104 flow. Second operand 9 states and 97 transitions. [2024-06-04 17:01:54,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 199 transitions, 2725 flow [2024-06-04 17:01:54,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 199 transitions, 2630 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 17:01:54,925 INFO L231 Difference]: Finished difference. Result has 204 places, 185 transitions, 2142 flow [2024-06-04 17:01:54,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2011, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2142, PETRI_PLACES=204, PETRI_TRANSITIONS=185} [2024-06-04 17:01:54,926 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 174 predicate places. [2024-06-04 17:01:54,926 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 185 transitions, 2142 flow [2024-06-04 17:01:54,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:54,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:54,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:54,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 17:01:54,926 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:01:54,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:54,926 INFO L85 PathProgramCache]: Analyzing trace with hash 280479823, now seen corresponding path program 13 times [2024-06-04 17:01:54,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:54,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661815528] [2024-06-04 17:01:54,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:54,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:01:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:01:58,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:01:58,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661815528] [2024-06-04 17:01:58,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661815528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:01:58,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:01:58,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:01:58,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055748922] [2024-06-04 17:01:58,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:01:58,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:01:58,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:01:58,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:01:58,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:01:58,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:01:58,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 185 transitions, 2142 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:58,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:01:58,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:01:58,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:01:58,783 INFO L124 PetriNetUnfolderBase]: 552/971 cut-off events. [2024-06-04 17:01:58,783 INFO L125 PetriNetUnfolderBase]: For 48009/48009 co-relation queries the response was YES. [2024-06-04 17:01:58,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7277 conditions, 971 events. 552/971 cut-off events. For 48009/48009 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4704 event pairs, 128 based on Foata normal form. 2/970 useless extension candidates. Maximal degree in co-relation 7184. Up to 883 conditions per place. [2024-06-04 17:01:58,793 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 169 selfloop transitions, 29 changer transitions 0/200 dead transitions. [2024-06-04 17:01:58,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 200 transitions, 2731 flow [2024-06-04 17:01:58,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:01:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:01:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:01:58,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-04 17:01:58,801 INFO L175 Difference]: Start difference. First operand has 204 places, 185 transitions, 2142 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:01:58,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 200 transitions, 2731 flow [2024-06-04 17:01:58,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 200 transitions, 2592 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-04 17:01:58,885 INFO L231 Difference]: Finished difference. Result has 206 places, 187 transitions, 2126 flow [2024-06-04 17:01:58,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2009, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2126, PETRI_PLACES=206, PETRI_TRANSITIONS=187} [2024-06-04 17:01:58,885 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 176 predicate places. [2024-06-04 17:01:58,885 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 187 transitions, 2126 flow [2024-06-04 17:01:58,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:01:58,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:01:58,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:01:58,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 17:01:58,886 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:01:58,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:01:58,886 INFO L85 PathProgramCache]: Analyzing trace with hash 508380973, now seen corresponding path program 14 times [2024-06-04 17:01:58,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:01:58,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696950832] [2024-06-04 17:01:58,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:01:58,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:01:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:02,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-04 17:02:02,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:02,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696950832] [2024-06-04 17:02:02,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696950832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:02,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:02,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:02:02,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415229332] [2024-06-04 17:02:02,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:02,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:02:02,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:02,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:02:02,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:02:02,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:02:02,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 187 transitions, 2126 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:02,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:02,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:02:02,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:03,244 INFO L124 PetriNetUnfolderBase]: 558/981 cut-off events. [2024-06-04 17:02:03,244 INFO L125 PetriNetUnfolderBase]: For 48623/48623 co-relation queries the response was YES. [2024-06-04 17:02:03,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7277 conditions, 981 events. 558/981 cut-off events. For 48623/48623 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4772 event pairs, 123 based on Foata normal form. 2/980 useless extension candidates. Maximal degree in co-relation 7183. Up to 693 conditions per place. [2024-06-04 17:02:03,253 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 146 selfloop transitions, 60 changer transitions 0/208 dead transitions. [2024-06-04 17:02:03,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 208 transitions, 3013 flow [2024-06-04 17:02:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:02:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:02:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-04 17:02:03,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-04 17:02:03,254 INFO L175 Difference]: Start difference. First operand has 206 places, 187 transitions, 2126 flow. Second operand 9 states and 105 transitions. [2024-06-04 17:02:03,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 208 transitions, 3013 flow [2024-06-04 17:02:03,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 208 transitions, 2917 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-04 17:02:03,338 INFO L231 Difference]: Finished difference. Result has 210 places, 193 transitions, 2322 flow [2024-06-04 17:02:03,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2030, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2322, PETRI_PLACES=210, PETRI_TRANSITIONS=193} [2024-06-04 17:02:03,339 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2024-06-04 17:02:03,339 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 193 transitions, 2322 flow [2024-06-04 17:02:03,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:03,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:03,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:03,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 17:02:03,340 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:02:03,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash 516661693, now seen corresponding path program 15 times [2024-06-04 17:02:03,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:03,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374541784] [2024-06-04 17:02:03,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:03,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:07,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:07,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:07,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374541784] [2024-06-04 17:02:07,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374541784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:07,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:07,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:02:07,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414480827] [2024-06-04 17:02:07,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:07,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:02:07,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:07,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:02:07,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:02:07,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:02:07,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 193 transitions, 2322 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:07,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:07,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:02:07,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:07,756 INFO L124 PetriNetUnfolderBase]: 552/972 cut-off events. [2024-06-04 17:02:07,756 INFO L125 PetriNetUnfolderBase]: For 49305/49305 co-relation queries the response was YES. [2024-06-04 17:02:07,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7165 conditions, 972 events. 552/972 cut-off events. For 49305/49305 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4724 event pairs, 167 based on Foata normal form. 4/975 useless extension candidates. Maximal degree in co-relation 7069. Up to 912 conditions per place. [2024-06-04 17:02:07,764 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 183 selfloop transitions, 19 changer transitions 0/204 dead transitions. [2024-06-04 17:02:07,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 204 transitions, 2852 flow [2024-06-04 17:02:07,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:02:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:02:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2024-06-04 17:02:07,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33691756272401435 [2024-06-04 17:02:07,765 INFO L175 Difference]: Start difference. First operand has 210 places, 193 transitions, 2322 flow. Second operand 9 states and 94 transitions. [2024-06-04 17:02:07,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 204 transitions, 2852 flow [2024-06-04 17:02:07,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 204 transitions, 2694 flow, removed 55 selfloop flow, removed 4 redundant places. [2024-06-04 17:02:07,863 INFO L231 Difference]: Finished difference. Result has 215 places, 193 transitions, 2209 flow [2024-06-04 17:02:07,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2164, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2209, PETRI_PLACES=215, PETRI_TRANSITIONS=193} [2024-06-04 17:02:07,864 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 185 predicate places. [2024-06-04 17:02:07,864 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 193 transitions, 2209 flow [2024-06-04 17:02:07,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:07,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:07,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:07,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 17:02:07,864 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:02:07,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash 516661941, now seen corresponding path program 2 times [2024-06-04 17:02:07,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:07,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311535028] [2024-06-04 17:02:07,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:07,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:12,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:12,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311535028] [2024-06-04 17:02:12,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311535028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:12,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:12,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:02:12,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525960542] [2024-06-04 17:02:12,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:12,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:02:12,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:12,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:02:12,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:02:12,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:02:12,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 193 transitions, 2209 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:12,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:12,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:02:12,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:12,841 INFO L124 PetriNetUnfolderBase]: 548/966 cut-off events. [2024-06-04 17:02:12,841 INFO L125 PetriNetUnfolderBase]: For 45691/45691 co-relation queries the response was YES. [2024-06-04 17:02:12,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6936 conditions, 966 events. 548/966 cut-off events. For 45691/45691 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4690 event pairs, 170 based on Foata normal form. 1/966 useless extension candidates. Maximal degree in co-relation 6838. Up to 931 conditions per place. [2024-06-04 17:02:12,849 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 184 selfloop transitions, 15 changer transitions 0/201 dead transitions. [2024-06-04 17:02:12,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 201 transitions, 2638 flow [2024-06-04 17:02:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:02:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:02:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-04 17:02:12,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32661290322580644 [2024-06-04 17:02:12,849 INFO L175 Difference]: Start difference. First operand has 215 places, 193 transitions, 2209 flow. Second operand 8 states and 81 transitions. [2024-06-04 17:02:12,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 201 transitions, 2638 flow [2024-06-04 17:02:12,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 201 transitions, 2579 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 17:02:12,947 INFO L231 Difference]: Finished difference. Result has 215 places, 194 transitions, 2204 flow [2024-06-04 17:02:12,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2152, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2204, PETRI_PLACES=215, PETRI_TRANSITIONS=194} [2024-06-04 17:02:12,947 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 185 predicate places. [2024-06-04 17:02:12,947 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 194 transitions, 2204 flow [2024-06-04 17:02:12,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:12,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:12,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:12,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 17:02:12,948 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:02:12,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:12,948 INFO L85 PathProgramCache]: Analyzing trace with hash 406428153, now seen corresponding path program 1 times [2024-06-04 17:02:12,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:12,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377171687] [2024-06-04 17:02:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:12,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:17,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:17,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377171687] [2024-06-04 17:02:17,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377171687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:17,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:17,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:02:17,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487104670] [2024-06-04 17:02:17,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:17,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:02:17,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:17,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:02:17,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:02:17,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:02:17,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 194 transitions, 2204 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:17,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:17,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:02:17,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:18,084 INFO L124 PetriNetUnfolderBase]: 552/973 cut-off events. [2024-06-04 17:02:18,084 INFO L125 PetriNetUnfolderBase]: For 49040/49040 co-relation queries the response was YES. [2024-06-04 17:02:18,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6984 conditions, 973 events. 552/973 cut-off events. For 49040/49040 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4748 event pairs, 86 based on Foata normal form. 2/974 useless extension candidates. Maximal degree in co-relation 6885. Up to 852 conditions per place. [2024-06-04 17:02:18,093 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 184 selfloop transitions, 27 changer transitions 0/213 dead transitions. [2024-06-04 17:02:18,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 213 transitions, 2684 flow [2024-06-04 17:02:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:02:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:02:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-04 17:02:18,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32903225806451614 [2024-06-04 17:02:18,095 INFO L175 Difference]: Start difference. First operand has 215 places, 194 transitions, 2204 flow. Second operand 10 states and 102 transitions. [2024-06-04 17:02:18,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 213 transitions, 2684 flow [2024-06-04 17:02:18,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 2630 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-04 17:02:18,198 INFO L231 Difference]: Finished difference. Result has 218 places, 195 transitions, 2224 flow [2024-06-04 17:02:18,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2224, PETRI_PLACES=218, PETRI_TRANSITIONS=195} [2024-06-04 17:02:18,198 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 188 predicate places. [2024-06-04 17:02:18,198 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 195 transitions, 2224 flow [2024-06-04 17:02:18,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:18,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:18,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:18,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 17:02:18,199 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:02:18,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash -357897663, now seen corresponding path program 2 times [2024-06-04 17:02:18,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:18,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442602153] [2024-06-04 17:02:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:18,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:23,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:23,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442602153] [2024-06-04 17:02:23,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442602153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:23,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:23,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:02:23,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614868322] [2024-06-04 17:02:23,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:23,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:02:23,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:23,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:02:23,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:02:23,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:02:23,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 195 transitions, 2224 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:23,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:23,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:02:23,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:23,888 INFO L124 PetriNetUnfolderBase]: 556/981 cut-off events. [2024-06-04 17:02:23,889 INFO L125 PetriNetUnfolderBase]: For 48594/48594 co-relation queries the response was YES. [2024-06-04 17:02:23,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7055 conditions, 981 events. 556/981 cut-off events. For 48594/48594 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4800 event pairs, 118 based on Foata normal form. 2/982 useless extension candidates. Maximal degree in co-relation 6956. Up to 895 conditions per place. [2024-06-04 17:02:23,897 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 187 selfloop transitions, 25 changer transitions 0/214 dead transitions. [2024-06-04 17:02:23,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 214 transitions, 2710 flow [2024-06-04 17:02:23,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:02:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:02:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-04 17:02:23,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:02:23,899 INFO L175 Difference]: Start difference. First operand has 218 places, 195 transitions, 2224 flow. Second operand 10 states and 105 transitions. [2024-06-04 17:02:23,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 214 transitions, 2710 flow [2024-06-04 17:02:23,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 214 transitions, 2646 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 17:02:23,997 INFO L231 Difference]: Finished difference. Result has 220 places, 196 transitions, 2232 flow [2024-06-04 17:02:23,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2160, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2232, PETRI_PLACES=220, PETRI_TRANSITIONS=196} [2024-06-04 17:02:23,997 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 190 predicate places. [2024-06-04 17:02:23,998 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 196 transitions, 2232 flow [2024-06-04 17:02:23,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:23,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:23,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:23,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 17:02:23,998 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:02:23,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:23,999 INFO L85 PathProgramCache]: Analyzing trace with hash -300064683, now seen corresponding path program 3 times [2024-06-04 17:02:23,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:23,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707245051] [2024-06-04 17:02:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:23,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:29,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:29,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707245051] [2024-06-04 17:02:29,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707245051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:29,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:29,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:02:29,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055559242] [2024-06-04 17:02:29,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:29,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:02:29,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:29,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:02:29,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:02:29,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:02:29,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 196 transitions, 2232 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:29,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:29,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:02:29,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:29,600 INFO L124 PetriNetUnfolderBase]: 560/989 cut-off events. [2024-06-04 17:02:29,600 INFO L125 PetriNetUnfolderBase]: For 50981/50981 co-relation queries the response was YES. [2024-06-04 17:02:29,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7116 conditions, 989 events. 560/989 cut-off events. For 50981/50981 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4859 event pairs, 115 based on Foata normal form. 2/990 useless extension candidates. Maximal degree in co-relation 7016. Up to 904 conditions per place. [2024-06-04 17:02:29,607 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 184 selfloop transitions, 28 changer transitions 0/214 dead transitions. [2024-06-04 17:02:29,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 214 transitions, 2718 flow [2024-06-04 17:02:29,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:02:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:02:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-04 17:02:29,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:02:29,609 INFO L175 Difference]: Start difference. First operand has 220 places, 196 transitions, 2232 flow. Second operand 10 states and 105 transitions. [2024-06-04 17:02:29,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 214 transitions, 2718 flow [2024-06-04 17:02:29,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 214 transitions, 2656 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 17:02:29,700 INFO L231 Difference]: Finished difference. Result has 222 places, 197 transitions, 2250 flow [2024-06-04 17:02:29,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2250, PETRI_PLACES=222, PETRI_TRANSITIONS=197} [2024-06-04 17:02:29,701 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 192 predicate places. [2024-06-04 17:02:29,701 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 197 transitions, 2250 flow [2024-06-04 17:02:29,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:29,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:29,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:29,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 17:02:29,702 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:02:29,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash -299686018, now seen corresponding path program 1 times [2024-06-04 17:02:29,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:29,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133782648] [2024-06-04 17:02:29,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:34,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:34,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:34,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133782648] [2024-06-04 17:02:34,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133782648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:34,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:34,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:02:34,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958240768] [2024-06-04 17:02:34,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:34,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:02:34,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:34,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:02:34,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:02:34,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:02:34,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 197 transitions, 2250 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:34,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:34,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:02:34,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:34,927 INFO L124 PetriNetUnfolderBase]: 563/994 cut-off events. [2024-06-04 17:02:34,927 INFO L125 PetriNetUnfolderBase]: For 52144/52144 co-relation queries the response was YES. [2024-06-04 17:02:34,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7207 conditions, 994 events. 563/994 cut-off events. For 52144/52144 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4899 event pairs, 113 based on Foata normal form. 1/994 useless extension candidates. Maximal degree in co-relation 7106. Up to 903 conditions per place. [2024-06-04 17:02:34,936 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 180 selfloop transitions, 34 changer transitions 0/216 dead transitions. [2024-06-04 17:02:34,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 216 transitions, 2783 flow [2024-06-04 17:02:34,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:02:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:02:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:02:34,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-04 17:02:34,937 INFO L175 Difference]: Start difference. First operand has 222 places, 197 transitions, 2250 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:02:34,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 216 transitions, 2783 flow [2024-06-04 17:02:35,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 216 transitions, 2713 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:02:35,046 INFO L231 Difference]: Finished difference. Result has 224 places, 199 transitions, 2317 flow [2024-06-04 17:02:35,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2180, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2317, PETRI_PLACES=224, PETRI_TRANSITIONS=199} [2024-06-04 17:02:35,047 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 194 predicate places. [2024-06-04 17:02:35,047 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 199 transitions, 2317 flow [2024-06-04 17:02:35,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:35,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:35,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:35,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 17:02:35,048 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:02:35,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:35,048 INFO L85 PathProgramCache]: Analyzing trace with hash -299677803, now seen corresponding path program 4 times [2024-06-04 17:02:35,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:35,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628524951] [2024-06-04 17:02:35,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:35,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:40,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:40,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628524951] [2024-06-04 17:02:40,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628524951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:40,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:40,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:02:40,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360071051] [2024-06-04 17:02:40,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:40,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:02:40,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:40,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:02:40,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:02:40,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:02:40,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 199 transitions, 2317 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:40,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:40,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:02:40,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:40,876 INFO L124 PetriNetUnfolderBase]: 567/1002 cut-off events. [2024-06-04 17:02:40,876 INFO L125 PetriNetUnfolderBase]: For 54916/54916 co-relation queries the response was YES. [2024-06-04 17:02:40,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7306 conditions, 1002 events. 567/1002 cut-off events. For 54916/54916 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4946 event pairs, 116 based on Foata normal form. 2/1003 useless extension candidates. Maximal degree in co-relation 7204. Up to 914 conditions per place. [2024-06-04 17:02:40,885 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 184 selfloop transitions, 31 changer transitions 0/217 dead transitions. [2024-06-04 17:02:40,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 217 transitions, 2813 flow [2024-06-04 17:02:40,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:02:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:02:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:02:40,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-04 17:02:40,886 INFO L175 Difference]: Start difference. First operand has 224 places, 199 transitions, 2317 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:02:40,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 217 transitions, 2813 flow [2024-06-04 17:02:40,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 217 transitions, 2709 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-04 17:02:40,996 INFO L231 Difference]: Finished difference. Result has 226 places, 200 transitions, 2302 flow [2024-06-04 17:02:40,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2213, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2302, PETRI_PLACES=226, PETRI_TRANSITIONS=200} [2024-06-04 17:02:40,996 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 196 predicate places. [2024-06-04 17:02:40,996 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 200 transitions, 2302 flow [2024-06-04 17:02:40,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:40,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:40,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:40,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 17:02:40,997 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:02:40,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:40,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1773152855, now seen corresponding path program 1 times [2024-06-04 17:02:40,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:40,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304854503] [2024-06-04 17:02:40,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:40,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:45,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:45,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304854503] [2024-06-04 17:02:45,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304854503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:45,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:45,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:02:45,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242987924] [2024-06-04 17:02:45,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:45,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:02:45,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:45,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:02:45,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:02:45,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:02:45,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 200 transitions, 2302 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:45,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:45,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:02:45,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:46,376 INFO L124 PetriNetUnfolderBase]: 573/1013 cut-off events. [2024-06-04 17:02:46,376 INFO L125 PetriNetUnfolderBase]: For 57135/57135 co-relation queries the response was YES. [2024-06-04 17:02:46,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7388 conditions, 1013 events. 573/1013 cut-off events. For 57135/57135 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5006 event pairs, 96 based on Foata normal form. 2/1014 useless extension candidates. Maximal degree in co-relation 7285. Up to 922 conditions per place. [2024-06-04 17:02:46,383 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 186 selfloop transitions, 33 changer transitions 0/221 dead transitions. [2024-06-04 17:02:46,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 221 transitions, 2838 flow [2024-06-04 17:02:46,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:02:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:02:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-04 17:02:46,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-04 17:02:46,384 INFO L175 Difference]: Start difference. First operand has 226 places, 200 transitions, 2302 flow. Second operand 11 states and 115 transitions. [2024-06-04 17:02:46,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 221 transitions, 2838 flow [2024-06-04 17:02:46,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 221 transitions, 2761 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:02:46,490 INFO L231 Difference]: Finished difference. Result has 229 places, 202 transitions, 2344 flow [2024-06-04 17:02:46,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2225, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2344, PETRI_PLACES=229, PETRI_TRANSITIONS=202} [2024-06-04 17:02:46,490 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-04 17:02:46,490 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 202 transitions, 2344 flow [2024-06-04 17:02:46,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:46,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:46,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:46,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 17:02:46,491 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:02:46,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:46,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2062995917, now seen corresponding path program 5 times [2024-06-04 17:02:46,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:46,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635790783] [2024-06-04 17:02:46,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:46,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:51,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:51,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635790783] [2024-06-04 17:02:51,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635790783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:51,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:51,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:02:51,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793413314] [2024-06-04 17:02:51,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:51,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:02:51,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:51,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:02:51,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:02:51,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:02:51,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 202 transitions, 2344 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:51,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:51,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:02:51,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:52,395 INFO L124 PetriNetUnfolderBase]: 577/1020 cut-off events. [2024-06-04 17:02:52,396 INFO L125 PetriNetUnfolderBase]: For 59028/59028 co-relation queries the response was YES. [2024-06-04 17:02:52,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7474 conditions, 1020 events. 577/1020 cut-off events. For 59028/59028 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5066 event pairs, 97 based on Foata normal form. 2/1021 useless extension candidates. Maximal degree in co-relation 7370. Up to 934 conditions per place. [2024-06-04 17:02:52,404 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 194 selfloop transitions, 24 changer transitions 0/220 dead transitions. [2024-06-04 17:02:52,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 220 transitions, 2846 flow [2024-06-04 17:02:52,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:02:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:02:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:02:52,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-04 17:02:52,406 INFO L175 Difference]: Start difference. First operand has 229 places, 202 transitions, 2344 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:02:52,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 220 transitions, 2846 flow [2024-06-04 17:02:52,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 220 transitions, 2753 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-04 17:02:52,520 INFO L231 Difference]: Finished difference. Result has 230 places, 203 transitions, 2327 flow [2024-06-04 17:02:52,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2327, PETRI_PLACES=230, PETRI_TRANSITIONS=203} [2024-06-04 17:02:52,520 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 200 predicate places. [2024-06-04 17:02:52,521 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 203 transitions, 2327 flow [2024-06-04 17:02:52,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:52,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:52,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:52,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 17:02:52,521 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:02:52,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:52,521 INFO L85 PathProgramCache]: Analyzing trace with hash -869428911, now seen corresponding path program 6 times [2024-06-04 17:02:52,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:52,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386846512] [2024-06-04 17:02:52,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:52,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:02:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:02:57,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:02:57,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386846512] [2024-06-04 17:02:57,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386846512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:02:57,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:02:57,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:02:57,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424690398] [2024-06-04 17:02:57,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:02:57,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:02:57,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:02:57,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:02:57,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:02:57,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:02:57,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 203 transitions, 2327 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:57,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:02:57,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:02:57,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:02:57,881 INFO L124 PetriNetUnfolderBase]: 581/1028 cut-off events. [2024-06-04 17:02:57,881 INFO L125 PetriNetUnfolderBase]: For 61323/61323 co-relation queries the response was YES. [2024-06-04 17:02:57,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7519 conditions, 1028 events. 581/1028 cut-off events. For 61323/61323 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5108 event pairs, 97 based on Foata normal form. 2/1029 useless extension candidates. Maximal degree in co-relation 7414. Up to 943 conditions per place. [2024-06-04 17:02:57,890 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 191 selfloop transitions, 27 changer transitions 0/220 dead transitions. [2024-06-04 17:02:57,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 220 transitions, 2829 flow [2024-06-04 17:02:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:02:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:02:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:02:57,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-04 17:02:57,892 INFO L175 Difference]: Start difference. First operand has 230 places, 203 transitions, 2327 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:02:57,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 220 transitions, 2829 flow [2024-06-04 17:02:58,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 220 transitions, 2763 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 17:02:58,007 INFO L231 Difference]: Finished difference. Result has 232 places, 204 transitions, 2345 flow [2024-06-04 17:02:58,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2261, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2345, PETRI_PLACES=232, PETRI_TRANSITIONS=204} [2024-06-04 17:02:58,008 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 202 predicate places. [2024-06-04 17:02:58,008 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 204 transitions, 2345 flow [2024-06-04 17:02:58,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:02:58,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:02:58,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:02:58,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 17:02:58,008 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:02:58,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:02:58,009 INFO L85 PathProgramCache]: Analyzing trace with hash -869425191, now seen corresponding path program 7 times [2024-06-04 17:02:58,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:02:58,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148132314] [2024-06-04 17:02:58,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:02:58,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:02:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:02,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:02,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148132314] [2024-06-04 17:03:02,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148132314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:02,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:02,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:03:02,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415583866] [2024-06-04 17:03:02,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:02,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:03:02,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:02,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:03:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:03:02,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:03:02,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 204 transitions, 2345 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:02,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:02,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:03:02,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:03,234 INFO L124 PetriNetUnfolderBase]: 585/1036 cut-off events. [2024-06-04 17:03:03,234 INFO L125 PetriNetUnfolderBase]: For 63522/63522 co-relation queries the response was YES. [2024-06-04 17:03:03,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7598 conditions, 1036 events. 585/1036 cut-off events. For 63522/63522 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5219 event pairs, 97 based on Foata normal form. 2/1037 useless extension candidates. Maximal degree in co-relation 7492. Up to 948 conditions per place. [2024-06-04 17:03:03,243 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 189 selfloop transitions, 30 changer transitions 0/221 dead transitions. [2024-06-04 17:03:03,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 221 transitions, 2853 flow [2024-06-04 17:03:03,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:03:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:03:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:03:03,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-04 17:03:03,245 INFO L175 Difference]: Start difference. First operand has 232 places, 204 transitions, 2345 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:03:03,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 221 transitions, 2853 flow [2024-06-04 17:03:03,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 221 transitions, 2779 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-04 17:03:03,377 INFO L231 Difference]: Finished difference. Result has 234 places, 205 transitions, 2364 flow [2024-06-04 17:03:03,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2271, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2364, PETRI_PLACES=234, PETRI_TRANSITIONS=205} [2024-06-04 17:03:03,377 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2024-06-04 17:03:03,377 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 205 transitions, 2364 flow [2024-06-04 17:03:03,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:03,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:03,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:03,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 17:03:03,378 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:03:03,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash -869425036, now seen corresponding path program 2 times [2024-06-04 17:03:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:03,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276444557] [2024-06-04 17:03:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:08,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:08,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276444557] [2024-06-04 17:03:08,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276444557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:08,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:08,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:03:08,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400407843] [2024-06-04 17:03:08,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:08,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:03:08,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:08,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:03:08,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:03:08,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:03:08,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 205 transitions, 2364 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:08,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:08,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:03:08,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:08,579 INFO L124 PetriNetUnfolderBase]: 583/1033 cut-off events. [2024-06-04 17:03:08,579 INFO L125 PetriNetUnfolderBase]: For 61979/61979 co-relation queries the response was YES. [2024-06-04 17:03:08,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7514 conditions, 1033 events. 583/1033 cut-off events. For 61979/61979 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5183 event pairs, 97 based on Foata normal form. 1/1033 useless extension candidates. Maximal degree in co-relation 7407. Up to 942 conditions per place. [2024-06-04 17:03:08,588 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 188 selfloop transitions, 33 changer transitions 0/223 dead transitions. [2024-06-04 17:03:08,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 223 transitions, 2915 flow [2024-06-04 17:03:08,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:03:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:03:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-04 17:03:08,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-04 17:03:08,590 INFO L175 Difference]: Start difference. First operand has 234 places, 205 transitions, 2364 flow. Second operand 10 states and 108 transitions. [2024-06-04 17:03:08,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 223 transitions, 2915 flow [2024-06-04 17:03:08,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 223 transitions, 2834 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-04 17:03:08,710 INFO L231 Difference]: Finished difference. Result has 236 places, 207 transitions, 2424 flow [2024-06-04 17:03:08,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2283, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2424, PETRI_PLACES=236, PETRI_TRANSITIONS=207} [2024-06-04 17:03:08,711 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 206 predicate places. [2024-06-04 17:03:08,711 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 207 transitions, 2424 flow [2024-06-04 17:03:08,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:08,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:08,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:08,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 17:03:08,712 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:03:08,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:08,712 INFO L85 PathProgramCache]: Analyzing trace with hash -782583279, now seen corresponding path program 2 times [2024-06-04 17:03:08,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:08,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463726896] [2024-06-04 17:03:08,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:08,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:12,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:12,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463726896] [2024-06-04 17:03:12,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463726896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:12,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:12,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:03:12,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486468708] [2024-06-04 17:03:12,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:12,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:03:12,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:12,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:03:12,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:03:12,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:03:12,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 207 transitions, 2424 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:12,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:12,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:03:12,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:13,437 INFO L124 PetriNetUnfolderBase]: 589/1044 cut-off events. [2024-06-04 17:03:13,437 INFO L125 PetriNetUnfolderBase]: For 65586/65586 co-relation queries the response was YES. [2024-06-04 17:03:13,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7619 conditions, 1044 events. 589/1044 cut-off events. For 65586/65586 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5251 event pairs, 99 based on Foata normal form. 2/1045 useless extension candidates. Maximal degree in co-relation 7511. Up to 953 conditions per place. [2024-06-04 17:03:13,445 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 195 selfloop transitions, 30 changer transitions 0/227 dead transitions. [2024-06-04 17:03:13,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 227 transitions, 2976 flow [2024-06-04 17:03:13,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:03:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:03:13,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-04 17:03:13,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-04 17:03:13,447 INFO L175 Difference]: Start difference. First operand has 236 places, 207 transitions, 2424 flow. Second operand 11 states and 116 transitions. [2024-06-04 17:03:13,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 227 transitions, 2976 flow [2024-06-04 17:03:13,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 227 transitions, 2868 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-04 17:03:13,584 INFO L231 Difference]: Finished difference. Result has 239 places, 209 transitions, 2435 flow [2024-06-04 17:03:13,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2316, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2435, PETRI_PLACES=239, PETRI_TRANSITIONS=209} [2024-06-04 17:03:13,585 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 209 predicate places. [2024-06-04 17:03:13,585 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 209 transitions, 2435 flow [2024-06-04 17:03:13,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:13,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:13,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:13,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 17:03:13,586 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:03:13,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash -679729275, now seen corresponding path program 8 times [2024-06-04 17:03:13,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:13,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887207660] [2024-06-04 17:03:13,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:13,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:18,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:18,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887207660] [2024-06-04 17:03:18,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887207660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:18,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:18,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:03:18,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860184521] [2024-06-04 17:03:18,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:18,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:03:18,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:18,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:03:18,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:03:18,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:03:18,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 209 transitions, 2435 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:18,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:18,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:03:18,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:18,510 INFO L124 PetriNetUnfolderBase]: 593/1051 cut-off events. [2024-06-04 17:03:18,511 INFO L125 PetriNetUnfolderBase]: For 67887/67887 co-relation queries the response was YES. [2024-06-04 17:03:18,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7690 conditions, 1051 events. 593/1051 cut-off events. For 67887/67887 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5326 event pairs, 139 based on Foata normal form. 2/1052 useless extension candidates. Maximal degree in co-relation 7581. Up to 1008 conditions per place. [2024-06-04 17:03:18,520 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 204 selfloop transitions, 18 changer transitions 0/224 dead transitions. [2024-06-04 17:03:18,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 224 transitions, 2943 flow [2024-06-04 17:03:18,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:03:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:03:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2024-06-04 17:03:18,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-04 17:03:18,522 INFO L175 Difference]: Start difference. First operand has 239 places, 209 transitions, 2435 flow. Second operand 10 states and 100 transitions. [2024-06-04 17:03:18,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 224 transitions, 2943 flow [2024-06-04 17:03:18,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 224 transitions, 2850 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-04 17:03:18,656 INFO L231 Difference]: Finished difference. Result has 240 places, 210 transitions, 2412 flow [2024-06-04 17:03:18,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2342, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2412, PETRI_PLACES=240, PETRI_TRANSITIONS=210} [2024-06-04 17:03:18,656 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 210 predicate places. [2024-06-04 17:03:18,656 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 210 transitions, 2412 flow [2024-06-04 17:03:18,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:18,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:18,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:18,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 17:03:18,657 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:03:18,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1497960115, now seen corresponding path program 3 times [2024-06-04 17:03:18,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:18,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135325812] [2024-06-04 17:03:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:18,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:23,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:23,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135325812] [2024-06-04 17:03:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135325812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:23,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:23,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:03:23,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60317529] [2024-06-04 17:03:23,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:23,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:03:23,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:23,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:03:23,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:03:23,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:03:23,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 210 transitions, 2412 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:23,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:23,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:03:23,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:23,710 INFO L124 PetriNetUnfolderBase]: 605/1071 cut-off events. [2024-06-04 17:03:23,711 INFO L125 PetriNetUnfolderBase]: For 73958/73958 co-relation queries the response was YES. [2024-06-04 17:03:23,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7831 conditions, 1071 events. 605/1071 cut-off events. For 73958/73958 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5446 event pairs, 133 based on Foata normal form. 4/1074 useless extension candidates. Maximal degree in co-relation 7721. Up to 972 conditions per place. [2024-06-04 17:03:23,720 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 194 selfloop transitions, 36 changer transitions 0/232 dead transitions. [2024-06-04 17:03:23,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 232 transitions, 3035 flow [2024-06-04 17:03:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:03:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:03:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-04 17:03:23,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2024-06-04 17:03:23,721 INFO L175 Difference]: Start difference. First operand has 240 places, 210 transitions, 2412 flow. Second operand 10 states and 114 transitions. [2024-06-04 17:03:23,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 232 transitions, 3035 flow [2024-06-04 17:03:23,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 232 transitions, 2975 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-04 17:03:23,858 INFO L231 Difference]: Finished difference. Result has 244 places, 217 transitions, 2585 flow [2024-06-04 17:03:23,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2352, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2585, PETRI_PLACES=244, PETRI_TRANSITIONS=217} [2024-06-04 17:03:23,859 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2024-06-04 17:03:23,859 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 217 transitions, 2585 flow [2024-06-04 17:03:23,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:23,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:23,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:23,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 17:03:23,859 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:03:23,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:23,859 INFO L85 PathProgramCache]: Analyzing trace with hash -230495218, now seen corresponding path program 1 times [2024-06-04 17:03:23,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:23,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71194789] [2024-06-04 17:03:23,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:23,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:28,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:28,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71194789] [2024-06-04 17:03:28,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71194789] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:28,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:28,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:03:28,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42541723] [2024-06-04 17:03:28,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:28,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:03:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:28,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:03:28,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:03:28,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:03:28,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 217 transitions, 2585 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:28,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:28,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:03:28,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:28,993 INFO L124 PetriNetUnfolderBase]: 609/1079 cut-off events. [2024-06-04 17:03:28,994 INFO L125 PetriNetUnfolderBase]: For 72300/72300 co-relation queries the response was YES. [2024-06-04 17:03:29,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7998 conditions, 1079 events. 609/1079 cut-off events. For 72300/72300 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5491 event pairs, 145 based on Foata normal form. 2/1080 useless extension candidates. Maximal degree in co-relation 7885. Up to 1036 conditions per place. [2024-06-04 17:03:29,004 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 210 selfloop transitions, 20 changer transitions 0/232 dead transitions. [2024-06-04 17:03:29,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 232 transitions, 3105 flow [2024-06-04 17:03:29,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:03:29,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:03:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2024-06-04 17:03:29,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31378299120234604 [2024-06-04 17:03:29,005 INFO L175 Difference]: Start difference. First operand has 244 places, 217 transitions, 2585 flow. Second operand 11 states and 107 transitions. [2024-06-04 17:03:29,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 232 transitions, 3105 flow [2024-06-04 17:03:29,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 232 transitions, 3009 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-04 17:03:29,213 INFO L231 Difference]: Finished difference. Result has 249 places, 218 transitions, 2561 flow [2024-06-04 17:03:29,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2489, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2561, PETRI_PLACES=249, PETRI_TRANSITIONS=218} [2024-06-04 17:03:29,213 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 219 predicate places. [2024-06-04 17:03:29,214 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 218 transitions, 2561 flow [2024-06-04 17:03:29,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:29,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:29,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:29,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 17:03:29,214 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:03:29,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:29,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1498161925, now seen corresponding path program 4 times [2024-06-04 17:03:29,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:29,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267647347] [2024-06-04 17:03:29,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:29,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:33,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:33,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267647347] [2024-06-04 17:03:33,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267647347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:33,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:33,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:03:33,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712406020] [2024-06-04 17:03:33,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:33,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:03:33,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:33,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:03:33,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:03:33,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:03:33,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 218 transitions, 2561 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:33,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:33,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:03:33,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:34,468 INFO L124 PetriNetUnfolderBase]: 605/1073 cut-off events. [2024-06-04 17:03:34,468 INFO L125 PetriNetUnfolderBase]: For 70167/70167 co-relation queries the response was YES. [2024-06-04 17:03:34,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7780 conditions, 1073 events. 605/1073 cut-off events. For 70167/70167 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5464 event pairs, 138 based on Foata normal form. 2/1074 useless extension candidates. Maximal degree in co-relation 7666. Up to 994 conditions per place. [2024-06-04 17:03:34,477 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 204 selfloop transitions, 29 changer transitions 0/235 dead transitions. [2024-06-04 17:03:34,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 235 transitions, 3075 flow [2024-06-04 17:03:34,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:03:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:03:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-04 17:03:34,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-04 17:03:34,478 INFO L175 Difference]: Start difference. First operand has 249 places, 218 transitions, 2561 flow. Second operand 11 states and 116 transitions. [2024-06-04 17:03:34,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 235 transitions, 3075 flow [2024-06-04 17:03:34,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 235 transitions, 2992 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-04 17:03:34,635 INFO L231 Difference]: Finished difference. Result has 252 places, 218 transitions, 2541 flow [2024-06-04 17:03:34,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2478, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2541, PETRI_PLACES=252, PETRI_TRANSITIONS=218} [2024-06-04 17:03:34,635 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places. [2024-06-04 17:03:34,636 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 218 transitions, 2541 flow [2024-06-04 17:03:34,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:34,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:34,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:34,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 17:03:34,636 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:03:34,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:34,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1503674407, now seen corresponding path program 9 times [2024-06-04 17:03:34,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:34,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803596509] [2024-06-04 17:03:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:34,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:39,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:39,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803596509] [2024-06-04 17:03:39,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803596509] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:39,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:39,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:03:39,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510177588] [2024-06-04 17:03:39,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:39,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:03:39,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:39,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:03:39,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:03:39,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:03:39,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 218 transitions, 2541 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:39,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:39,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:03:39,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:39,532 INFO L124 PetriNetUnfolderBase]: 609/1082 cut-off events. [2024-06-04 17:03:39,532 INFO L125 PetriNetUnfolderBase]: For 72257/72257 co-relation queries the response was YES. [2024-06-04 17:03:39,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7847 conditions, 1082 events. 609/1082 cut-off events. For 72257/72257 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5519 event pairs, 96 based on Foata normal form. 2/1083 useless extension candidates. Maximal degree in co-relation 7732. Up to 980 conditions per place. [2024-06-04 17:03:39,542 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 198 selfloop transitions, 35 changer transitions 0/235 dead transitions. [2024-06-04 17:03:39,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 235 transitions, 3081 flow [2024-06-04 17:03:39,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:03:39,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:03:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:03:39,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-04 17:03:39,544 INFO L175 Difference]: Start difference. First operand has 252 places, 218 transitions, 2541 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:03:39,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 235 transitions, 3081 flow [2024-06-04 17:03:39,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 235 transitions, 3017 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 17:03:39,703 INFO L231 Difference]: Finished difference. Result has 253 places, 219 transitions, 2583 flow [2024-06-04 17:03:39,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2477, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2583, PETRI_PLACES=253, PETRI_TRANSITIONS=219} [2024-06-04 17:03:39,703 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 223 predicate places. [2024-06-04 17:03:39,703 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 219 transitions, 2583 flow [2024-06-04 17:03:39,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:39,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:39,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:39,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 17:03:39,704 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:03:39,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash -685239525, now seen corresponding path program 10 times [2024-06-04 17:03:39,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:39,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010076544] [2024-06-04 17:03:39,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:39,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:44,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-04 17:03:44,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:44,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010076544] [2024-06-04 17:03:44,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010076544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:44,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:44,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:03:44,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546150335] [2024-06-04 17:03:44,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:44,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:03:44,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:44,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:03:44,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:03:44,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:03:44,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 219 transitions, 2583 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:44,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:44,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:03:44,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:44,669 INFO L124 PetriNetUnfolderBase]: 613/1090 cut-off events. [2024-06-04 17:03:44,670 INFO L125 PetriNetUnfolderBase]: For 74852/74852 co-relation queries the response was YES. [2024-06-04 17:03:44,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7964 conditions, 1090 events. 613/1090 cut-off events. For 74852/74852 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5583 event pairs, 96 based on Foata normal form. 2/1091 useless extension candidates. Maximal degree in co-relation 7848. Up to 988 conditions per place. [2024-06-04 17:03:44,680 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 200 selfloop transitions, 34 changer transitions 0/236 dead transitions. [2024-06-04 17:03:44,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 236 transitions, 3125 flow [2024-06-04 17:03:44,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:03:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:03:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:03:44,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-04 17:03:44,681 INFO L175 Difference]: Start difference. First operand has 253 places, 219 transitions, 2583 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:03:44,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 236 transitions, 3125 flow [2024-06-04 17:03:44,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 236 transitions, 3029 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-04 17:03:44,862 INFO L231 Difference]: Finished difference. Result has 255 places, 220 transitions, 2593 flow [2024-06-04 17:03:44,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2593, PETRI_PLACES=255, PETRI_TRANSITIONS=220} [2024-06-04 17:03:44,862 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places. [2024-06-04 17:03:44,863 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 220 transitions, 2593 flow [2024-06-04 17:03:44,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:44,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:44,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:44,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 17:03:44,863 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:03:44,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:44,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1503524305, now seen corresponding path program 5 times [2024-06-04 17:03:44,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:44,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990179462] [2024-06-04 17:03:44,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:44,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:49,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:49,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990179462] [2024-06-04 17:03:49,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990179462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:49,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:49,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:03:49,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202667864] [2024-06-04 17:03:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:49,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:03:49,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:49,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:03:49,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:03:49,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:03:49,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 220 transitions, 2593 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:49,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:49,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:03:49,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:49,802 INFO L124 PetriNetUnfolderBase]: 614/1092 cut-off events. [2024-06-04 17:03:49,802 INFO L125 PetriNetUnfolderBase]: For 74687/74687 co-relation queries the response was YES. [2024-06-04 17:03:49,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7929 conditions, 1092 events. 614/1092 cut-off events. For 74687/74687 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5588 event pairs, 98 based on Foata normal form. 2/1093 useless extension candidates. Maximal degree in co-relation 7812. Up to 980 conditions per place. [2024-06-04 17:03:49,812 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 200 selfloop transitions, 38 changer transitions 0/240 dead transitions. [2024-06-04 17:03:49,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 240 transitions, 3175 flow [2024-06-04 17:03:49,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:03:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:03:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-04 17:03:49,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-04 17:03:49,813 INFO L175 Difference]: Start difference. First operand has 255 places, 220 transitions, 2593 flow. Second operand 11 states and 117 transitions. [2024-06-04 17:03:49,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 240 transitions, 3175 flow [2024-06-04 17:03:49,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 240 transitions, 3079 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 17:03:49,993 INFO L231 Difference]: Finished difference. Result has 258 places, 222 transitions, 2636 flow [2024-06-04 17:03:49,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2497, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2636, PETRI_PLACES=258, PETRI_TRANSITIONS=222} [2024-06-04 17:03:49,993 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 228 predicate places. [2024-06-04 17:03:49,993 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 222 transitions, 2636 flow [2024-06-04 17:03:49,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:49,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:49,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:49,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 17:03:49,994 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:03:49,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1577409179, now seen corresponding path program 11 times [2024-06-04 17:03:49,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:49,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344147176] [2024-06-04 17:03:49,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:49,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:03:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:03:55,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:03:55,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344147176] [2024-06-04 17:03:55,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344147176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:03:55,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:03:55,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:03:55,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18325910] [2024-06-04 17:03:55,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:03:55,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:03:55,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:03:55,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:03:55,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:03:55,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:03:55,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 222 transitions, 2636 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:55,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:03:55,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:03:55,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:03:55,659 INFO L124 PetriNetUnfolderBase]: 618/1099 cut-off events. [2024-06-04 17:03:55,659 INFO L125 PetriNetUnfolderBase]: For 76908/76908 co-relation queries the response was YES. [2024-06-04 17:03:55,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8005 conditions, 1099 events. 618/1099 cut-off events. For 76908/76908 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5653 event pairs, 106 based on Foata normal form. 2/1100 useless extension candidates. Maximal degree in co-relation 7887. Up to 930 conditions per place. [2024-06-04 17:03:55,670 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 204 selfloop transitions, 32 changer transitions 0/238 dead transitions. [2024-06-04 17:03:55,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 238 transitions, 3178 flow [2024-06-04 17:03:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:03:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:03:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-06-04 17:03:55,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 17:03:55,671 INFO L175 Difference]: Start difference. First operand has 258 places, 222 transitions, 2636 flow. Second operand 9 states and 93 transitions. [2024-06-04 17:03:55,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 238 transitions, 3178 flow [2024-06-04 17:03:55,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 238 transitions, 3065 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-04 17:03:55,868 INFO L231 Difference]: Finished difference. Result has 258 places, 223 transitions, 2633 flow [2024-06-04 17:03:55,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2523, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2633, PETRI_PLACES=258, PETRI_TRANSITIONS=223} [2024-06-04 17:03:55,869 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 228 predicate places. [2024-06-04 17:03:55,869 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 223 transitions, 2633 flow [2024-06-04 17:03:55,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:03:55,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:03:55,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:03:55,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 17:03:55,869 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:03:55,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:03:55,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1575531509, now seen corresponding path program 12 times [2024-06-04 17:03:55,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:03:55,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915488690] [2024-06-04 17:03:55,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:03:55,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:03:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:00,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:00,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915488690] [2024-06-04 17:04:00,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915488690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:00,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:00,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:04:00,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477123112] [2024-06-04 17:04:00,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:00,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:04:00,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:00,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:04:00,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:04:00,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:04:00,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 223 transitions, 2633 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:00,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:00,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:04:00,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:00,672 INFO L124 PetriNetUnfolderBase]: 622/1107 cut-off events. [2024-06-04 17:04:00,672 INFO L125 PetriNetUnfolderBase]: For 79155/79155 co-relation queries the response was YES. [2024-06-04 17:04:00,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8099 conditions, 1107 events. 622/1107 cut-off events. For 79155/79155 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5699 event pairs, 121 based on Foata normal form. 2/1108 useless extension candidates. Maximal degree in co-relation 7980. Up to 963 conditions per place. [2024-06-04 17:04:00,683 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 190 selfloop transitions, 47 changer transitions 0/239 dead transitions. [2024-06-04 17:04:00,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 239 transitions, 3183 flow [2024-06-04 17:04:00,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:04:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:04:00,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 17:04:00,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-04 17:04:00,684 INFO L175 Difference]: Start difference. First operand has 258 places, 223 transitions, 2633 flow. Second operand 9 states and 96 transitions. [2024-06-04 17:04:00,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 239 transitions, 3183 flow [2024-06-04 17:04:00,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 239 transitions, 3083 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-04 17:04:00,888 INFO L231 Difference]: Finished difference. Result has 260 places, 224 transitions, 2676 flow [2024-06-04 17:04:00,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2539, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2676, PETRI_PLACES=260, PETRI_TRANSITIONS=224} [2024-06-04 17:04:00,889 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 230 predicate places. [2024-06-04 17:04:00,889 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 224 transitions, 2676 flow [2024-06-04 17:04:00,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:00,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:00,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:00,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 17:04:00,889 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:04:00,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:00,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1492414464, now seen corresponding path program 3 times [2024-06-04 17:04:00,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:00,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532873023] [2024-06-04 17:04:00,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:00,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:05,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532873023] [2024-06-04 17:04:05,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532873023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:05,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:05,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:04:05,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352841368] [2024-06-04 17:04:05,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:05,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:04:05,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:05,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:04:05,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:04:05,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:04:05,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 224 transitions, 2676 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:05,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:05,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:04:05,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:05,932 INFO L124 PetriNetUnfolderBase]: 620/1104 cut-off events. [2024-06-04 17:04:05,932 INFO L125 PetriNetUnfolderBase]: For 70093/70093 co-relation queries the response was YES. [2024-06-04 17:04:05,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7913 conditions, 1104 events. 620/1104 cut-off events. For 70093/70093 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5689 event pairs, 118 based on Foata normal form. 1/1104 useless extension candidates. Maximal degree in co-relation 7793. Up to 951 conditions per place. [2024-06-04 17:04:05,941 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 183 selfloop transitions, 56 changer transitions 0/241 dead transitions. [2024-06-04 17:04:05,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 241 transitions, 3260 flow [2024-06-04 17:04:05,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:04:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:04:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 17:04:05,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735 [2024-06-04 17:04:05,943 INFO L175 Difference]: Start difference. First operand has 260 places, 224 transitions, 2676 flow. Second operand 9 states and 97 transitions. [2024-06-04 17:04:05,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 241 transitions, 3260 flow [2024-06-04 17:04:06,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 241 transitions, 3143 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 17:04:06,116 INFO L231 Difference]: Finished difference. Result has 262 places, 226 transitions, 2759 flow [2024-06-04 17:04:06,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2559, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2759, PETRI_PLACES=262, PETRI_TRANSITIONS=226} [2024-06-04 17:04:06,117 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 232 predicate places. [2024-06-04 17:04:06,117 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 226 transitions, 2759 flow [2024-06-04 17:04:06,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:06,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:06,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:06,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 17:04:06,117 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:04:06,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:06,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1575535229, now seen corresponding path program 13 times [2024-06-04 17:04:06,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:06,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48419283] [2024-06-04 17:04:06,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:06,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:10,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:10,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48419283] [2024-06-04 17:04:10,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48419283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:10,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:10,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:04:10,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226189522] [2024-06-04 17:04:10,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:10,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:04:10,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:10,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:04:10,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:04:10,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:04:10,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 226 transitions, 2759 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:10,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:10,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:04:10,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:11,446 INFO L124 PetriNetUnfolderBase]: 624/1112 cut-off events. [2024-06-04 17:04:11,447 INFO L125 PetriNetUnfolderBase]: For 70010/70010 co-relation queries the response was YES. [2024-06-04 17:04:11,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7962 conditions, 1112 events. 624/1112 cut-off events. For 70010/70010 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5776 event pairs, 116 based on Foata normal form. 2/1113 useless extension candidates. Maximal degree in co-relation 7841. Up to 977 conditions per place. [2024-06-04 17:04:11,457 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 202 selfloop transitions, 38 changer transitions 0/242 dead transitions. [2024-06-04 17:04:11,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 242 transitions, 3305 flow [2024-06-04 17:04:11,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:04:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:04:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-04 17:04:11,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34050179211469533 [2024-06-04 17:04:11,459 INFO L175 Difference]: Start difference. First operand has 262 places, 226 transitions, 2759 flow. Second operand 9 states and 95 transitions. [2024-06-04 17:04:11,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 242 transitions, 3305 flow [2024-06-04 17:04:11,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 242 transitions, 3171 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-04 17:04:11,653 INFO L231 Difference]: Finished difference. Result has 264 places, 227 transitions, 2739 flow [2024-06-04 17:04:11,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2625, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2739, PETRI_PLACES=264, PETRI_TRANSITIONS=227} [2024-06-04 17:04:11,653 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 234 predicate places. [2024-06-04 17:04:11,653 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 227 transitions, 2739 flow [2024-06-04 17:04:11,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:11,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:11,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:11,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 17:04:11,654 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:04:11,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1884753271, now seen corresponding path program 6 times [2024-06-04 17:04:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:11,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568601905] [2024-06-04 17:04:11,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:11,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:16,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:16,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568601905] [2024-06-04 17:04:16,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568601905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:16,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:16,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:04:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331447068] [2024-06-04 17:04:16,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:16,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:04:16,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:16,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:04:16,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:04:16,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:04:16,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 227 transitions, 2739 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:16,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:16,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:04:16,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:17,048 INFO L124 PetriNetUnfolderBase]: 630/1123 cut-off events. [2024-06-04 17:04:17,048 INFO L125 PetriNetUnfolderBase]: For 72138/72138 co-relation queries the response was YES. [2024-06-04 17:04:17,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8033 conditions, 1123 events. 630/1123 cut-off events. For 72138/72138 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5846 event pairs, 100 based on Foata normal form. 2/1124 useless extension candidates. Maximal degree in co-relation 7911. Up to 972 conditions per place. [2024-06-04 17:04:17,059 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 196 selfloop transitions, 48 changer transitions 0/246 dead transitions. [2024-06-04 17:04:17,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 246 transitions, 3323 flow [2024-06-04 17:04:17,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:04:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:04:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:04:17,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-04 17:04:17,060 INFO L175 Difference]: Start difference. First operand has 264 places, 227 transitions, 2739 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:04:17,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 246 transitions, 3323 flow [2024-06-04 17:04:17,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 246 transitions, 3223 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 17:04:17,230 INFO L231 Difference]: Finished difference. Result has 267 places, 229 transitions, 2798 flow [2024-06-04 17:04:17,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2639, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2798, PETRI_PLACES=267, PETRI_TRANSITIONS=229} [2024-06-04 17:04:17,230 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 237 predicate places. [2024-06-04 17:04:17,230 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 229 transitions, 2798 flow [2024-06-04 17:04:17,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:17,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:17,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:17,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 17:04:17,231 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:04:17,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:17,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1694629427, now seen corresponding path program 14 times [2024-06-04 17:04:17,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:17,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62740323] [2024-06-04 17:04:17,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:17,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:21,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:21,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62740323] [2024-06-04 17:04:21,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62740323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:21,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:21,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:04:21,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210251900] [2024-06-04 17:04:21,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:21,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:04:21,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:21,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:04:21,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:04:21,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:04:21,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 229 transitions, 2798 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:21,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:21,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:04:21,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:21,956 INFO L124 PetriNetUnfolderBase]: 634/1130 cut-off events. [2024-06-04 17:04:21,956 INFO L125 PetriNetUnfolderBase]: For 70395/70395 co-relation queries the response was YES. [2024-06-04 17:04:21,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8080 conditions, 1130 events. 634/1130 cut-off events. For 70395/70395 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5882 event pairs, 149 based on Foata normal form. 2/1131 useless extension candidates. Maximal degree in co-relation 7957. Up to 1069 conditions per place. [2024-06-04 17:04:21,967 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 216 selfloop transitions, 24 changer transitions 0/242 dead transitions. [2024-06-04 17:04:21,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 242 transitions, 3334 flow [2024-06-04 17:04:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:04:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:04:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2024-06-04 17:04:21,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32616487455197135 [2024-06-04 17:04:21,969 INFO L175 Difference]: Start difference. First operand has 267 places, 229 transitions, 2798 flow. Second operand 9 states and 91 transitions. [2024-06-04 17:04:21,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 242 transitions, 3334 flow [2024-06-04 17:04:22,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 242 transitions, 3211 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-04 17:04:22,163 INFO L231 Difference]: Finished difference. Result has 268 places, 230 transitions, 2757 flow [2024-06-04 17:04:22,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2675, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2757, PETRI_PLACES=268, PETRI_TRANSITIONS=230} [2024-06-04 17:04:22,164 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 238 predicate places. [2024-06-04 17:04:22,164 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 230 transitions, 2757 flow [2024-06-04 17:04:22,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:22,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:22,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:22,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 17:04:22,165 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:04:22,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:22,165 INFO L85 PathProgramCache]: Analyzing trace with hash 246318631, now seen corresponding path program 7 times [2024-06-04 17:04:22,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:22,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773370405] [2024-06-04 17:04:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:22,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:27,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:27,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773370405] [2024-06-04 17:04:27,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773370405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:27,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:27,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:04:27,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079554218] [2024-06-04 17:04:27,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:27,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:04:27,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:27,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:04:27,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:04:27,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:04:27,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 230 transitions, 2757 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:27,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:27,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:04:27,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:27,671 INFO L124 PetriNetUnfolderBase]: 630/1124 cut-off events. [2024-06-04 17:04:27,671 INFO L125 PetriNetUnfolderBase]: For 67764/67764 co-relation queries the response was YES. [2024-06-04 17:04:27,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7843 conditions, 1124 events. 630/1124 cut-off events. For 67764/67764 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5879 event pairs, 140 based on Foata normal form. 2/1125 useless extension candidates. Maximal degree in co-relation 7719. Up to 1025 conditions per place. [2024-06-04 17:04:27,680 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 206 selfloop transitions, 36 changer transitions 0/244 dead transitions. [2024-06-04 17:04:27,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 244 transitions, 3279 flow [2024-06-04 17:04:27,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:04:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:04:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-04 17:04:27,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33225806451612905 [2024-06-04 17:04:27,681 INFO L175 Difference]: Start difference. First operand has 268 places, 230 transitions, 2757 flow. Second operand 10 states and 103 transitions. [2024-06-04 17:04:27,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 244 transitions, 3279 flow [2024-06-04 17:04:27,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 244 transitions, 3187 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-04 17:04:27,875 INFO L231 Difference]: Finished difference. Result has 271 places, 230 transitions, 2745 flow [2024-06-04 17:04:27,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2665, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2745, PETRI_PLACES=271, PETRI_TRANSITIONS=230} [2024-06-04 17:04:27,876 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 241 predicate places. [2024-06-04 17:04:27,876 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 230 transitions, 2745 flow [2024-06-04 17:04:27,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:27,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:27,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:27,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 17:04:27,877 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:04:27,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1910549379, now seen corresponding path program 15 times [2024-06-04 17:04:27,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:27,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463787310] [2024-06-04 17:04:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:27,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:32,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:32,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463787310] [2024-06-04 17:04:32,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463787310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:32,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:32,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:04:32,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560328255] [2024-06-04 17:04:32,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:32,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:04:32,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:32,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:04:32,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:04:32,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:04:32,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 230 transitions, 2745 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:32,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:32,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:04:32,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:33,290 INFO L124 PetriNetUnfolderBase]: 634/1133 cut-off events. [2024-06-04 17:04:33,290 INFO L125 PetriNetUnfolderBase]: For 67542/67542 co-relation queries the response was YES. [2024-06-04 17:04:33,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7881 conditions, 1133 events. 634/1133 cut-off events. For 67542/67542 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5926 event pairs, 92 based on Foata normal form. 2/1134 useless extension candidates. Maximal degree in co-relation 7756. Up to 999 conditions per place. [2024-06-04 17:04:33,300 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 200 selfloop transitions, 43 changer transitions 0/245 dead transitions. [2024-06-04 17:04:33,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 245 transitions, 3295 flow [2024-06-04 17:04:33,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:04:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:04:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 17:04:33,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-04 17:04:33,302 INFO L175 Difference]: Start difference. First operand has 271 places, 230 transitions, 2745 flow. Second operand 9 states and 96 transitions. [2024-06-04 17:04:33,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 245 transitions, 3295 flow [2024-06-04 17:04:33,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 245 transitions, 3204 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 17:04:33,481 INFO L231 Difference]: Finished difference. Result has 271 places, 231 transitions, 2774 flow [2024-06-04 17:04:33,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2654, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2774, PETRI_PLACES=271, PETRI_TRANSITIONS=231} [2024-06-04 17:04:33,481 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 241 predicate places. [2024-06-04 17:04:33,482 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 231 transitions, 2774 flow [2024-06-04 17:04:33,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:33,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:33,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:33,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 17:04:33,482 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:04:33,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:33,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1689119177, now seen corresponding path program 16 times [2024-06-04 17:04:33,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:33,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088820239] [2024-06-04 17:04:33,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:33,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:38,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:38,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088820239] [2024-06-04 17:04:38,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088820239] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:38,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:38,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:04:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189040976] [2024-06-04 17:04:38,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:38,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:04:38,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:38,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:04:38,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:04:38,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:04:38,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 231 transitions, 2774 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:38,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:38,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:04:38,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:39,107 INFO L124 PetriNetUnfolderBase]: 638/1141 cut-off events. [2024-06-04 17:04:39,107 INFO L125 PetriNetUnfolderBase]: For 68065/68065 co-relation queries the response was YES. [2024-06-04 17:04:39,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7956 conditions, 1141 events. 638/1141 cut-off events. For 68065/68065 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5979 event pairs, 86 based on Foata normal form. 2/1142 useless extension candidates. Maximal degree in co-relation 7831. Up to 928 conditions per place. [2024-06-04 17:04:39,121 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 185 selfloop transitions, 59 changer transitions 0/246 dead transitions. [2024-06-04 17:04:39,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 246 transitions, 3326 flow [2024-06-04 17:04:39,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:04:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:04:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 17:04:39,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-04 17:04:39,122 INFO L175 Difference]: Start difference. First operand has 271 places, 231 transitions, 2774 flow. Second operand 9 states and 98 transitions. [2024-06-04 17:04:39,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 246 transitions, 3326 flow [2024-06-04 17:04:39,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 246 transitions, 3216 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 17:04:39,334 INFO L231 Difference]: Finished difference. Result has 273 places, 232 transitions, 2818 flow [2024-06-04 17:04:39,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2666, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2818, PETRI_PLACES=273, PETRI_TRANSITIONS=232} [2024-06-04 17:04:39,335 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 243 predicate places. [2024-06-04 17:04:39,335 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 232 transitions, 2818 flow [2024-06-04 17:04:39,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:39,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:39,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:39,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 17:04:39,335 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:04:39,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:39,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1689272999, now seen corresponding path program 8 times [2024-06-04 17:04:39,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:39,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760773197] [2024-06-04 17:04:39,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:39,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:44,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:44,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760773197] [2024-06-04 17:04:44,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760773197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:44,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:44,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:04:44,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644836038] [2024-06-04 17:04:44,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:44,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:04:44,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:44,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:04:44,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:04:44,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:04:44,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 232 transitions, 2818 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:44,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:44,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:04:44,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:44,679 INFO L124 PetriNetUnfolderBase]: 639/1142 cut-off events. [2024-06-04 17:04:44,679 INFO L125 PetriNetUnfolderBase]: For 65906/65906 co-relation queries the response was YES. [2024-06-04 17:04:44,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7940 conditions, 1142 events. 639/1142 cut-off events. For 65906/65906 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6004 event pairs, 117 based on Foata normal form. 2/1140 useless extension candidates. Maximal degree in co-relation 7814. Up to 1040 conditions per place. [2024-06-04 17:04:44,691 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 213 selfloop transitions, 34 changer transitions 0/249 dead transitions. [2024-06-04 17:04:44,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 249 transitions, 3408 flow [2024-06-04 17:04:44,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:04:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:04:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-04 17:04:44,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-04 17:04:44,692 INFO L175 Difference]: Start difference. First operand has 273 places, 232 transitions, 2818 flow. Second operand 11 states and 116 transitions. [2024-06-04 17:04:44,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 249 transitions, 3408 flow [2024-06-04 17:04:44,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 249 transitions, 3268 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-04 17:04:44,868 INFO L231 Difference]: Finished difference. Result has 277 places, 234 transitions, 2807 flow [2024-06-04 17:04:44,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2678, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2807, PETRI_PLACES=277, PETRI_TRANSITIONS=234} [2024-06-04 17:04:44,869 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 247 predicate places. [2024-06-04 17:04:44,869 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 234 transitions, 2807 flow [2024-06-04 17:04:44,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:44,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:44,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:44,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 17:04:44,869 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:04:44,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1694844908, now seen corresponding path program 2 times [2024-06-04 17:04:44,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:44,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615078248] [2024-06-04 17:04:44,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:44,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:50,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:50,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615078248] [2024-06-04 17:04:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615078248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:50,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:50,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:04:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830739216] [2024-06-04 17:04:50,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:50,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:04:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:50,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:04:50,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:04:50,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:04:50,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 234 transitions, 2807 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:50,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:50,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:04:50,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:50,915 INFO L124 PetriNetUnfolderBase]: 643/1150 cut-off events. [2024-06-04 17:04:50,916 INFO L125 PetriNetUnfolderBase]: For 65797/65797 co-relation queries the response was YES. [2024-06-04 17:04:50,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7905 conditions, 1150 events. 643/1150 cut-off events. For 65797/65797 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6060 event pairs, 157 based on Foata normal form. 2/1150 useless extension candidates. Maximal degree in co-relation 7778. Up to 1107 conditions per place. [2024-06-04 17:04:50,928 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 224 selfloop transitions, 20 changer transitions 0/246 dead transitions. [2024-06-04 17:04:50,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 246 transitions, 3349 flow [2024-06-04 17:04:50,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:04:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:04:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2024-06-04 17:04:50,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30498533724340177 [2024-06-04 17:04:50,929 INFO L175 Difference]: Start difference. First operand has 277 places, 234 transitions, 2807 flow. Second operand 11 states and 104 transitions. [2024-06-04 17:04:50,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 246 transitions, 3349 flow [2024-06-04 17:04:51,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 246 transitions, 3199 flow, removed 32 selfloop flow, removed 13 redundant places. [2024-06-04 17:04:51,138 INFO L231 Difference]: Finished difference. Result has 275 places, 235 transitions, 2731 flow [2024-06-04 17:04:51,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2731, PETRI_PLACES=275, PETRI_TRANSITIONS=235} [2024-06-04 17:04:51,138 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 245 predicate places. [2024-06-04 17:04:51,138 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 235 transitions, 2731 flow [2024-06-04 17:04:51,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:51,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:51,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:51,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 17:04:51,139 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:04:51,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:51,139 INFO L85 PathProgramCache]: Analyzing trace with hash 639909787, now seen corresponding path program 17 times [2024-06-04 17:04:51,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:51,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311511016] [2024-06-04 17:04:51,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:51,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:04:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:04:55,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:04:55,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311511016] [2024-06-04 17:04:55,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311511016] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:04:55,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:04:55,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:04:55,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004821047] [2024-06-04 17:04:55,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:04:55,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:04:55,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:04:55,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:04:55,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:04:55,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:04:55,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 235 transitions, 2731 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:55,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:04:55,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:04:55,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:04:55,978 INFO L124 PetriNetUnfolderBase]: 647/1159 cut-off events. [2024-06-04 17:04:55,978 INFO L125 PetriNetUnfolderBase]: For 67447/67447 co-relation queries the response was YES. [2024-06-04 17:04:55,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7845 conditions, 1159 events. 647/1159 cut-off events. For 67447/67447 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6115 event pairs, 96 based on Foata normal form. 2/1156 useless extension candidates. Maximal degree in co-relation 7722. Up to 1027 conditions per place. [2024-06-04 17:04:55,991 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 204 selfloop transitions, 42 changer transitions 0/248 dead transitions. [2024-06-04 17:04:55,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 248 transitions, 3281 flow [2024-06-04 17:04:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:04:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:04:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-04 17:04:55,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34050179211469533 [2024-06-04 17:04:55,992 INFO L175 Difference]: Start difference. First operand has 275 places, 235 transitions, 2731 flow. Second operand 9 states and 95 transitions. [2024-06-04 17:04:55,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 248 transitions, 3281 flow [2024-06-04 17:04:56,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 248 transitions, 3161 flow, removed 19 selfloop flow, removed 12 redundant places. [2024-06-04 17:04:56,182 INFO L231 Difference]: Finished difference. Result has 272 places, 236 transitions, 2727 flow [2024-06-04 17:04:56,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2611, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2727, PETRI_PLACES=272, PETRI_TRANSITIONS=236} [2024-06-04 17:04:56,182 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 242 predicate places. [2024-06-04 17:04:56,182 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 236 transitions, 2727 flow [2024-06-04 17:04:56,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:04:56,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:04:56,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:04:56,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 17:04:56,183 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:04:56,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:04:56,183 INFO L85 PathProgramCache]: Analyzing trace with hash 99424713, now seen corresponding path program 18 times [2024-06-04 17:04:56,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:04:56,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986232885] [2024-06-04 17:04:56,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:04:56,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:04:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:00,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:00,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986232885] [2024-06-04 17:05:00,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986232885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:00,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:00,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:05:00,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355352713] [2024-06-04 17:05:00,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:00,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:05:00,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:00,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:05:00,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:05:00,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:05:00,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 236 transitions, 2727 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:00,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:00,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:05:00,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:00,917 INFO L124 PetriNetUnfolderBase]: 651/1167 cut-off events. [2024-06-04 17:05:00,917 INFO L125 PetriNetUnfolderBase]: For 69355/69355 co-relation queries the response was YES. [2024-06-04 17:05:00,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7900 conditions, 1167 events. 651/1167 cut-off events. For 69355/69355 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6164 event pairs, 94 based on Foata normal form. 2/1164 useless extension candidates. Maximal degree in co-relation 7778. Up to 1035 conditions per place. [2024-06-04 17:05:00,930 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 206 selfloop transitions, 41 changer transitions 0/249 dead transitions. [2024-06-04 17:05:00,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 249 transitions, 3279 flow [2024-06-04 17:05:00,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:05:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:05:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-04 17:05:00,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36917562724014336 [2024-06-04 17:05:00,931 INFO L175 Difference]: Start difference. First operand has 272 places, 236 transitions, 2727 flow. Second operand 9 states and 103 transitions. [2024-06-04 17:05:00,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 249 transitions, 3279 flow [2024-06-04 17:05:01,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 249 transitions, 3173 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-04 17:05:01,116 INFO L231 Difference]: Finished difference. Result has 274 places, 237 transitions, 2737 flow [2024-06-04 17:05:01,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2621, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2737, PETRI_PLACES=274, PETRI_TRANSITIONS=237} [2024-06-04 17:05:01,117 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 244 predicate places. [2024-06-04 17:05:01,117 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 237 transitions, 2737 flow [2024-06-04 17:05:01,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:01,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:01,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:01,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 17:05:01,117 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:05:01,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash -879582625, now seen corresponding path program 19 times [2024-06-04 17:05:01,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:01,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262183888] [2024-06-04 17:05:01,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:01,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:05,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:05,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262183888] [2024-06-04 17:05:05,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262183888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:05,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:05,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:05:05,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531370478] [2024-06-04 17:05:05,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:05,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:05:05,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:05,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:05:05,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:05:05,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:05:05,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 237 transitions, 2737 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:05,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:05,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:05:05,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:05,739 INFO L124 PetriNetUnfolderBase]: 655/1175 cut-off events. [2024-06-04 17:05:05,739 INFO L125 PetriNetUnfolderBase]: For 71557/71557 co-relation queries the response was YES. [2024-06-04 17:05:05,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7961 conditions, 1175 events. 655/1175 cut-off events. For 71557/71557 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6248 event pairs, 153 based on Foata normal form. 2/1174 useless extension candidates. Maximal degree in co-relation 7838. Up to 1092 conditions per place. [2024-06-04 17:05:05,750 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 216 selfloop transitions, 31 changer transitions 0/249 dead transitions. [2024-06-04 17:05:05,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 249 transitions, 3289 flow [2024-06-04 17:05:05,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:05:05,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:05:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2024-06-04 17:05:05,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 17:05:05,751 INFO L175 Difference]: Start difference. First operand has 274 places, 237 transitions, 2737 flow. Second operand 9 states and 93 transitions. [2024-06-04 17:05:05,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 249 transitions, 3289 flow [2024-06-04 17:05:05,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 249 transitions, 3183 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-04 17:05:05,985 INFO L231 Difference]: Finished difference. Result has 276 places, 238 transitions, 2729 flow [2024-06-04 17:05:05,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2631, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2729, PETRI_PLACES=276, PETRI_TRANSITIONS=238} [2024-06-04 17:05:05,986 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 246 predicate places. [2024-06-04 17:05:05,986 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 238 transitions, 2729 flow [2024-06-04 17:05:05,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:05,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:05,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:05,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-04 17:05:05,986 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:05:05,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:05,987 INFO L85 PathProgramCache]: Analyzing trace with hash -879576673, now seen corresponding path program 9 times [2024-06-04 17:05:05,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:05,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034276550] [2024-06-04 17:05:05,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:05,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:10,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:10,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034276550] [2024-06-04 17:05:10,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034276550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:10,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:10,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:05:10,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919880999] [2024-06-04 17:05:10,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:10,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:05:10,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:10,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:05:10,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:05:11,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:05:11,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 238 transitions, 2729 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:11,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:11,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:05:11,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:11,483 INFO L124 PetriNetUnfolderBase]: 661/1185 cut-off events. [2024-06-04 17:05:11,483 INFO L125 PetriNetUnfolderBase]: For 73709/73709 co-relation queries the response was YES. [2024-06-04 17:05:11,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8005 conditions, 1185 events. 661/1185 cut-off events. For 73709/73709 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6338 event pairs, 145 based on Foata normal form. 2/1184 useless extension candidates. Maximal degree in co-relation 7881. Up to 1020 conditions per place. [2024-06-04 17:05:11,492 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 201 selfloop transitions, 53 changer transitions 0/256 dead transitions. [2024-06-04 17:05:11,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 256 transitions, 3335 flow [2024-06-04 17:05:11,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:05:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:05:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-04 17:05:11,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3313782991202346 [2024-06-04 17:05:11,493 INFO L175 Difference]: Start difference. First operand has 276 places, 238 transitions, 2729 flow. Second operand 11 states and 113 transitions. [2024-06-04 17:05:11,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 256 transitions, 3335 flow [2024-06-04 17:05:11,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 256 transitions, 3247 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 17:05:11,695 INFO L231 Difference]: Finished difference. Result has 282 places, 243 transitions, 2858 flow [2024-06-04 17:05:11,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2641, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2858, PETRI_PLACES=282, PETRI_TRANSITIONS=243} [2024-06-04 17:05:11,695 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 252 predicate places. [2024-06-04 17:05:11,696 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 243 transitions, 2858 flow [2024-06-04 17:05:11,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:11,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:11,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:11,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-04 17:05:11,696 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:05:11,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash 105150444, now seen corresponding path program 3 times [2024-06-04 17:05:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:11,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311575191] [2024-06-04 17:05:11,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:11,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:16,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:16,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311575191] [2024-06-04 17:05:16,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311575191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:16,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:16,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:05:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141548217] [2024-06-04 17:05:16,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:16,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:05:16,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:16,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:05:16,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:05:16,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:05:16,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 243 transitions, 2858 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:16,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:16,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:05:16,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:17,177 INFO L124 PetriNetUnfolderBase]: 665/1193 cut-off events. [2024-06-04 17:05:17,177 INFO L125 PetriNetUnfolderBase]: For 75376/75376 co-relation queries the response was YES. [2024-06-04 17:05:17,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8199 conditions, 1193 events. 665/1193 cut-off events. For 75376/75376 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6361 event pairs, 163 based on Foata normal form. 2/1192 useless extension candidates. Maximal degree in co-relation 8072. Up to 1140 conditions per place. [2024-06-04 17:05:17,190 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 229 selfloop transitions, 22 changer transitions 0/253 dead transitions. [2024-06-04 17:05:17,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 253 transitions, 3410 flow [2024-06-04 17:05:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:05:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:05:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2024-06-04 17:05:17,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-04 17:05:17,191 INFO L175 Difference]: Start difference. First operand has 282 places, 243 transitions, 2858 flow. Second operand 9 states and 90 transitions. [2024-06-04 17:05:17,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 253 transitions, 3410 flow [2024-06-04 17:05:17,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 253 transitions, 3313 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 17:05:17,428 INFO L231 Difference]: Finished difference. Result has 284 places, 244 transitions, 2841 flow [2024-06-04 17:05:17,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2761, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2841, PETRI_PLACES=284, PETRI_TRANSITIONS=244} [2024-06-04 17:05:17,429 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 254 predicate places. [2024-06-04 17:05:17,429 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 244 transitions, 2841 flow [2024-06-04 17:05:17,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:17,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:17,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:17,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-04 17:05:17,430 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:05:17,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:17,431 INFO L85 PathProgramCache]: Analyzing trace with hash 645416317, now seen corresponding path program 20 times [2024-06-04 17:05:17,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:17,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953656551] [2024-06-04 17:05:17,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:17,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:22,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953656551] [2024-06-04 17:05:22,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953656551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:22,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:22,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:05:22,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800171052] [2024-06-04 17:05:22,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:22,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:05:22,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:22,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:05:22,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:05:22,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:05:22,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 244 transitions, 2841 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:22,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:22,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:05:22,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:22,982 INFO L124 PetriNetUnfolderBase]: 662/1188 cut-off events. [2024-06-04 17:05:22,982 INFO L125 PetriNetUnfolderBase]: For 71958/71958 co-relation queries the response was YES. [2024-06-04 17:05:22,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7952 conditions, 1188 events. 662/1188 cut-off events. For 71958/71958 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6351 event pairs, 160 based on Foata normal form. 2/1187 useless extension candidates. Maximal degree in co-relation 7824. Up to 1135 conditions per place. [2024-06-04 17:05:22,994 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 231 selfloop transitions, 21 changer transitions 0/254 dead transitions. [2024-06-04 17:05:22,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 254 transitions, 3369 flow [2024-06-04 17:05:22,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:05:22,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:05:22,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2024-06-04 17:05:22,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-04 17:05:22,996 INFO L175 Difference]: Start difference. First operand has 284 places, 244 transitions, 2841 flow. Second operand 9 states and 90 transitions. [2024-06-04 17:05:22,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 254 transitions, 3369 flow [2024-06-04 17:05:23,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 254 transitions, 3299 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 17:05:23,218 INFO L231 Difference]: Finished difference. Result has 286 places, 244 transitions, 2817 flow [2024-06-04 17:05:23,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2771, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2817, PETRI_PLACES=286, PETRI_TRANSITIONS=244} [2024-06-04 17:05:23,219 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 256 predicate places. [2024-06-04 17:05:23,219 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 244 transitions, 2817 flow [2024-06-04 17:05:23,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:23,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:23,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:23,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-04 17:05:23,219 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:05:23,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1086164489, now seen corresponding path program 10 times [2024-06-04 17:05:23,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:23,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267370251] [2024-06-04 17:05:23,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:23,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:28,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:28,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267370251] [2024-06-04 17:05:28,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267370251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:28,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:28,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:05:28,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269698546] [2024-06-04 17:05:28,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:28,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:05:28,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:28,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:05:28,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:05:28,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:05:28,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 244 transitions, 2817 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:28,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:28,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:05:28,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:28,952 INFO L124 PetriNetUnfolderBase]: 668/1198 cut-off events. [2024-06-04 17:05:28,952 INFO L125 PetriNetUnfolderBase]: For 73470/73470 co-relation queries the response was YES. [2024-06-04 17:05:28,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7993 conditions, 1198 events. 668/1198 cut-off events. For 73470/73470 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6422 event pairs, 157 based on Foata normal form. 2/1197 useless extension candidates. Maximal degree in co-relation 7864. Up to 1106 conditions per place. [2024-06-04 17:05:28,964 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 226 selfloop transitions, 32 changer transitions 0/260 dead transitions. [2024-06-04 17:05:28,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 260 transitions, 3557 flow [2024-06-04 17:05:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:05:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:05:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:05:28,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-04 17:05:28,966 INFO L175 Difference]: Start difference. First operand has 286 places, 244 transitions, 2817 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:05:28,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 260 transitions, 3557 flow [2024-06-04 17:05:29,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 260 transitions, 3426 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 17:05:29,198 INFO L231 Difference]: Finished difference. Result has 288 places, 246 transitions, 2793 flow [2024-06-04 17:05:29,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2686, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2793, PETRI_PLACES=288, PETRI_TRANSITIONS=246} [2024-06-04 17:05:29,199 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 258 predicate places. [2024-06-04 17:05:29,199 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 246 transitions, 2793 flow [2024-06-04 17:05:29,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:29,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:29,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:29,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-04 17:05:29,199 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:05:29,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:29,200 INFO L85 PathProgramCache]: Analyzing trace with hash 889248435, now seen corresponding path program 11 times [2024-06-04 17:05:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:29,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054877680] [2024-06-04 17:05:29,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:29,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:34,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:34,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054877680] [2024-06-04 17:05:34,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054877680] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:34,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:34,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:05:34,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347560737] [2024-06-04 17:05:34,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:34,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:05:34,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:34,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:05:34,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:05:34,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:05:34,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 246 transitions, 2793 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:34,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:34,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:05:34,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:35,146 INFO L124 PetriNetUnfolderBase]: 664/1192 cut-off events. [2024-06-04 17:05:35,147 INFO L125 PetriNetUnfolderBase]: For 69255/69255 co-relation queries the response was YES. [2024-06-04 17:05:35,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7731 conditions, 1192 events. 664/1192 cut-off events. For 69255/69255 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6380 event pairs, 221 based on Foata normal form. 2/1193 useless extension candidates. Maximal degree in co-relation 7601. Up to 1137 conditions per place. [2024-06-04 17:05:35,158 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 233 selfloop transitions, 22 changer transitions 0/257 dead transitions. [2024-06-04 17:05:35,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 257 transitions, 3331 flow [2024-06-04 17:05:35,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:05:35,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:05:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2024-06-04 17:05:35,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31085043988269795 [2024-06-04 17:05:35,159 INFO L175 Difference]: Start difference. First operand has 288 places, 246 transitions, 2793 flow. Second operand 11 states and 106 transitions. [2024-06-04 17:05:35,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 257 transitions, 3331 flow [2024-06-04 17:05:35,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 257 transitions, 3215 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-04 17:05:35,489 INFO L231 Difference]: Finished difference. Result has 291 places, 246 transitions, 2726 flow [2024-06-04 17:05:35,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2677, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2726, PETRI_PLACES=291, PETRI_TRANSITIONS=246} [2024-06-04 17:05:35,489 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 261 predicate places. [2024-06-04 17:05:35,489 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 246 transitions, 2726 flow [2024-06-04 17:05:35,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:35,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:35,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:35,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-04 17:05:35,490 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:05:35,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:35,490 INFO L85 PathProgramCache]: Analyzing trace with hash -622866634, now seen corresponding path program 4 times [2024-06-04 17:05:35,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:35,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71967204] [2024-06-04 17:05:35,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:35,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:40,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:40,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71967204] [2024-06-04 17:05:40,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71967204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:40,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:40,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:05:40,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584861992] [2024-06-04 17:05:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:40,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:05:40,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:40,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:05:40,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:05:41,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:05:41,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 246 transitions, 2726 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:41,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:41,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:05:41,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:41,414 INFO L124 PetriNetUnfolderBase]: 671/1205 cut-off events. [2024-06-04 17:05:41,414 INFO L125 PetriNetUnfolderBase]: For 71211/71211 co-relation queries the response was YES. [2024-06-04 17:05:41,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7771 conditions, 1205 events. 671/1205 cut-off events. For 71211/71211 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6454 event pairs, 225 based on Foata normal form. 2/1206 useless extension candidates. Maximal degree in co-relation 7640. Up to 1169 conditions per place. [2024-06-04 17:05:41,426 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 241 selfloop transitions, 16 changer transitions 0/259 dead transitions. [2024-06-04 17:05:41,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 259 transitions, 3318 flow [2024-06-04 17:05:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:05:41,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:05:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2024-06-04 17:05:41,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3064516129032258 [2024-06-04 17:05:41,427 INFO L175 Difference]: Start difference. First operand has 291 places, 246 transitions, 2726 flow. Second operand 10 states and 95 transitions. [2024-06-04 17:05:41,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 259 transitions, 3318 flow [2024-06-04 17:05:41,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 259 transitions, 3234 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-04 17:05:41,640 INFO L231 Difference]: Finished difference. Result has 290 places, 249 transitions, 2743 flow [2024-06-04 17:05:41,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2648, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2743, PETRI_PLACES=290, PETRI_TRANSITIONS=249} [2024-06-04 17:05:41,641 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 260 predicate places. [2024-06-04 17:05:41,641 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 249 transitions, 2743 flow [2024-06-04 17:05:41,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:41,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:41,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:41,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-04 17:05:41,641 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:05:41,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:41,641 INFO L85 PathProgramCache]: Analyzing trace with hash -613343434, now seen corresponding path program 5 times [2024-06-04 17:05:41,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:41,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106489882] [2024-06-04 17:05:41,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:41,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:46,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-04 17:05:46,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:46,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106489882] [2024-06-04 17:05:46,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106489882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:46,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:46,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:05:46,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124743309] [2024-06-04 17:05:46,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:46,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:05:46,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:46,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:05:46,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:05:46,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:05:46,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 249 transitions, 2743 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:46,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:46,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:05:46,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:46,806 INFO L124 PetriNetUnfolderBase]: 682/1226 cut-off events. [2024-06-04 17:05:46,806 INFO L125 PetriNetUnfolderBase]: For 79795/79795 co-relation queries the response was YES. [2024-06-04 17:05:46,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8107 conditions, 1226 events. 682/1226 cut-off events. For 79795/79795 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6622 event pairs, 224 based on Foata normal form. 2/1227 useless extension candidates. Maximal degree in co-relation 7976. Up to 1161 conditions per place. [2024-06-04 17:05:46,818 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 240 selfloop transitions, 22 changer transitions 0/264 dead transitions. [2024-06-04 17:05:46,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 264 transitions, 3517 flow [2024-06-04 17:05:46,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:05:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:05:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-04 17:05:46,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-04 17:05:46,821 INFO L175 Difference]: Start difference. First operand has 290 places, 249 transitions, 2743 flow. Second operand 11 states and 116 transitions. [2024-06-04 17:05:46,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 264 transitions, 3517 flow [2024-06-04 17:05:47,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 264 transitions, 3458 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 17:05:47,075 INFO L231 Difference]: Finished difference. Result has 294 places, 251 transitions, 2802 flow [2024-06-04 17:05:47,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2684, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2802, PETRI_PLACES=294, PETRI_TRANSITIONS=251} [2024-06-04 17:05:47,076 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 264 predicate places. [2024-06-04 17:05:47,076 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 251 transitions, 2802 flow [2024-06-04 17:05:47,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:47,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:47,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:47,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-04 17:05:47,077 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:05:47,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash 99578535, now seen corresponding path program 12 times [2024-06-04 17:05:47,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:47,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207432236] [2024-06-04 17:05:47,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:47,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:51,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:51,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207432236] [2024-06-04 17:05:51,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207432236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:51,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:51,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:05:51,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558685903] [2024-06-04 17:05:51,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:51,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:05:51,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:51,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:05:51,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:05:51,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:05:51,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 251 transitions, 2802 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:51,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:51,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:05:51,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:51,934 INFO L124 PetriNetUnfolderBase]: 678/1220 cut-off events. [2024-06-04 17:05:51,934 INFO L125 PetriNetUnfolderBase]: For 75419/75419 co-relation queries the response was YES. [2024-06-04 17:05:51,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7909 conditions, 1220 events. 678/1220 cut-off events. For 75419/75419 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6580 event pairs, 101 based on Foata normal form. 2/1217 useless extension candidates. Maximal degree in co-relation 7777. Up to 1078 conditions per place. [2024-06-04 17:05:51,944 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 216 selfloop transitions, 49 changer transitions 0/267 dead transitions. [2024-06-04 17:05:51,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 267 transitions, 3416 flow [2024-06-04 17:05:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:05:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:05:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-04 17:05:51,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3343108504398827 [2024-06-04 17:05:51,945 INFO L175 Difference]: Start difference. First operand has 294 places, 251 transitions, 2802 flow. Second operand 11 states and 114 transitions. [2024-06-04 17:05:51,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 267 transitions, 3416 flow [2024-06-04 17:05:52,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 267 transitions, 3358 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-04 17:05:52,162 INFO L231 Difference]: Finished difference. Result has 299 places, 253 transitions, 2895 flow [2024-06-04 17:05:52,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2744, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2895, PETRI_PLACES=299, PETRI_TRANSITIONS=253} [2024-06-04 17:05:52,163 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 269 predicate places. [2024-06-04 17:05:52,163 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 253 transitions, 2895 flow [2024-06-04 17:05:52,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:52,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:52,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:52,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-04 17:05:52,164 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:05:52,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash 105142725, now seen corresponding path program 13 times [2024-06-04 17:05:52,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:52,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404853696] [2024-06-04 17:05:52,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:52,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:05:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:05:57,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:05:57,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404853696] [2024-06-04 17:05:57,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404853696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:05:57,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:05:57,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:05:57,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366877634] [2024-06-04 17:05:57,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:05:57,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:05:57,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:05:57,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:05:57,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:05:57,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:05:57,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 253 transitions, 2895 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:57,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:05:57,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:05:57,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:05:57,633 INFO L124 PetriNetUnfolderBase]: 674/1214 cut-off events. [2024-06-04 17:05:57,633 INFO L125 PetriNetUnfolderBase]: For 70569/70569 co-relation queries the response was YES. [2024-06-04 17:05:57,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7777 conditions, 1214 events. 674/1214 cut-off events. For 70569/70569 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6565 event pairs, 158 based on Foata normal form. 2/1213 useless extension candidates. Maximal degree in co-relation 7643. Up to 1142 conditions per place. [2024-06-04 17:05:57,646 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 235 selfloop transitions, 29 changer transitions 0/266 dead transitions. [2024-06-04 17:05:57,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 266 transitions, 3459 flow [2024-06-04 17:05:57,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:05:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:05:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-04 17:05:57,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-04 17:05:57,649 INFO L175 Difference]: Start difference. First operand has 299 places, 253 transitions, 2895 flow. Second operand 11 states and 110 transitions. [2024-06-04 17:05:57,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 266 transitions, 3459 flow [2024-06-04 17:05:57,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 266 transitions, 3300 flow, removed 32 selfloop flow, removed 9 redundant places. [2024-06-04 17:05:57,850 INFO L231 Difference]: Finished difference. Result has 301 places, 253 transitions, 2799 flow [2024-06-04 17:05:57,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2736, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2799, PETRI_PLACES=301, PETRI_TRANSITIONS=253} [2024-06-04 17:05:57,850 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 271 predicate places. [2024-06-04 17:05:57,851 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 253 transitions, 2799 flow [2024-06-04 17:05:57,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:05:57,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:05:57,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:05:57,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-04 17:05:57,851 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:05:57,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:05:57,852 INFO L85 PathProgramCache]: Analyzing trace with hash -613669864, now seen corresponding path program 6 times [2024-06-04 17:05:57,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:05:57,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514070011] [2024-06-04 17:05:57,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:05:57,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:05:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:03,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:03,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514070011] [2024-06-04 17:06:03,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514070011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:03,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:03,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:06:03,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189399114] [2024-06-04 17:06:03,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:03,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:06:03,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:03,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:06:03,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:06:03,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:06:03,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 253 transitions, 2799 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:03,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:03,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:06:03,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:03,609 INFO L124 PetriNetUnfolderBase]: 671/1209 cut-off events. [2024-06-04 17:06:03,609 INFO L125 PetriNetUnfolderBase]: For 65417/65417 co-relation queries the response was YES. [2024-06-04 17:06:03,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7481 conditions, 1209 events. 671/1209 cut-off events. For 65417/65417 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6530 event pairs, 223 based on Foata normal form. 2/1210 useless extension candidates. Maximal degree in co-relation 7346. Up to 1167 conditions per place. [2024-06-04 17:06:03,621 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 242 selfloop transitions, 20 changer transitions 0/264 dead transitions. [2024-06-04 17:06:03,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 264 transitions, 3347 flow [2024-06-04 17:06:03,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:06:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:06:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2024-06-04 17:06:03,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30498533724340177 [2024-06-04 17:06:03,623 INFO L175 Difference]: Start difference. First operand has 301 places, 253 transitions, 2799 flow. Second operand 11 states and 104 transitions. [2024-06-04 17:06:03,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 264 transitions, 3347 flow [2024-06-04 17:06:03,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 264 transitions, 3211 flow, removed 17 selfloop flow, removed 11 redundant places. [2024-06-04 17:06:03,841 INFO L231 Difference]: Finished difference. Result has 301 places, 253 transitions, 2707 flow [2024-06-04 17:06:03,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2663, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2707, PETRI_PLACES=301, PETRI_TRANSITIONS=253} [2024-06-04 17:06:03,841 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 271 predicate places. [2024-06-04 17:06:03,842 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 253 transitions, 2707 flow [2024-06-04 17:06:03,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:03,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:03,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:03,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-04 17:06:03,842 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:06:03,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:03,843 INFO L85 PathProgramCache]: Analyzing trace with hash -879367144, now seen corresponding path program 7 times [2024-06-04 17:06:03,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:03,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609306024] [2024-06-04 17:06:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:09,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:09,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609306024] [2024-06-04 17:06:09,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609306024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:09,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:09,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:06:09,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494854583] [2024-06-04 17:06:09,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:09,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:06:09,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:09,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:06:09,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:06:09,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:06:09,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 253 transitions, 2707 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:09,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:09,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:06:09,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:10,088 INFO L124 PetriNetUnfolderBase]: 668/1204 cut-off events. [2024-06-04 17:06:10,088 INFO L125 PetriNetUnfolderBase]: For 59771/59771 co-relation queries the response was YES. [2024-06-04 17:06:10,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7182 conditions, 1204 events. 668/1204 cut-off events. For 59771/59771 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6526 event pairs, 162 based on Foata normal form. 2/1203 useless extension candidates. Maximal degree in co-relation 7047. Up to 1124 conditions per place. [2024-06-04 17:06:10,100 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 225 selfloop transitions, 36 changer transitions 0/263 dead transitions. [2024-06-04 17:06:10,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 263 transitions, 3251 flow [2024-06-04 17:06:10,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:06:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:06:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2024-06-04 17:06:10,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-04 17:06:10,102 INFO L175 Difference]: Start difference. First operand has 301 places, 253 transitions, 2707 flow. Second operand 10 states and 100 transitions. [2024-06-04 17:06:10,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 263 transitions, 3251 flow [2024-06-04 17:06:10,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 263 transitions, 3185 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-04 17:06:10,296 INFO L231 Difference]: Finished difference. Result has 299 places, 253 transitions, 2717 flow [2024-06-04 17:06:10,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2641, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2717, PETRI_PLACES=299, PETRI_TRANSITIONS=253} [2024-06-04 17:06:10,297 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 269 predicate places. [2024-06-04 17:06:10,297 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 253 transitions, 2717 flow [2024-06-04 17:06:10,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:10,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:10,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:10,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-04 17:06:10,297 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:06:10,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1419856217, now seen corresponding path program 14 times [2024-06-04 17:06:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:10,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560091310] [2024-06-04 17:06:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:10,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:14,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:14,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560091310] [2024-06-04 17:06:14,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560091310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:14,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:14,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:06:14,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957597847] [2024-06-04 17:06:14,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:14,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:06:14,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:14,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:06:14,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:06:14,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:06:14,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 253 transitions, 2717 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:14,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:14,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:06:14,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:15,178 INFO L124 PetriNetUnfolderBase]: 664/1198 cut-off events. [2024-06-04 17:06:15,178 INFO L125 PetriNetUnfolderBase]: For 54551/54551 co-relation queries the response was YES. [2024-06-04 17:06:15,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7001 conditions, 1198 events. 664/1198 cut-off events. For 54551/54551 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6490 event pairs, 155 based on Foata normal form. 2/1197 useless extension candidates. Maximal degree in co-relation 6866. Up to 916 conditions per place. [2024-06-04 17:06:15,191 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 194 selfloop transitions, 71 changer transitions 0/267 dead transitions. [2024-06-04 17:06:15,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 267 transitions, 3287 flow [2024-06-04 17:06:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:06:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:06:15,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 17:06:15,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36129032258064514 [2024-06-04 17:06:15,193 INFO L175 Difference]: Start difference. First operand has 299 places, 253 transitions, 2717 flow. Second operand 10 states and 112 transitions. [2024-06-04 17:06:15,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 267 transitions, 3287 flow [2024-06-04 17:06:15,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 267 transitions, 3079 flow, removed 30 selfloop flow, removed 12 redundant places. [2024-06-04 17:06:15,368 INFO L231 Difference]: Finished difference. Result has 297 places, 253 transitions, 2656 flow [2024-06-04 17:06:15,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2509, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2656, PETRI_PLACES=297, PETRI_TRANSITIONS=253} [2024-06-04 17:06:15,368 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 267 predicate places. [2024-06-04 17:06:15,368 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 253 transitions, 2656 flow [2024-06-04 17:06:15,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:15,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:15,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:15,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-04 17:06:15,369 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:06:15,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1975571086, now seen corresponding path program 1 times [2024-06-04 17:06:15,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:15,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994416678] [2024-06-04 17:06:15,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:15,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:20,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:20,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994416678] [2024-06-04 17:06:20,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994416678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:20,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:20,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:06:20,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363947730] [2024-06-04 17:06:20,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:20,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:06:20,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:20,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:06:20,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:06:20,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:06:20,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 253 transitions, 2656 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:20,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:20,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:06:20,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:21,128 INFO L124 PetriNetUnfolderBase]: 668/1205 cut-off events. [2024-06-04 17:06:21,128 INFO L125 PetriNetUnfolderBase]: For 57359/57359 co-relation queries the response was YES. [2024-06-04 17:06:21,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7004 conditions, 1205 events. 668/1205 cut-off events. For 57359/57359 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6542 event pairs, 111 based on Foata normal form. 2/1206 useless extension candidates. Maximal degree in co-relation 6871. Up to 1076 conditions per place. [2024-06-04 17:06:21,140 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 244 selfloop transitions, 28 changer transitions 0/274 dead transitions. [2024-06-04 17:06:21,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 274 transitions, 3284 flow [2024-06-04 17:06:21,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:06:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:06:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2024-06-04 17:06:21,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2024-06-04 17:06:21,141 INFO L175 Difference]: Start difference. First operand has 297 places, 253 transitions, 2656 flow. Second operand 11 states and 110 transitions. [2024-06-04 17:06:21,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 274 transitions, 3284 flow [2024-06-04 17:06:21,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 274 transitions, 3103 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 17:06:21,353 INFO L231 Difference]: Finished difference. Result has 298 places, 254 transitions, 2573 flow [2024-06-04 17:06:21,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2477, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2573, PETRI_PLACES=298, PETRI_TRANSITIONS=254} [2024-06-04 17:06:21,353 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 268 predicate places. [2024-06-04 17:06:21,353 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 254 transitions, 2573 flow [2024-06-04 17:06:21,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:21,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:21,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:21,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-04 17:06:21,354 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:06:21,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:21,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1790075298, now seen corresponding path program 2 times [2024-06-04 17:06:21,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:21,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845991237] [2024-06-04 17:06:21,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:21,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:26,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:26,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845991237] [2024-06-04 17:06:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845991237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:26,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:26,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:06:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46186095] [2024-06-04 17:06:26,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:26,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:06:26,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:06:26,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:06:26,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:06:26,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 254 transitions, 2573 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:26,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:26,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:06:26,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:27,325 INFO L124 PetriNetUnfolderBase]: 672/1213 cut-off events. [2024-06-04 17:06:27,325 INFO L125 PetriNetUnfolderBase]: For 56990/56990 co-relation queries the response was YES. [2024-06-04 17:06:27,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6969 conditions, 1213 events. 672/1213 cut-off events. For 56990/56990 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6614 event pairs, 146 based on Foata normal form. 2/1214 useless extension candidates. Maximal degree in co-relation 6835. Up to 1119 conditions per place. [2024-06-04 17:06:27,337 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 247 selfloop transitions, 26 changer transitions 0/275 dead transitions. [2024-06-04 17:06:27,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 275 transitions, 3205 flow [2024-06-04 17:06:27,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:06:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:06:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-04 17:06:27,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3313782991202346 [2024-06-04 17:06:27,339 INFO L175 Difference]: Start difference. First operand has 298 places, 254 transitions, 2573 flow. Second operand 11 states and 113 transitions. [2024-06-04 17:06:27,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 275 transitions, 3205 flow [2024-06-04 17:06:27,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 275 transitions, 3119 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-04 17:06:27,550 INFO L231 Difference]: Finished difference. Result has 300 places, 255 transitions, 2581 flow [2024-06-04 17:06:27,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2581, PETRI_PLACES=300, PETRI_TRANSITIONS=255} [2024-06-04 17:06:27,551 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 270 predicate places. [2024-06-04 17:06:27,551 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 255 transitions, 2581 flow [2024-06-04 17:06:27,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:27,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:27,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:27,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-04 17:06:27,552 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:06:27,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash -712069618, now seen corresponding path program 3 times [2024-06-04 17:06:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:27,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175870093] [2024-06-04 17:06:27,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:27,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:32,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:32,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:32,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175870093] [2024-06-04 17:06:32,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175870093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:32,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:32,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:06:32,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971285000] [2024-06-04 17:06:32,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:32,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:06:32,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:32,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:06:32,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:06:32,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:06:32,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 255 transitions, 2581 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:32,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:32,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:06:32,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:33,252 INFO L124 PetriNetUnfolderBase]: 676/1221 cut-off events. [2024-06-04 17:06:33,253 INFO L125 PetriNetUnfolderBase]: For 60596/60596 co-relation queries the response was YES. [2024-06-04 17:06:33,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7010 conditions, 1221 events. 676/1221 cut-off events. For 60596/60596 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6670 event pairs, 143 based on Foata normal form. 2/1222 useless extension candidates. Maximal degree in co-relation 6875. Up to 1128 conditions per place. [2024-06-04 17:06:33,265 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 244 selfloop transitions, 29 changer transitions 0/275 dead transitions. [2024-06-04 17:06:33,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 275 transitions, 3213 flow [2024-06-04 17:06:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:06:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:06:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-04 17:06:33,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3313782991202346 [2024-06-04 17:06:33,266 INFO L175 Difference]: Start difference. First operand has 300 places, 255 transitions, 2581 flow. Second operand 11 states and 113 transitions. [2024-06-04 17:06:33,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 275 transitions, 3213 flow [2024-06-04 17:06:33,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 275 transitions, 3129 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-04 17:06:33,482 INFO L231 Difference]: Finished difference. Result has 302 places, 256 transitions, 2599 flow [2024-06-04 17:06:33,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2497, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2599, PETRI_PLACES=302, PETRI_TRANSITIONS=256} [2024-06-04 17:06:33,482 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 272 predicate places. [2024-06-04 17:06:33,482 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 256 transitions, 2599 flow [2024-06-04 17:06:33,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:33,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:33,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:33,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-04 17:06:33,483 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:06:33,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:33,483 INFO L85 PathProgramCache]: Analyzing trace with hash -700335808, now seen corresponding path program 4 times [2024-06-04 17:06:33,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:33,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109275744] [2024-06-04 17:06:33,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:33,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:38,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:38,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109275744] [2024-06-04 17:06:38,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109275744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:38,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:38,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:06:38,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551331105] [2024-06-04 17:06:38,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:38,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:06:38,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:38,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:06:38,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:06:38,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:06:38,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 256 transitions, 2599 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:38,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:38,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:06:38,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:39,402 INFO L124 PetriNetUnfolderBase]: 687/1242 cut-off events. [2024-06-04 17:06:39,403 INFO L125 PetriNetUnfolderBase]: For 70325/70325 co-relation queries the response was YES. [2024-06-04 17:06:39,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7381 conditions, 1242 events. 687/1242 cut-off events. For 70325/70325 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6817 event pairs, 143 based on Foata normal form. 2/1243 useless extension candidates. Maximal degree in co-relation 7245. Up to 1124 conditions per place. [2024-06-04 17:06:39,422 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 241 selfloop transitions, 35 changer transitions 0/278 dead transitions. [2024-06-04 17:06:39,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 278 transitions, 3455 flow [2024-06-04 17:06:39,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:06:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:06:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-04 17:06:39,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-04 17:06:39,425 INFO L175 Difference]: Start difference. First operand has 302 places, 256 transitions, 2599 flow. Second operand 11 states and 117 transitions. [2024-06-04 17:06:39,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 278 transitions, 3455 flow [2024-06-04 17:06:39,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 278 transitions, 3363 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-04 17:06:39,702 INFO L231 Difference]: Finished difference. Result has 304 places, 258 transitions, 2663 flow [2024-06-04 17:06:39,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2507, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2663, PETRI_PLACES=304, PETRI_TRANSITIONS=258} [2024-06-04 17:06:39,702 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 274 predicate places. [2024-06-04 17:06:39,702 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 258 transitions, 2663 flow [2024-06-04 17:06:39,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:39,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:39,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:39,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-04 17:06:39,703 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:06:39,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:39,703 INFO L85 PathProgramCache]: Analyzing trace with hash -699913402, now seen corresponding path program 1 times [2024-06-04 17:06:39,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:39,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276047945] [2024-06-04 17:06:39,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:39,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:45,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:45,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276047945] [2024-06-04 17:06:45,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276047945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:45,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:45,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:06:45,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696168699] [2024-06-04 17:06:45,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:45,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:06:45,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:45,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:06:45,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:06:45,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:06:45,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 258 transitions, 2663 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:45,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:45,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:06:45,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:45,640 INFO L124 PetriNetUnfolderBase]: 690/1247 cut-off events. [2024-06-04 17:06:45,640 INFO L125 PetriNetUnfolderBase]: For 68096/68096 co-relation queries the response was YES. [2024-06-04 17:06:45,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7422 conditions, 1247 events. 690/1247 cut-off events. For 68096/68096 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 6853 event pairs, 146 based on Foata normal form. 1/1247 useless extension candidates. Maximal degree in co-relation 7285. Up to 1145 conditions per place. [2024-06-04 17:06:45,652 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 239 selfloop transitions, 38 changer transitions 0/279 dead transitions. [2024-06-04 17:06:45,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 279 transitions, 3329 flow [2024-06-04 17:06:45,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:06:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:06:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-04 17:06:45,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-04 17:06:45,654 INFO L175 Difference]: Start difference. First operand has 304 places, 258 transitions, 2663 flow. Second operand 11 states and 116 transitions. [2024-06-04 17:06:45,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 279 transitions, 3329 flow [2024-06-04 17:06:45,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 279 transitions, 3241 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-04 17:06:45,908 INFO L231 Difference]: Finished difference. Result has 308 places, 260 transitions, 2721 flow [2024-06-04 17:06:45,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2721, PETRI_PLACES=308, PETRI_TRANSITIONS=260} [2024-06-04 17:06:45,909 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 278 predicate places. [2024-06-04 17:06:45,909 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 260 transitions, 2721 flow [2024-06-04 17:06:45,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:45,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:45,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:45,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-04 17:06:45,909 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:06:45,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash -699919168, now seen corresponding path program 5 times [2024-06-04 17:06:45,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:45,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896661738] [2024-06-04 17:06:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:45,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:50,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:50,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896661738] [2024-06-04 17:06:50,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896661738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:50,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:50,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:06:50,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893328265] [2024-06-04 17:06:50,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:50,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:06:50,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:50,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:06:50,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:06:50,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:06:50,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 260 transitions, 2721 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:50,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:50,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:06:50,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:51,072 INFO L124 PetriNetUnfolderBase]: 687/1242 cut-off events. [2024-06-04 17:06:51,072 INFO L125 PetriNetUnfolderBase]: For 64362/64362 co-relation queries the response was YES. [2024-06-04 17:06:51,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7201 conditions, 1242 events. 687/1242 cut-off events. For 64362/64362 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 6840 event pairs, 146 based on Foata normal form. 2/1243 useless extension candidates. Maximal degree in co-relation 7062. Up to 1143 conditions per place. [2024-06-04 17:06:51,085 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 242 selfloop transitions, 35 changer transitions 0/279 dead transitions. [2024-06-04 17:06:51,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 279 transitions, 3327 flow [2024-06-04 17:06:51,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:06:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:06:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-04 17:06:51,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-04 17:06:51,086 INFO L175 Difference]: Start difference. First operand has 308 places, 260 transitions, 2721 flow. Second operand 11 states and 115 transitions. [2024-06-04 17:06:51,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 279 transitions, 3327 flow [2024-06-04 17:06:51,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 279 transitions, 3179 flow, removed 39 selfloop flow, removed 9 redundant places. [2024-06-04 17:06:51,327 INFO L231 Difference]: Finished difference. Result has 310 places, 260 transitions, 2648 flow [2024-06-04 17:06:51,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2573, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2648, PETRI_PLACES=310, PETRI_TRANSITIONS=260} [2024-06-04 17:06:51,328 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 280 predicate places. [2024-06-04 17:06:51,328 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 260 transitions, 2648 flow [2024-06-04 17:06:51,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:51,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:51,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:51,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-04 17:06:51,328 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:06:51,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:51,329 INFO L85 PathProgramCache]: Analyzing trace with hash -866402868, now seen corresponding path program 1 times [2024-06-04 17:06:51,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:51,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252593369] [2024-06-04 17:06:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:51,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:06:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:06:56,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:06:56,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252593369] [2024-06-04 17:06:56,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252593369] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:06:56,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:06:56,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:06:56,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331333870] [2024-06-04 17:06:56,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:06:56,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:06:56,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:06:56,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:06:56,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:06:56,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:06:56,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 260 transitions, 2648 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:56,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:06:56,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:06:56,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:06:57,119 INFO L124 PetriNetUnfolderBase]: 703/1279 cut-off events. [2024-06-04 17:06:57,119 INFO L125 PetriNetUnfolderBase]: For 93881/93881 co-relation queries the response was YES. [2024-06-04 17:06:57,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7261 conditions, 1279 events. 703/1279 cut-off events. For 93881/93881 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 7056 event pairs, 127 based on Foata normal form. 10/1288 useless extension candidates. Maximal degree in co-relation 7121. Up to 1146 conditions per place. [2024-06-04 17:06:57,132 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 242 selfloop transitions, 30 changer transitions 11/285 dead transitions. [2024-06-04 17:06:57,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 285 transitions, 3326 flow [2024-06-04 17:06:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:06:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:06:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2024-06-04 17:06:57,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:06:57,134 INFO L175 Difference]: Start difference. First operand has 310 places, 260 transitions, 2648 flow. Second operand 12 states and 126 transitions. [2024-06-04 17:06:57,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 285 transitions, 3326 flow [2024-06-04 17:06:57,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 285 transitions, 3253 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-04 17:06:57,392 INFO L231 Difference]: Finished difference. Result has 312 places, 257 transitions, 2594 flow [2024-06-04 17:06:57,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2575, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2594, PETRI_PLACES=312, PETRI_TRANSITIONS=257} [2024-06-04 17:06:57,393 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 282 predicate places. [2024-06-04 17:06:57,393 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 257 transitions, 2594 flow [2024-06-04 17:06:57,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:06:57,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:06:57,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:06:57,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-04 17:06:57,394 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:06:57,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:06:57,394 INFO L85 PathProgramCache]: Analyzing trace with hash 471636976, now seen corresponding path program 6 times [2024-06-04 17:06:57,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:06:57,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769595048] [2024-06-04 17:06:57,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:06:57,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:06:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:01,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:01,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769595048] [2024-06-04 17:07:01,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769595048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:01,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:01,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:07:01,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584304970] [2024-06-04 17:07:01,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:01,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:07:01,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:01,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:07:01,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:07:02,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:07:02,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 257 transitions, 2594 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:02,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:02,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:07:02,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:02,545 INFO L124 PetriNetUnfolderBase]: 681/1236 cut-off events. [2024-06-04 17:07:02,545 INFO L125 PetriNetUnfolderBase]: For 66120/66120 co-relation queries the response was YES. [2024-06-04 17:07:02,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7095 conditions, 1236 events. 681/1236 cut-off events. For 66120/66120 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6808 event pairs, 119 based on Foata normal form. 2/1237 useless extension candidates. Maximal degree in co-relation 6954. Up to 1142 conditions per place. [2024-06-04 17:07:02,558 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 250 selfloop transitions, 25 changer transitions 0/277 dead transitions. [2024-06-04 17:07:02,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 277 transitions, 3234 flow [2024-06-04 17:07:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:07:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:07:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-04 17:07:02,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3343108504398827 [2024-06-04 17:07:02,559 INFO L175 Difference]: Start difference. First operand has 312 places, 257 transitions, 2594 flow. Second operand 11 states and 114 transitions. [2024-06-04 17:07:02,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 277 transitions, 3234 flow [2024-06-04 17:07:02,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 277 transitions, 3168 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-04 17:07:02,804 INFO L231 Difference]: Finished difference. Result has 309 places, 258 transitions, 2626 flow [2024-06-04 17:07:02,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2528, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2626, PETRI_PLACES=309, PETRI_TRANSITIONS=258} [2024-06-04 17:07:02,804 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 279 predicate places. [2024-06-04 17:07:02,804 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 258 transitions, 2626 flow [2024-06-04 17:07:02,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:02,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:02,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:02,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-04 17:07:02,805 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:07:02,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:02,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1182371346, now seen corresponding path program 2 times [2024-06-04 17:07:02,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:02,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875765058] [2024-06-04 17:07:02,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:02,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:07,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:07,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875765058] [2024-06-04 17:07:07,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875765058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:07,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:07,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:07:07,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130744433] [2024-06-04 17:07:07,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:07,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:07:07,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:07,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:07:07,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:07:08,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:07:08,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 258 transitions, 2626 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:08,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:08,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:07:08,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:08,541 INFO L124 PetriNetUnfolderBase]: 679/1233 cut-off events. [2024-06-04 17:07:08,542 INFO L125 PetriNetUnfolderBase]: For 58290/58290 co-relation queries the response was YES. [2024-06-04 17:07:08,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6965 conditions, 1233 events. 679/1233 cut-off events. For 58290/58290 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6799 event pairs, 119 based on Foata normal form. 1/1233 useless extension candidates. Maximal degree in co-relation 6825. Up to 1131 conditions per place. [2024-06-04 17:07:08,556 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 237 selfloop transitions, 37 changer transitions 0/276 dead transitions. [2024-06-04 17:07:08,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 276 transitions, 3226 flow [2024-06-04 17:07:08,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:07:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:07:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-04 17:07:08,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-04 17:07:08,557 INFO L175 Difference]: Start difference. First operand has 309 places, 258 transitions, 2626 flow. Second operand 11 states and 117 transitions. [2024-06-04 17:07:08,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 276 transitions, 3226 flow [2024-06-04 17:07:08,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 276 transitions, 3126 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-06-04 17:07:08,806 INFO L231 Difference]: Finished difference. Result has 311 places, 258 transitions, 2608 flow [2024-06-04 17:07:08,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2526, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2608, PETRI_PLACES=311, PETRI_TRANSITIONS=258} [2024-06-04 17:07:08,807 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 281 predicate places. [2024-06-04 17:07:08,807 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 258 transitions, 2608 flow [2024-06-04 17:07:08,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:08,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:08,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:08,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-04 17:07:08,807 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:07:08,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:08,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1182371532, now seen corresponding path program 7 times [2024-06-04 17:07:08,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:08,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960083278] [2024-06-04 17:07:08,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:08,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:13,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:13,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960083278] [2024-06-04 17:07:13,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960083278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:13,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:13,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:07:13,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533920180] [2024-06-04 17:07:13,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:13,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:07:13,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:13,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:07:13,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:07:13,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:07:13,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 258 transitions, 2608 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:13,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:13,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:07:13,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:13,961 INFO L124 PetriNetUnfolderBase]: 683/1241 cut-off events. [2024-06-04 17:07:13,961 INFO L125 PetriNetUnfolderBase]: For 63719/63719 co-relation queries the response was YES. [2024-06-04 17:07:13,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7025 conditions, 1241 events. 683/1241 cut-off events. For 63719/63719 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 6838 event pairs, 121 based on Foata normal form. 2/1242 useless extension candidates. Maximal degree in co-relation 6884. Up to 1142 conditions per place. [2024-06-04 17:07:13,974 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 241 selfloop transitions, 34 changer transitions 0/277 dead transitions. [2024-06-04 17:07:13,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 277 transitions, 3252 flow [2024-06-04 17:07:13,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:07:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:07:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-04 17:07:13,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-04 17:07:13,975 INFO L175 Difference]: Start difference. First operand has 311 places, 258 transitions, 2608 flow. Second operand 11 states and 116 transitions. [2024-06-04 17:07:13,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 277 transitions, 3252 flow [2024-06-04 17:07:14,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 277 transitions, 3117 flow, removed 15 selfloop flow, removed 10 redundant places. [2024-06-04 17:07:14,230 INFO L231 Difference]: Finished difference. Result has 312 places, 259 transitions, 2592 flow [2024-06-04 17:07:14,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2473, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2592, PETRI_PLACES=312, PETRI_TRANSITIONS=259} [2024-06-04 17:07:14,231 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 282 predicate places. [2024-06-04 17:07:14,231 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 259 transitions, 2592 flow [2024-06-04 17:07:14,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:14,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:14,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:14,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-04 17:07:14,231 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:07:14,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:14,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1182491502, now seen corresponding path program 8 times [2024-06-04 17:07:14,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:14,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625649318] [2024-06-04 17:07:14,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:14,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:18,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:18,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625649318] [2024-06-04 17:07:18,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625649318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:18,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:18,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:07:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635080189] [2024-06-04 17:07:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:18,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:07:18,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:18,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:07:18,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:07:19,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:07:19,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 259 transitions, 2592 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:19,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:19,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:07:19,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:19,428 INFO L124 PetriNetUnfolderBase]: 687/1249 cut-off events. [2024-06-04 17:07:19,428 INFO L125 PetriNetUnfolderBase]: For 64686/64686 co-relation queries the response was YES. [2024-06-04 17:07:19,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7090 conditions, 1249 events. 687/1249 cut-off events. For 64686/64686 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 6912 event pairs, 123 based on Foata normal form. 2/1250 useless extension candidates. Maximal degree in co-relation 6948. Up to 1156 conditions per place. [2024-06-04 17:07:19,441 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 248 selfloop transitions, 28 changer transitions 0/278 dead transitions. [2024-06-04 17:07:19,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 278 transitions, 3236 flow [2024-06-04 17:07:19,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:07:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:07:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-04 17:07:19,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3343108504398827 [2024-06-04 17:07:19,442 INFO L175 Difference]: Start difference. First operand has 312 places, 259 transitions, 2592 flow. Second operand 11 states and 114 transitions. [2024-06-04 17:07:19,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 278 transitions, 3236 flow [2024-06-04 17:07:19,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 278 transitions, 3117 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-04 17:07:19,689 INFO L231 Difference]: Finished difference. Result has 314 places, 260 transitions, 2581 flow [2024-06-04 17:07:19,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2477, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2581, PETRI_PLACES=314, PETRI_TRANSITIONS=260} [2024-06-04 17:07:19,690 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 284 predicate places. [2024-06-04 17:07:19,690 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 260 transitions, 2581 flow [2024-06-04 17:07:19,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:19,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:19,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:19,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-04 17:07:19,691 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:07:19,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:19,691 INFO L85 PathProgramCache]: Analyzing trace with hash -545909328, now seen corresponding path program 9 times [2024-06-04 17:07:19,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:19,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202815210] [2024-06-04 17:07:19,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:19,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:24,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-04 17:07:24,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:24,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202815210] [2024-06-04 17:07:24,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202815210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:24,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:24,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:07:24,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794558625] [2024-06-04 17:07:24,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:24,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:07:24,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:24,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:07:24,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:07:24,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:07:24,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 260 transitions, 2581 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:24,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:24,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:07:24,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:25,020 INFO L124 PetriNetUnfolderBase]: 691/1257 cut-off events. [2024-06-04 17:07:25,020 INFO L125 PetriNetUnfolderBase]: For 63369/63369 co-relation queries the response was YES. [2024-06-04 17:07:25,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7076 conditions, 1257 events. 691/1257 cut-off events. For 63369/63369 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 6978 event pairs, 121 based on Foata normal form. 2/1258 useless extension candidates. Maximal degree in co-relation 6933. Up to 1142 conditions per place. [2024-06-04 17:07:25,033 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 243 selfloop transitions, 34 changer transitions 0/279 dead transitions. [2024-06-04 17:07:25,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 279 transitions, 3227 flow [2024-06-04 17:07:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:07:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:07:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-04 17:07:25,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-04 17:07:25,034 INFO L175 Difference]: Start difference. First operand has 314 places, 260 transitions, 2581 flow. Second operand 11 states and 117 transitions. [2024-06-04 17:07:25,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 279 transitions, 3227 flow [2024-06-04 17:07:25,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 279 transitions, 3133 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-04 17:07:25,281 INFO L231 Difference]: Finished difference. Result has 316 places, 261 transitions, 2605 flow [2024-06-04 17:07:25,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2605, PETRI_PLACES=316, PETRI_TRANSITIONS=261} [2024-06-04 17:07:25,282 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 286 predicate places. [2024-06-04 17:07:25,282 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 261 transitions, 2605 flow [2024-06-04 17:07:25,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:25,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:25,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:25,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-04 17:07:25,283 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:07:25,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:25,283 INFO L85 PathProgramCache]: Analyzing trace with hash 874242212, now seen corresponding path program 2 times [2024-06-04 17:07:25,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:25,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132826070] [2024-06-04 17:07:25,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:25,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:29,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132826070] [2024-06-04 17:07:29,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132826070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:29,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:07:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54905758] [2024-06-04 17:07:29,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:29,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:07:29,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:29,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:07:29,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:07:30,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:07:30,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 261 transitions, 2605 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:30,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:30,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:07:30,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:30,680 INFO L124 PetriNetUnfolderBase]: 707/1294 cut-off events. [2024-06-04 17:07:30,680 INFO L125 PetriNetUnfolderBase]: For 95253/95253 co-relation queries the response was YES. [2024-06-04 17:07:30,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7203 conditions, 1294 events. 707/1294 cut-off events. For 95253/95253 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7214 event pairs, 129 based on Foata normal form. 10/1303 useless extension candidates. Maximal degree in co-relation 7059. Up to 1161 conditions per place. [2024-06-04 17:07:30,694 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 245 selfloop transitions, 27 changer transitions 11/285 dead transitions. [2024-06-04 17:07:30,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 285 transitions, 3281 flow [2024-06-04 17:07:30,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:07:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:07:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2024-06-04 17:07:30,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34139784946236557 [2024-06-04 17:07:30,695 INFO L175 Difference]: Start difference. First operand has 316 places, 261 transitions, 2605 flow. Second operand 12 states and 127 transitions. [2024-06-04 17:07:30,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 285 transitions, 3281 flow [2024-06-04 17:07:30,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 285 transitions, 3173 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-04 17:07:30,963 INFO L231 Difference]: Finished difference. Result has 319 places, 258 transitions, 2513 flow [2024-06-04 17:07:30,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2497, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2513, PETRI_PLACES=319, PETRI_TRANSITIONS=258} [2024-06-04 17:07:30,964 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 289 predicate places. [2024-06-04 17:07:30,964 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 258 transitions, 2513 flow [2024-06-04 17:07:30,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:30,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:30,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:30,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-04 17:07:30,965 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:07:30,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash 232532138, now seen corresponding path program 10 times [2024-06-04 17:07:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:30,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385339566] [2024-06-04 17:07:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:35,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:35,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385339566] [2024-06-04 17:07:35,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385339566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:35,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:35,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:07:35,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214817398] [2024-06-04 17:07:35,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:35,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:07:35,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:35,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:07:35,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:07:35,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:07:35,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 258 transitions, 2513 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:35,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:35,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:07:35,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:36,354 INFO L124 PetriNetUnfolderBase]: 685/1251 cut-off events. [2024-06-04 17:07:36,354 INFO L125 PetriNetUnfolderBase]: For 65524/65524 co-relation queries the response was YES. [2024-06-04 17:07:36,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6963 conditions, 1251 events. 685/1251 cut-off events. For 65524/65524 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 6950 event pairs, 119 based on Foata normal form. 2/1252 useless extension candidates. Maximal degree in co-relation 6818. Up to 1142 conditions per place. [2024-06-04 17:07:36,369 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 238 selfloop transitions, 37 changer transitions 0/277 dead transitions. [2024-06-04 17:07:36,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 277 transitions, 3159 flow [2024-06-04 17:07:36,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:07:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:07:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-04 17:07:36,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34017595307917886 [2024-06-04 17:07:36,371 INFO L175 Difference]: Start difference. First operand has 319 places, 258 transitions, 2513 flow. Second operand 11 states and 116 transitions. [2024-06-04 17:07:36,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 277 transitions, 3159 flow [2024-06-04 17:07:36,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 277 transitions, 3095 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-04 17:07:36,612 INFO L231 Difference]: Finished difference. Result has 316 places, 259 transitions, 2575 flow [2024-06-04 17:07:36,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2449, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2575, PETRI_PLACES=316, PETRI_TRANSITIONS=259} [2024-06-04 17:07:36,612 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 286 predicate places. [2024-06-04 17:07:36,612 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 259 transitions, 2575 flow [2024-06-04 17:07:36,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:36,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:36,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:36,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-04 17:07:36,613 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:07:36,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:36,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1267201456, now seen corresponding path program 11 times [2024-06-04 17:07:36,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:36,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239690895] [2024-06-04 17:07:36,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:36,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:41,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239690895] [2024-06-04 17:07:41,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239690895] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:41,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:41,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:07:41,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690388846] [2024-06-04 17:07:41,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:41,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:07:41,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:41,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:07:41,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:07:41,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:07:41,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 259 transitions, 2575 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:41,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:41,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:07:41,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:42,356 INFO L124 PetriNetUnfolderBase]: 689/1260 cut-off events. [2024-06-04 17:07:42,356 INFO L125 PetriNetUnfolderBase]: For 66650/66650 co-relation queries the response was YES. [2024-06-04 17:07:42,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7097 conditions, 1260 events. 689/1260 cut-off events. For 66650/66650 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 7021 event pairs, 119 based on Foata normal form. 2/1261 useless extension candidates. Maximal degree in co-relation 6953. Up to 1136 conditions per place. [2024-06-04 17:07:42,369 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 238 selfloop transitions, 38 changer transitions 0/278 dead transitions. [2024-06-04 17:07:42,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 278 transitions, 3223 flow [2024-06-04 17:07:42,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:07:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:07:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-04 17:07:42,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-04 17:07:42,370 INFO L175 Difference]: Start difference. First operand has 316 places, 259 transitions, 2575 flow. Second operand 11 states and 117 transitions. [2024-06-04 17:07:42,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 278 transitions, 3223 flow [2024-06-04 17:07:42,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 278 transitions, 3107 flow, removed 22 selfloop flow, removed 9 redundant places. [2024-06-04 17:07:42,620 INFO L231 Difference]: Finished difference. Result has 318 places, 260 transitions, 2589 flow [2024-06-04 17:07:42,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2459, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2589, PETRI_PLACES=318, PETRI_TRANSITIONS=260} [2024-06-04 17:07:42,620 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 288 predicate places. [2024-06-04 17:07:42,620 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 260 transitions, 2589 flow [2024-06-04 17:07:42,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:42,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:42,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:42,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-04 17:07:42,621 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:07:42,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1271854680, now seen corresponding path program 3 times [2024-06-04 17:07:42,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:42,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068944457] [2024-06-04 17:07:42,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:42,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:47,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:47,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068944457] [2024-06-04 17:07:47,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068944457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:47,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:47,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:07:47,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960962901] [2024-06-04 17:07:47,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:47,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:07:47,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:47,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:07:47,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:07:47,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:07:47,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 260 transitions, 2589 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:47,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:47,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:07:47,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:48,508 INFO L124 PetriNetUnfolderBase]: 705/1296 cut-off events. [2024-06-04 17:07:48,509 INFO L125 PetriNetUnfolderBase]: For 99936/99936 co-relation queries the response was YES. [2024-06-04 17:07:48,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7203 conditions, 1296 events. 705/1296 cut-off events. For 99936/99936 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7248 event pairs, 123 based on Foata normal form. 10/1305 useless extension candidates. Maximal degree in co-relation 7058. Up to 1142 conditions per place. [2024-06-04 17:07:48,522 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 236 selfloop transitions, 35 changer transitions 11/284 dead transitions. [2024-06-04 17:07:48,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 284 transitions, 3263 flow [2024-06-04 17:07:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:07:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:07:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-04 17:07:48,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-04 17:07:48,523 INFO L175 Difference]: Start difference. First operand has 318 places, 260 transitions, 2589 flow. Second operand 12 states and 128 transitions. [2024-06-04 17:07:48,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 284 transitions, 3263 flow [2024-06-04 17:07:48,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 284 transitions, 3143 flow, removed 23 selfloop flow, removed 9 redundant places. [2024-06-04 17:07:48,792 INFO L231 Difference]: Finished difference. Result has 321 places, 257 transitions, 2517 flow [2024-06-04 17:07:48,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2469, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2517, PETRI_PLACES=321, PETRI_TRANSITIONS=257} [2024-06-04 17:07:48,792 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 291 predicate places. [2024-06-04 17:07:48,792 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 257 transitions, 2517 flow [2024-06-04 17:07:48,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:48,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:48,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:48,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-04 17:07:48,793 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:07:48,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:48,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1444337626, now seen corresponding path program 12 times [2024-06-04 17:07:48,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:48,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596871433] [2024-06-04 17:07:48,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:48,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:52,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:52,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596871433] [2024-06-04 17:07:52,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596871433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:52,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:52,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:07:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441377065] [2024-06-04 17:07:52,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:52,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:07:52,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:52,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:07:52,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:07:53,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:07:53,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 257 transitions, 2517 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:53,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:53,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:07:53,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:53,441 INFO L124 PetriNetUnfolderBase]: 699/1289 cut-off events. [2024-06-04 17:07:53,441 INFO L125 PetriNetUnfolderBase]: For 110600/110600 co-relation queries the response was YES. [2024-06-04 17:07:53,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7162 conditions, 1289 events. 699/1289 cut-off events. For 110600/110600 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 7257 event pairs, 165 based on Foata normal form. 12/1300 useless extension candidates. Maximal degree in co-relation 7016. Up to 1162 conditions per place. [2024-06-04 17:07:53,463 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 244 selfloop transitions, 26 changer transitions 7/279 dead transitions. [2024-06-04 17:07:53,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 279 transitions, 3221 flow [2024-06-04 17:07:53,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:07:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:07:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-04 17:07:53,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-04 17:07:53,465 INFO L175 Difference]: Start difference. First operand has 321 places, 257 transitions, 2517 flow. Second operand 11 states and 118 transitions. [2024-06-04 17:07:53,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 279 transitions, 3221 flow [2024-06-04 17:07:53,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 279 transitions, 3147 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 17:07:53,733 INFO L231 Difference]: Finished difference. Result has 318 places, 255 transitions, 2515 flow [2024-06-04 17:07:53,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2515, PETRI_PLACES=318, PETRI_TRANSITIONS=255} [2024-06-04 17:07:53,734 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 288 predicate places. [2024-06-04 17:07:53,734 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 255 transitions, 2515 flow [2024-06-04 17:07:53,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:53,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:53,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:53,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-04 17:07:53,734 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:07:53,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1444344570, now seen corresponding path program 4 times [2024-06-04 17:07:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:53,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137850887] [2024-06-04 17:07:53,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:53,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:07:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:07:58,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:07:58,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137850887] [2024-06-04 17:07:58,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137850887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:07:58,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:07:58,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:07:58,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533781959] [2024-06-04 17:07:58,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:07:58,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:07:58,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:07:58,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:07:58,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:07:58,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:07:58,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 255 transitions, 2515 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:58,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:07:58,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:07:58,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:07:59,051 INFO L124 PetriNetUnfolderBase]: 691/1277 cut-off events. [2024-06-04 17:07:59,051 INFO L125 PetriNetUnfolderBase]: For 99819/99819 co-relation queries the response was YES. [2024-06-04 17:07:59,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7063 conditions, 1277 events. 691/1277 cut-off events. For 99819/99819 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 7165 event pairs, 167 based on Foata normal form. 10/1286 useless extension candidates. Maximal degree in co-relation 6918. Up to 1152 conditions per place. [2024-06-04 17:07:59,065 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 240 selfloop transitions, 20 changer transitions 16/278 dead transitions. [2024-06-04 17:07:59,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 278 transitions, 3173 flow [2024-06-04 17:07:59,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:07:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:07:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2024-06-04 17:07:59,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:07:59,066 INFO L175 Difference]: Start difference. First operand has 318 places, 255 transitions, 2515 flow. Second operand 12 states and 126 transitions. [2024-06-04 17:07:59,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 278 transitions, 3173 flow [2024-06-04 17:07:59,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 278 transitions, 3075 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-06-04 17:07:59,305 INFO L231 Difference]: Finished difference. Result has 321 places, 249 transitions, 2378 flow [2024-06-04 17:07:59,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2417, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2378, PETRI_PLACES=321, PETRI_TRANSITIONS=249} [2024-06-04 17:07:59,306 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 291 predicate places. [2024-06-04 17:07:59,306 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 249 transitions, 2378 flow [2024-06-04 17:07:59,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:07:59,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:07:59,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:07:59,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-04 17:07:59,306 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:07:59,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:07:59,306 INFO L85 PathProgramCache]: Analyzing trace with hash 232412168, now seen corresponding path program 13 times [2024-06-04 17:07:59,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:07:59,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421535073] [2024-06-04 17:07:59,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:07:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:07:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:04,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:04,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421535073] [2024-06-04 17:08:04,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421535073] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:04,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:04,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:08:04,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089146939] [2024-06-04 17:08:04,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:04,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:08:04,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:04,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:08:04,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:08:04,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-04 17:08:04,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 249 transitions, 2378 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:04,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:04,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-04 17:08:04,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:05,182 INFO L124 PetriNetUnfolderBase]: 661/1220 cut-off events. [2024-06-04 17:08:05,182 INFO L125 PetriNetUnfolderBase]: For 68546/68546 co-relation queries the response was YES. [2024-06-04 17:08:05,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6734 conditions, 1220 events. 661/1220 cut-off events. For 68546/68546 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6796 event pairs, 101 based on Foata normal form. 2/1221 useless extension candidates. Maximal degree in co-relation 6588. Up to 1074 conditions per place. [2024-06-04 17:08:05,195 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 222 selfloop transitions, 42 changer transitions 0/266 dead transitions. [2024-06-04 17:08:05,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 266 transitions, 2998 flow [2024-06-04 17:08:05,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:08:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:08:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-04 17:08:05,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36451612903225805 [2024-06-04 17:08:05,196 INFO L175 Difference]: Start difference. First operand has 321 places, 249 transitions, 2378 flow. Second operand 10 states and 113 transitions. [2024-06-04 17:08:05,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 266 transitions, 2998 flow [2024-06-04 17:08:05,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 266 transitions, 2941 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-04 17:08:05,471 INFO L231 Difference]: Finished difference. Result has 314 places, 250 transitions, 2464 flow [2024-06-04 17:08:05,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2323, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2464, PETRI_PLACES=314, PETRI_TRANSITIONS=250} [2024-06-04 17:08:05,471 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 284 predicate places. [2024-06-04 17:08:05,471 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 250 transitions, 2464 flow [2024-06-04 17:08:05,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:05,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:05,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:05,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-04 17:08:05,472 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:08:05,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:05,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1039701422, now seen corresponding path program 14 times [2024-06-04 17:08:05,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:05,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522138600] [2024-06-04 17:08:05,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:05,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:10,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:10,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522138600] [2024-06-04 17:08:10,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522138600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:10,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:10,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:08:10,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971778428] [2024-06-04 17:08:10,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:10,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:08:10,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:10,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:08:10,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:08:10,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:08:10,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 250 transitions, 2464 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:10,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:10,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:08:10,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:10,708 INFO L124 PetriNetUnfolderBase]: 665/1227 cut-off events. [2024-06-04 17:08:10,708 INFO L125 PetriNetUnfolderBase]: For 68364/68364 co-relation queries the response was YES. [2024-06-04 17:08:10,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6889 conditions, 1227 events. 665/1227 cut-off events. For 68364/68364 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6865 event pairs, 167 based on Foata normal form. 2/1228 useless extension candidates. Maximal degree in co-relation 6744. Up to 1162 conditions per place. [2024-06-04 17:08:10,721 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 244 selfloop transitions, 22 changer transitions 0/268 dead transitions. [2024-06-04 17:08:10,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 268 transitions, 3094 flow [2024-06-04 17:08:10,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:08:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:08:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-04 17:08:10,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3313782991202346 [2024-06-04 17:08:10,722 INFO L175 Difference]: Start difference. First operand has 314 places, 250 transitions, 2464 flow. Second operand 11 states and 113 transitions. [2024-06-04 17:08:10,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 268 transitions, 3094 flow [2024-06-04 17:08:10,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 268 transitions, 2965 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-04 17:08:10,978 INFO L231 Difference]: Finished difference. Result has 317 places, 251 transitions, 2437 flow [2024-06-04 17:08:10,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2335, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2437, PETRI_PLACES=317, PETRI_TRANSITIONS=251} [2024-06-04 17:08:10,979 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 287 predicate places. [2024-06-04 17:08:10,979 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 251 transitions, 2437 flow [2024-06-04 17:08:10,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:10,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:10,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:10,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-04 17:08:10,979 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:08:10,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:10,979 INFO L85 PathProgramCache]: Analyzing trace with hash 808116726, now seen corresponding path program 5 times [2024-06-04 17:08:10,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:10,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852596906] [2024-06-04 17:08:10,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:10,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:15,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:15,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852596906] [2024-06-04 17:08:15,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852596906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:15,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:15,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:08:15,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998152380] [2024-06-04 17:08:15,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:15,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:08:15,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:15,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:08:15,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:08:15,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:08:15,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 251 transitions, 2437 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:15,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:15,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:08:15,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:15,723 INFO L124 PetriNetUnfolderBase]: 706/1314 cut-off events. [2024-06-04 17:08:15,724 INFO L125 PetriNetUnfolderBase]: For 135279/135279 co-relation queries the response was YES. [2024-06-04 17:08:15,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8077 conditions, 1314 events. 706/1314 cut-off events. For 135279/135279 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7399 event pairs, 178 based on Foata normal form. 8/1321 useless extension candidates. Maximal degree in co-relation 7931. Up to 1142 conditions per place. [2024-06-04 17:08:15,738 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 247 selfloop transitions, 18 changer transitions 9/276 dead transitions. [2024-06-04 17:08:15,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 276 transitions, 3309 flow [2024-06-04 17:08:15,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:08:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:08:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-04 17:08:15,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489736070381232 [2024-06-04 17:08:15,739 INFO L175 Difference]: Start difference. First operand has 317 places, 251 transitions, 2437 flow. Second operand 11 states and 119 transitions. [2024-06-04 17:08:15,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 276 transitions, 3309 flow [2024-06-04 17:08:16,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 276 transitions, 3217 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-04 17:08:16,135 INFO L231 Difference]: Finished difference. Result has 319 places, 247 transitions, 2350 flow [2024-06-04 17:08:16,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2345, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2350, PETRI_PLACES=319, PETRI_TRANSITIONS=247} [2024-06-04 17:08:16,135 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 289 predicate places. [2024-06-04 17:08:16,135 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 247 transitions, 2350 flow [2024-06-04 17:08:16,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:16,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:16,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:16,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-04 17:08:16,136 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:08:16,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:16,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1039881346, now seen corresponding path program 6 times [2024-06-04 17:08:16,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:16,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015250894] [2024-06-04 17:08:16,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:16,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:21,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:21,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015250894] [2024-06-04 17:08:21,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015250894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:21,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:21,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:08:21,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051661407] [2024-06-04 17:08:21,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:21,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:08:21,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:21,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:08:21,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:08:21,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:08:21,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 247 transitions, 2350 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:21,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:21,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:08:21,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:22,092 INFO L124 PetriNetUnfolderBase]: 688/1280 cut-off events. [2024-06-04 17:08:22,093 INFO L125 PetriNetUnfolderBase]: For 128952/128952 co-relation queries the response was YES. [2024-06-04 17:08:22,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7443 conditions, 1280 events. 688/1280 cut-off events. For 128952/128952 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7156 event pairs, 180 based on Foata normal form. 10/1289 useless extension candidates. Maximal degree in co-relation 7296. Up to 1179 conditions per place. [2024-06-04 17:08:22,108 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 240 selfloop transitions, 18 changer transitions 9/269 dead transitions. [2024-06-04 17:08:22,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 269 transitions, 2986 flow [2024-06-04 17:08:22,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:08:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:08:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 121 transitions. [2024-06-04 17:08:22,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32526881720430106 [2024-06-04 17:08:22,109 INFO L175 Difference]: Start difference. First operand has 319 places, 247 transitions, 2350 flow. Second operand 12 states and 121 transitions. [2024-06-04 17:08:22,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 269 transitions, 2986 flow [2024-06-04 17:08:22,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 269 transitions, 2945 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 17:08:22,491 INFO L231 Difference]: Finished difference. Result has 316 places, 244 transitions, 2310 flow [2024-06-04 17:08:22,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2309, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2310, PETRI_PLACES=316, PETRI_TRANSITIONS=244} [2024-06-04 17:08:22,491 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 286 predicate places. [2024-06-04 17:08:22,491 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 244 transitions, 2310 flow [2024-06-04 17:08:22,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:22,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:22,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:22,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-04 17:08:22,492 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:08:22,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:22,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1039696772, now seen corresponding path program 15 times [2024-06-04 17:08:22,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:22,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59269154] [2024-06-04 17:08:22,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:22,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:26,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:26,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59269154] [2024-06-04 17:08:26,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59269154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:26,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:26,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:08:26,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599958416] [2024-06-04 17:08:26,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:26,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:08:26,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:26,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:08:26,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:08:27,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:08:27,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 244 transitions, 2310 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:27,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:27,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:08:27,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:27,568 INFO L124 PetriNetUnfolderBase]: 666/1238 cut-off events. [2024-06-04 17:08:27,568 INFO L125 PetriNetUnfolderBase]: For 91944/91944 co-relation queries the response was YES. [2024-06-04 17:08:27,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7253 conditions, 1238 events. 666/1238 cut-off events. For 91944/91944 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6908 event pairs, 178 based on Foata normal form. 2/1239 useless extension candidates. Maximal degree in co-relation 7108. Up to 1173 conditions per place. [2024-06-04 17:08:27,582 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 240 selfloop transitions, 19 changer transitions 0/261 dead transitions. [2024-06-04 17:08:27,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 261 transitions, 2920 flow [2024-06-04 17:08:27,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:08:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:08:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2024-06-04 17:08:27,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31671554252199413 [2024-06-04 17:08:27,584 INFO L175 Difference]: Start difference. First operand has 316 places, 244 transitions, 2310 flow. Second operand 11 states and 108 transitions. [2024-06-04 17:08:27,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 261 transitions, 2920 flow [2024-06-04 17:08:27,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 261 transitions, 2869 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-04 17:08:27,918 INFO L231 Difference]: Finished difference. Result has 313 places, 245 transitions, 2355 flow [2024-06-04 17:08:27,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2259, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2355, PETRI_PLACES=313, PETRI_TRANSITIONS=245} [2024-06-04 17:08:27,919 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 283 predicate places. [2024-06-04 17:08:27,919 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 245 transitions, 2355 flow [2024-06-04 17:08:27,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:27,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:27,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:27,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-04 17:08:27,920 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:08:27,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:27,920 INFO L85 PathProgramCache]: Analyzing trace with hash 789487974, now seen corresponding path program 16 times [2024-06-04 17:08:27,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:27,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107248089] [2024-06-04 17:08:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:27,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:32,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:32,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107248089] [2024-06-04 17:08:32,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107248089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:32,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:32,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:08:32,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810891027] [2024-06-04 17:08:32,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:32,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:08:32,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:32,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:08:32,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:08:32,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:08:32,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 245 transitions, 2355 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:32,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:32,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:08:32,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:32,952 INFO L124 PetriNetUnfolderBase]: 670/1246 cut-off events. [2024-06-04 17:08:32,953 INFO L125 PetriNetUnfolderBase]: For 93327/93327 co-relation queries the response was YES. [2024-06-04 17:08:32,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7373 conditions, 1246 events. 670/1246 cut-off events. For 93327/93327 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6934 event pairs, 131 based on Foata normal form. 2/1247 useless extension candidates. Maximal degree in co-relation 7228. Up to 1045 conditions per place. [2024-06-04 17:08:32,965 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 225 selfloop transitions, 36 changer transitions 0/263 dead transitions. [2024-06-04 17:08:32,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 263 transitions, 2971 flow [2024-06-04 17:08:32,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:08:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:08:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2024-06-04 17:08:32,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3258064516129032 [2024-06-04 17:08:32,967 INFO L175 Difference]: Start difference. First operand has 313 places, 245 transitions, 2355 flow. Second operand 10 states and 101 transitions. [2024-06-04 17:08:32,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 263 transitions, 2971 flow [2024-06-04 17:08:33,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 263 transitions, 2885 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-04 17:08:33,327 INFO L231 Difference]: Finished difference. Result has 314 places, 246 transitions, 2407 flow [2024-06-04 17:08:33,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2269, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2407, PETRI_PLACES=314, PETRI_TRANSITIONS=246} [2024-06-04 17:08:33,327 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 284 predicate places. [2024-06-04 17:08:33,328 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 246 transitions, 2407 flow [2024-06-04 17:08:33,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:33,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:33,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:33,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-04 17:08:33,328 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:08:33,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:33,328 INFO L85 PathProgramCache]: Analyzing trace with hash -989907566, now seen corresponding path program 17 times [2024-06-04 17:08:33,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:33,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708060735] [2024-06-04 17:08:33,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:38,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:38,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708060735] [2024-06-04 17:08:38,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708060735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:38,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:38,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:08:38,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584459144] [2024-06-04 17:08:38,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:38,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:08:38,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:38,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:08:38,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:08:38,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:08:38,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 246 transitions, 2407 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:38,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:38,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:08:38,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:39,388 INFO L124 PetriNetUnfolderBase]: 681/1267 cut-off events. [2024-06-04 17:08:39,388 INFO L125 PetriNetUnfolderBase]: For 105173/105173 co-relation queries the response was YES. [2024-06-04 17:08:39,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7881 conditions, 1267 events. 681/1267 cut-off events. For 105173/105173 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 7064 event pairs, 147 based on Foata normal form. 2/1268 useless extension candidates. Maximal degree in co-relation 7735. Up to 1039 conditions per place. [2024-06-04 17:08:39,401 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 207 selfloop transitions, 57 changer transitions 0/266 dead transitions. [2024-06-04 17:08:39,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 266 transitions, 3279 flow [2024-06-04 17:08:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:08:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:08:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-04 17:08:39,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34516129032258064 [2024-06-04 17:08:39,403 INFO L175 Difference]: Start difference. First operand has 314 places, 246 transitions, 2407 flow. Second operand 10 states and 107 transitions. [2024-06-04 17:08:39,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 266 transitions, 3279 flow [2024-06-04 17:08:39,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 266 transitions, 3139 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-04 17:08:39,770 INFO L231 Difference]: Finished difference. Result has 316 places, 248 transitions, 2509 flow [2024-06-04 17:08:39,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2285, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2509, PETRI_PLACES=316, PETRI_TRANSITIONS=248} [2024-06-04 17:08:39,771 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 286 predicate places. [2024-06-04 17:08:39,771 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 248 transitions, 2509 flow [2024-06-04 17:08:39,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:39,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:39,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:39,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-04 17:08:39,771 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:08:39,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash 712979994, now seen corresponding path program 18 times [2024-06-04 17:08:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:39,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358149247] [2024-06-04 17:08:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:39,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:45,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:45,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:45,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358149247] [2024-06-04 17:08:45,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358149247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:45,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:45,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:08:45,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394308150] [2024-06-04 17:08:45,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:45,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:08:45,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:45,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:08:45,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:08:45,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:08:45,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 248 transitions, 2509 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:45,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:45,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:08:45,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:46,040 INFO L124 PetriNetUnfolderBase]: 678/1262 cut-off events. [2024-06-04 17:08:46,040 INFO L125 PetriNetUnfolderBase]: For 91113/91113 co-relation queries the response was YES. [2024-06-04 17:08:46,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7530 conditions, 1262 events. 678/1262 cut-off events. For 91113/91113 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 7048 event pairs, 155 based on Foata normal form. 2/1263 useless extension candidates. Maximal degree in co-relation 7383. Up to 1085 conditions per place. [2024-06-04 17:08:46,050 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 206 selfloop transitions, 57 changer transitions 0/265 dead transitions. [2024-06-04 17:08:46,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 265 transitions, 3081 flow [2024-06-04 17:08:46,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:08:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:08:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-04 17:08:46,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:08:46,051 INFO L175 Difference]: Start difference. First operand has 316 places, 248 transitions, 2509 flow. Second operand 10 states and 105 transitions. [2024-06-04 17:08:46,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 265 transitions, 3081 flow [2024-06-04 17:08:46,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 265 transitions, 2921 flow, removed 46 selfloop flow, removed 7 redundant places. [2024-06-04 17:08:46,391 INFO L231 Difference]: Finished difference. Result has 319 places, 248 transitions, 2474 flow [2024-06-04 17:08:46,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2349, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2474, PETRI_PLACES=319, PETRI_TRANSITIONS=248} [2024-06-04 17:08:46,391 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 289 predicate places. [2024-06-04 17:08:46,391 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 248 transitions, 2474 flow [2024-06-04 17:08:46,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:46,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:46,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:46,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-04 17:08:46,392 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:08:46,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:46,393 INFO L85 PathProgramCache]: Analyzing trace with hash -990022886, now seen corresponding path program 19 times [2024-06-04 17:08:46,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:46,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452250303] [2024-06-04 17:08:46,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:46,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:51,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:51,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452250303] [2024-06-04 17:08:51,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452250303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:51,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:51,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:08:51,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987349531] [2024-06-04 17:08:51,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:51,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:08:51,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:51,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:08:51,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:08:51,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:08:51,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 248 transitions, 2474 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:51,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:51,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:08:51,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:52,195 INFO L124 PetriNetUnfolderBase]: 682/1270 cut-off events. [2024-06-04 17:08:52,195 INFO L125 PetriNetUnfolderBase]: For 90281/90281 co-relation queries the response was YES. [2024-06-04 17:08:52,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7562 conditions, 1270 events. 682/1270 cut-off events. For 90281/90281 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7133 event pairs, 145 based on Foata normal form. 2/1271 useless extension candidates. Maximal degree in co-relation 7414. Up to 1111 conditions per place. [2024-06-04 17:08:52,208 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 223 selfloop transitions, 41 changer transitions 0/266 dead transitions. [2024-06-04 17:08:52,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 266 transitions, 3094 flow [2024-06-04 17:08:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:08:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:08:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2024-06-04 17:08:52,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33225806451612905 [2024-06-04 17:08:52,209 INFO L175 Difference]: Start difference. First operand has 319 places, 248 transitions, 2474 flow. Second operand 10 states and 103 transitions. [2024-06-04 17:08:52,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 266 transitions, 3094 flow [2024-06-04 17:08:52,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 266 transitions, 2966 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-04 17:08:52,545 INFO L231 Difference]: Finished difference. Result has 319 places, 249 transitions, 2488 flow [2024-06-04 17:08:52,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2346, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2488, PETRI_PLACES=319, PETRI_TRANSITIONS=249} [2024-06-04 17:08:52,546 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 289 predicate places. [2024-06-04 17:08:52,546 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 249 transitions, 2488 flow [2024-06-04 17:08:52,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:52,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:52,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:52,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-04 17:08:52,546 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:08:52,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:52,547 INFO L85 PathProgramCache]: Analyzing trace with hash -989902730, now seen corresponding path program 3 times [2024-06-04 17:08:52,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:52,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602529439] [2024-06-04 17:08:52,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:52,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:08:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:08:57,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:08:57,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602529439] [2024-06-04 17:08:57,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602529439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:08:57,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:08:57,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:08:57,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135513915] [2024-06-04 17:08:57,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:08:57,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:08:57,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:08:57,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:08:57,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:08:57,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:08:57,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 249 transitions, 2488 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:57,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:08:57,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:08:57,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:08:58,241 INFO L124 PetriNetUnfolderBase]: 680/1267 cut-off events. [2024-06-04 17:08:58,241 INFO L125 PetriNetUnfolderBase]: For 82080/82080 co-relation queries the response was YES. [2024-06-04 17:08:58,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7413 conditions, 1267 events. 680/1267 cut-off events. For 82080/82080 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7107 event pairs, 155 based on Foata normal form. 1/1267 useless extension candidates. Maximal degree in co-relation 7265. Up to 1097 conditions per place. [2024-06-04 17:08:58,255 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 202 selfloop transitions, 62 changer transitions 0/266 dead transitions. [2024-06-04 17:08:58,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 266 transitions, 3064 flow [2024-06-04 17:08:58,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:08:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:08:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:08:58,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-04 17:08:58,256 INFO L175 Difference]: Start difference. First operand has 319 places, 249 transitions, 2488 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:08:58,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 266 transitions, 3064 flow [2024-06-04 17:08:58,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 266 transitions, 2924 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-04 17:08:58,613 INFO L231 Difference]: Finished difference. Result has 321 places, 249 transitions, 2486 flow [2024-06-04 17:08:58,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2348, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2486, PETRI_PLACES=321, PETRI_TRANSITIONS=249} [2024-06-04 17:08:58,614 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 291 predicate places. [2024-06-04 17:08:58,614 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 249 transitions, 2486 flow [2024-06-04 17:08:58,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:08:58,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:08:58,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:08:58,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-04 17:08:58,614 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:08:58,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:08:58,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1702191768, now seen corresponding path program 7 times [2024-06-04 17:08:58,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:08:58,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118279664] [2024-06-04 17:08:58,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:08:58,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:08:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:03,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:03,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118279664] [2024-06-04 17:09:03,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118279664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:03,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:03,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:09:03,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286142897] [2024-06-04 17:09:03,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:03,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:09:03,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:03,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:09:03,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:09:03,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:09:03,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 249 transitions, 2486 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:03,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:03,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:09:03,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:03,948 INFO L124 PetriNetUnfolderBase]: 696/1304 cut-off events. [2024-06-04 17:09:03,948 INFO L125 PetriNetUnfolderBase]: For 114254/114254 co-relation queries the response was YES. [2024-06-04 17:09:03,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7513 conditions, 1304 events. 696/1304 cut-off events. For 114254/114254 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7366 event pairs, 138 based on Foata normal form. 10/1313 useless extension candidates. Maximal degree in co-relation 7364. Up to 1127 conditions per place. [2024-06-04 17:09:03,962 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 220 selfloop transitions, 39 changer transitions 11/272 dead transitions. [2024-06-04 17:09:03,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 272 transitions, 3132 flow [2024-06-04 17:09:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:09:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:09:03,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2024-06-04 17:09:03,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310850439882695 [2024-06-04 17:09:03,963 INFO L175 Difference]: Start difference. First operand has 321 places, 249 transitions, 2486 flow. Second operand 11 states and 117 transitions. [2024-06-04 17:09:03,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 272 transitions, 3132 flow [2024-06-04 17:09:04,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 272 transitions, 2917 flow, removed 17 selfloop flow, removed 12 redundant places. [2024-06-04 17:09:04,314 INFO L231 Difference]: Finished difference. Result has 320 places, 246 transitions, 2322 flow [2024-06-04 17:09:04,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2271, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2322, PETRI_PLACES=320, PETRI_TRANSITIONS=246} [2024-06-04 17:09:04,314 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 290 predicate places. [2024-06-04 17:09:04,314 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 246 transitions, 2322 flow [2024-06-04 17:09:04,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:04,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:04,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:09:04,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-04 17:09:04,315 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:09:04,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:04,315 INFO L85 PathProgramCache]: Analyzing trace with hash 393411394, now seen corresponding path program 20 times [2024-06-04 17:09:04,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:04,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135262503] [2024-06-04 17:09:04,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:04,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:08,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:08,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135262503] [2024-06-04 17:09:08,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135262503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:08,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:08,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:09:08,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076337399] [2024-06-04 17:09:08,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:08,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:09:08,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:08,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:09:08,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:09:08,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:09:08,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 246 transitions, 2322 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:08,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:08,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:09:08,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:09,236 INFO L124 PetriNetUnfolderBase]: 690/1297 cut-off events. [2024-06-04 17:09:09,236 INFO L125 PetriNetUnfolderBase]: For 118022/118022 co-relation queries the response was YES. [2024-06-04 17:09:09,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7383 conditions, 1297 events. 690/1297 cut-off events. For 118022/118022 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7360 event pairs, 180 based on Foata normal form. 12/1308 useless extension candidates. Maximal degree in co-relation 7236. Up to 1150 conditions per place. [2024-06-04 17:09:09,250 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 227 selfloop transitions, 30 changer transitions 7/266 dead transitions. [2024-06-04 17:09:09,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 266 transitions, 2992 flow [2024-06-04 17:09:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:09:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:09:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-04 17:09:09,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-04 17:09:09,251 INFO L175 Difference]: Start difference. First operand has 320 places, 246 transitions, 2322 flow. Second operand 10 states and 109 transitions. [2024-06-04 17:09:09,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 266 transitions, 2992 flow [2024-06-04 17:09:09,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 266 transitions, 2904 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 17:09:09,569 INFO L231 Difference]: Finished difference. Result has 317 places, 244 transitions, 2323 flow [2024-06-04 17:09:09,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2236, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2323, PETRI_PLACES=317, PETRI_TRANSITIONS=244} [2024-06-04 17:09:09,569 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 287 predicate places. [2024-06-04 17:09:09,569 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 244 transitions, 2323 flow [2024-06-04 17:09:09,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:09,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:09,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:09:09,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-04 17:09:09,570 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:09:09,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:09,570 INFO L85 PathProgramCache]: Analyzing trace with hash -954235930, now seen corresponding path program 21 times [2024-06-04 17:09:09,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:09,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851458973] [2024-06-04 17:09:09,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:09,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:13,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:13,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851458973] [2024-06-04 17:09:13,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851458973] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:13,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:13,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:09:13,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727465301] [2024-06-04 17:09:13,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:13,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:09:13,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:13,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:09:13,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:09:13,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:09:13,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 244 transitions, 2323 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:13,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:13,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:09:13,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:13,997 INFO L124 PetriNetUnfolderBase]: 670/1257 cut-off events. [2024-06-04 17:09:13,997 INFO L125 PetriNetUnfolderBase]: For 81702/81702 co-relation queries the response was YES. [2024-06-04 17:09:14,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7236 conditions, 1257 events. 670/1257 cut-off events. For 81702/81702 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7100 event pairs, 174 based on Foata normal form. 2/1258 useless extension candidates. Maximal degree in co-relation 7090. Up to 1152 conditions per place. [2024-06-04 17:09:14,011 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 225 selfloop transitions, 33 changer transitions 0/260 dead transitions. [2024-06-04 17:09:14,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 260 transitions, 2929 flow [2024-06-04 17:09:14,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:09:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:09:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-04 17:09:14,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:09:14,012 INFO L175 Difference]: Start difference. First operand has 317 places, 244 transitions, 2323 flow. Second operand 10 states and 105 transitions. [2024-06-04 17:09:14,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 260 transitions, 2929 flow [2024-06-04 17:09:14,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 260 transitions, 2819 flow, removed 23 selfloop flow, removed 10 redundant places. [2024-06-04 17:09:14,356 INFO L231 Difference]: Finished difference. Result has 317 places, 245 transitions, 2337 flow [2024-06-04 17:09:14,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2213, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2337, PETRI_PLACES=317, PETRI_TRANSITIONS=245} [2024-06-04 17:09:14,357 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 287 predicate places. [2024-06-04 17:09:14,357 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 245 transitions, 2337 flow [2024-06-04 17:09:14,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:14,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:14,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:09:14,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-04 17:09:14,358 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:09:14,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:14,358 INFO L85 PathProgramCache]: Analyzing trace with hash 823207868, now seen corresponding path program 22 times [2024-06-04 17:09:14,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:14,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828042310] [2024-06-04 17:09:14,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:14,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:20,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:20,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828042310] [2024-06-04 17:09:20,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828042310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:20,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:20,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:09:20,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087747001] [2024-06-04 17:09:20,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:20,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:09:20,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:20,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:09:20,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:09:20,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:09:20,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 245 transitions, 2337 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:20,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:20,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:09:20,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:21,050 INFO L124 PetriNetUnfolderBase]: 674/1266 cut-off events. [2024-06-04 17:09:21,050 INFO L125 PetriNetUnfolderBase]: For 83392/83392 co-relation queries the response was YES. [2024-06-04 17:09:21,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7297 conditions, 1266 events. 674/1266 cut-off events. For 83392/83392 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 7157 event pairs, 128 based on Foata normal form. 2/1267 useless extension candidates. Maximal degree in co-relation 7151. Up to 1116 conditions per place. [2024-06-04 17:09:21,063 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 214 selfloop transitions, 46 changer transitions 0/262 dead transitions. [2024-06-04 17:09:21,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 262 transitions, 2953 flow [2024-06-04 17:09:21,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:09:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:09:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-04 17:09:21,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:09:21,065 INFO L175 Difference]: Start difference. First operand has 317 places, 245 transitions, 2337 flow. Second operand 10 states and 105 transitions. [2024-06-04 17:09:21,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 262 transitions, 2953 flow [2024-06-04 17:09:21,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 262 transitions, 2839 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-04 17:09:21,396 INFO L231 Difference]: Finished difference. Result has 319 places, 246 transitions, 2375 flow [2024-06-04 17:09:21,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2225, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2375, PETRI_PLACES=319, PETRI_TRANSITIONS=246} [2024-06-04 17:09:21,397 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 289 predicate places. [2024-06-04 17:09:21,397 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 246 transitions, 2375 flow [2024-06-04 17:09:21,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:21,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:21,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:09:21,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-06-04 17:09:21,397 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:09:21,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:21,397 INFO L85 PathProgramCache]: Analyzing trace with hash -954240580, now seen corresponding path program 23 times [2024-06-04 17:09:21,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:21,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455057776] [2024-06-04 17:09:21,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:21,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:25,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:25,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455057776] [2024-06-04 17:09:25,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455057776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:25,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:25,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:09:25,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579053251] [2024-06-04 17:09:25,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:25,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:09:25,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:25,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:09:25,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:09:25,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:09:25,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 246 transitions, 2375 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:25,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:25,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:09:25,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:25,879 INFO L124 PetriNetUnfolderBase]: 678/1273 cut-off events. [2024-06-04 17:09:25,880 INFO L125 PetriNetUnfolderBase]: For 83697/83697 co-relation queries the response was YES. [2024-06-04 17:09:25,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7360 conditions, 1273 events. 678/1273 cut-off events. For 83697/83697 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 7243 event pairs, 178 based on Foata normal form. 2/1274 useless extension candidates. Maximal degree in co-relation 7213. Up to 1134 conditions per place. [2024-06-04 17:09:25,893 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 224 selfloop transitions, 36 changer transitions 0/262 dead transitions. [2024-06-04 17:09:25,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 262 transitions, 2985 flow [2024-06-04 17:09:25,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:09:25,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:09:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-04 17:09:25,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:09:25,894 INFO L175 Difference]: Start difference. First operand has 319 places, 246 transitions, 2375 flow. Second operand 10 states and 105 transitions. [2024-06-04 17:09:25,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 262 transitions, 2985 flow [2024-06-04 17:09:26,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 262 transitions, 2845 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-04 17:09:26,231 INFO L231 Difference]: Finished difference. Result has 321 places, 247 transitions, 2367 flow [2024-06-04 17:09:26,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2237, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2367, PETRI_PLACES=321, PETRI_TRANSITIONS=247} [2024-06-04 17:09:26,232 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 291 predicate places. [2024-06-04 17:09:26,232 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 247 transitions, 2367 flow [2024-06-04 17:09:26,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:26,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:26,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:09:26,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-06-04 17:09:26,232 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:09:26,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:26,232 INFO L85 PathProgramCache]: Analyzing trace with hash 387162228, now seen corresponding path program 8 times [2024-06-04 17:09:26,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:26,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018735275] [2024-06-04 17:09:26,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:26,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:30,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:30,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018735275] [2024-06-04 17:09:30,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018735275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:30,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:30,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:09:30,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822359131] [2024-06-04 17:09:30,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:30,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:09:30,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:30,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:09:30,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:09:30,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:09:30,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 247 transitions, 2367 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:30,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:30,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:09:30,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:30,965 INFO L124 PetriNetUnfolderBase]: 687/1296 cut-off events. [2024-06-04 17:09:30,965 INFO L125 PetriNetUnfolderBase]: For 112910/112910 co-relation queries the response was YES. [2024-06-04 17:09:30,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6846 conditions, 1296 events. 687/1296 cut-off events. For 112910/112910 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7421 event pairs, 177 based on Foata normal form. 16/1311 useless extension candidates. Maximal degree in co-relation 6698. Up to 1121 conditions per place. [2024-06-04 17:09:30,978 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 223 selfloop transitions, 24 changer transitions 19/268 dead transitions. [2024-06-04 17:09:30,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 268 transitions, 2997 flow [2024-06-04 17:09:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:09:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:09:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-04 17:09:30,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-04 17:09:30,979 INFO L175 Difference]: Start difference. First operand has 321 places, 247 transitions, 2367 flow. Second operand 11 states and 118 transitions. [2024-06-04 17:09:30,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 268 transitions, 2997 flow [2024-06-04 17:09:31,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 268 transitions, 2879 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-04 17:09:31,217 INFO L231 Difference]: Finished difference. Result has 324 places, 238 transitions, 2224 flow [2024-06-04 17:09:31,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2224, PETRI_PLACES=324, PETRI_TRANSITIONS=238} [2024-06-04 17:09:31,217 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 294 predicate places. [2024-06-04 17:09:31,217 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 238 transitions, 2224 flow [2024-06-04 17:09:31,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:31,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:31,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:09:31,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-06-04 17:09:31,217 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:09:31,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:31,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1000346332, now seen corresponding path program 9 times [2024-06-04 17:09:31,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:31,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920639034] [2024-06-04 17:09:31,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:31,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:35,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:35,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920639034] [2024-06-04 17:09:35,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920639034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:35,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:35,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:09:35,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347540255] [2024-06-04 17:09:35,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:35,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:09:35,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:35,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:09:35,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:09:35,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:09:35,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 238 transitions, 2224 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:35,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:35,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:09:35,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:36,194 INFO L124 PetriNetUnfolderBase]: 649/1226 cut-off events. [2024-06-04 17:09:36,194 INFO L125 PetriNetUnfolderBase]: For 88220/88220 co-relation queries the response was YES. [2024-06-04 17:09:36,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6429 conditions, 1226 events. 649/1226 cut-off events. For 88220/88220 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6941 event pairs, 173 based on Foata normal form. 10/1235 useless extension candidates. Maximal degree in co-relation 6295. Up to 1105 conditions per place. [2024-06-04 17:09:36,206 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 222 selfloop transitions, 18 changer transitions 16/258 dead transitions. [2024-06-04 17:09:36,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 258 transitions, 2830 flow [2024-06-04 17:09:36,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:09:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:09:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-04 17:09:36,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077 [2024-06-04 17:09:36,207 INFO L175 Difference]: Start difference. First operand has 324 places, 238 transitions, 2224 flow. Second operand 11 states and 115 transitions. [2024-06-04 17:09:36,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 258 transitions, 2830 flow [2024-06-04 17:09:36,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 258 transitions, 2768 flow, removed 7 selfloop flow, removed 12 redundant places. [2024-06-04 17:09:36,424 INFO L231 Difference]: Finished difference. Result has 314 places, 232 transitions, 2152 flow [2024-06-04 17:09:36,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2152, PETRI_PLACES=314, PETRI_TRANSITIONS=232} [2024-06-04 17:09:36,424 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 284 predicate places. [2024-06-04 17:09:36,424 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 232 transitions, 2152 flow [2024-06-04 17:09:36,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:36,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:36,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:09:36,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-06-04 17:09:36,424 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:09:36,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:36,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1000585342, now seen corresponding path program 10 times [2024-06-04 17:09:36,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:36,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280233923] [2024-06-04 17:09:36,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:36,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:40,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:40,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280233923] [2024-06-04 17:09:40,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280233923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:40,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:40,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:09:40,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087966202] [2024-06-04 17:09:40,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:40,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:09:40,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:40,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:09:40,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:09:40,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:09:40,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 232 transitions, 2152 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:40,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:40,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:09:40,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:41,161 INFO L124 PetriNetUnfolderBase]: 627/1188 cut-off events. [2024-06-04 17:09:41,162 INFO L125 PetriNetUnfolderBase]: For 73250/73250 co-relation queries the response was YES. [2024-06-04 17:09:41,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6179 conditions, 1188 events. 627/1188 cut-off events. For 73250/73250 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6686 event pairs, 168 based on Foata normal form. 8/1194 useless extension candidates. Maximal degree in co-relation 6049. Up to 1107 conditions per place. [2024-06-04 17:09:41,180 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 220 selfloop transitions, 14 changer transitions 12/248 dead transitions. [2024-06-04 17:09:41,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 248 transitions, 2714 flow [2024-06-04 17:09:41,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:09:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:09:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2024-06-04 17:09:41,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31671554252199413 [2024-06-04 17:09:41,181 INFO L175 Difference]: Start difference. First operand has 314 places, 232 transitions, 2152 flow. Second operand 11 states and 108 transitions. [2024-06-04 17:09:41,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 248 transitions, 2714 flow [2024-06-04 17:09:41,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 248 transitions, 2640 flow, removed 8 selfloop flow, removed 14 redundant places. [2024-06-04 17:09:41,487 INFO L231 Difference]: Finished difference. Result has 305 places, 228 transitions, 2085 flow [2024-06-04 17:09:41,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2080, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2085, PETRI_PLACES=305, PETRI_TRANSITIONS=228} [2024-06-04 17:09:41,488 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 275 predicate places. [2024-06-04 17:09:41,488 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 228 transitions, 2085 flow [2024-06-04 17:09:41,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:41,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:41,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:09:41,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2024-06-04 17:09:41,489 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:09:41,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:41,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1124943010, now seen corresponding path program 24 times [2024-06-04 17:09:41,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:41,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279819998] [2024-06-04 17:09:41,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:41,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:46,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279819998] [2024-06-04 17:09:46,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279819998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:46,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:46,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:09:46,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778355232] [2024-06-04 17:09:46,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:46,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:09:46,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:46,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:09:46,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:09:46,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:09:46,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 228 transitions, 2085 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:46,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:46,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:09:46,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:46,948 INFO L124 PetriNetUnfolderBase]: 611/1153 cut-off events. [2024-06-04 17:09:46,948 INFO L125 PetriNetUnfolderBase]: For 49811/49811 co-relation queries the response was YES. [2024-06-04 17:09:46,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5993 conditions, 1153 events. 611/1153 cut-off events. For 49811/49811 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6470 event pairs, 105 based on Foata normal form. 2/1154 useless extension candidates. Maximal degree in co-relation 5868. Up to 975 conditions per place. [2024-06-04 17:09:46,958 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 195 selfloop transitions, 48 changer transitions 0/245 dead transitions. [2024-06-04 17:09:46,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 245 transitions, 2655 flow [2024-06-04 17:09:46,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:09:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:09:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 17:09:46,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-04 17:09:46,960 INFO L175 Difference]: Start difference. First operand has 305 places, 228 transitions, 2085 flow. Second operand 10 states and 106 transitions. [2024-06-04 17:09:46,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 245 transitions, 2655 flow [2024-06-04 17:09:47,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 245 transitions, 2619 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 17:09:47,123 INFO L231 Difference]: Finished difference. Result has 299 places, 229 transitions, 2195 flow [2024-06-04 17:09:47,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2049, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2195, PETRI_PLACES=299, PETRI_TRANSITIONS=229} [2024-06-04 17:09:47,124 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 269 predicate places. [2024-06-04 17:09:47,124 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 229 transitions, 2195 flow [2024-06-04 17:09:47,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:47,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:47,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:09:47,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-06-04 17:09:47,124 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:09:47,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:47,124 INFO L85 PathProgramCache]: Analyzing trace with hash 220928448, now seen corresponding path program 11 times [2024-06-04 17:09:47,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:47,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696488587] [2024-06-04 17:09:47,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:47,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:51,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:51,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696488587] [2024-06-04 17:09:51,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696488587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:51,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:51,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:09:51,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974025980] [2024-06-04 17:09:51,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:51,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:09:51,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:51,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:09:51,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:09:52,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:09:52,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 229 transitions, 2195 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:52,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:52,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:09:52,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:52,579 INFO L124 PetriNetUnfolderBase]: 627/1189 cut-off events. [2024-06-04 17:09:52,579 INFO L125 PetriNetUnfolderBase]: For 72629/72629 co-relation queries the response was YES. [2024-06-04 17:09:52,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6222 conditions, 1189 events. 627/1189 cut-off events. For 72629/72629 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6694 event pairs, 113 based on Foata normal form. 10/1198 useless extension candidates. Maximal degree in co-relation 6099. Up to 989 conditions per place. [2024-06-04 17:09:52,591 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 195 selfloop transitions, 45 changer transitions 7/249 dead transitions. [2024-06-04 17:09:52,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 249 transitions, 2781 flow [2024-06-04 17:09:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:09:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:09:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-04 17:09:52,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-04 17:09:52,593 INFO L175 Difference]: Start difference. First operand has 299 places, 229 transitions, 2195 flow. Second operand 10 states and 110 transitions. [2024-06-04 17:09:52,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 249 transitions, 2781 flow [2024-06-04 17:09:52,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 249 transitions, 2647 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-04 17:09:52,746 INFO L231 Difference]: Finished difference. Result has 301 places, 226 transitions, 2141 flow [2024-06-04 17:09:52,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2061, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2141, PETRI_PLACES=301, PETRI_TRANSITIONS=226} [2024-06-04 17:09:52,747 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 271 predicate places. [2024-06-04 17:09:52,747 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 226 transitions, 2141 flow [2024-06-04 17:09:52,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:52,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:52,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:09:52,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2024-06-04 17:09:52,747 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:09:52,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1212680260, now seen corresponding path program 25 times [2024-06-04 17:09:52,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:52,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560923809] [2024-06-04 17:09:52,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:52,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:09:57,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:57,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560923809] [2024-06-04 17:09:57,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560923809] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:57,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:57,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:09:57,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453590897] [2024-06-04 17:09:57,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:57,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:09:57,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:57,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:09:57,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:09:57,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:09:57,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 226 transitions, 2141 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:57,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:57,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:09:57,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:58,291 INFO L124 PetriNetUnfolderBase]: 605/1147 cut-off events. [2024-06-04 17:09:58,291 INFO L125 PetriNetUnfolderBase]: For 47903/47903 co-relation queries the response was YES. [2024-06-04 17:09:58,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6039 conditions, 1147 events. 605/1147 cut-off events. For 47903/47903 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6438 event pairs, 114 based on Foata normal form. 2/1144 useless extension candidates. Maximal degree in co-relation 5915. Up to 1007 conditions per place. [2024-06-04 17:09:58,303 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 195 selfloop transitions, 44 changer transitions 0/241 dead transitions. [2024-06-04 17:09:58,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 241 transitions, 2699 flow [2024-06-04 17:09:58,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:09:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:09:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2024-06-04 17:09:58,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33548387096774196 [2024-06-04 17:09:58,304 INFO L175 Difference]: Start difference. First operand has 301 places, 226 transitions, 2141 flow. Second operand 10 states and 104 transitions. [2024-06-04 17:09:58,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 241 transitions, 2699 flow [2024-06-04 17:09:58,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 241 transitions, 2601 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 17:09:58,446 INFO L231 Difference]: Finished difference. Result has 299 places, 227 transitions, 2179 flow [2024-06-04 17:09:58,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2043, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2179, PETRI_PLACES=299, PETRI_TRANSITIONS=227} [2024-06-04 17:09:58,447 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 269 predicate places. [2024-06-04 17:09:58,447 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 227 transitions, 2179 flow [2024-06-04 17:09:58,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:09:58,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:58,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:09:58,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2024-06-04 17:09:58,448 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:09:58,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1212684910, now seen corresponding path program 26 times [2024-06-04 17:09:58,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:58,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805829564] [2024-06-04 17:09:58,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:58,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:03,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:03,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805829564] [2024-06-04 17:10:03,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805829564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:03,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:03,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:10:03,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914944153] [2024-06-04 17:10:03,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:03,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:10:03,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:03,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:10:03,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:10:04,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:10:04,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 227 transitions, 2179 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:04,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:04,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:10:04,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:04,454 INFO L124 PetriNetUnfolderBase]: 609/1155 cut-off events. [2024-06-04 17:10:04,454 INFO L125 PetriNetUnfolderBase]: For 47738/47738 co-relation queries the response was YES. [2024-06-04 17:10:04,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6125 conditions, 1155 events. 609/1155 cut-off events. For 47738/47738 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6523 event pairs, 112 based on Foata normal form. 2/1152 useless extension candidates. Maximal degree in co-relation 6002. Up to 1001 conditions per place. [2024-06-04 17:10:04,466 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 195 selfloop transitions, 45 changer transitions 0/242 dead transitions. [2024-06-04 17:10:04,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 242 transitions, 2739 flow [2024-06-04 17:10:04,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:10:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:10:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-04 17:10:04,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:10:04,467 INFO L175 Difference]: Start difference. First operand has 299 places, 227 transitions, 2179 flow. Second operand 10 states and 105 transitions. [2024-06-04 17:10:04,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 242 transitions, 2739 flow [2024-06-04 17:10:04,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 242 transitions, 2613 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-04 17:10:04,622 INFO L231 Difference]: Finished difference. Result has 301 places, 228 transitions, 2193 flow [2024-06-04 17:10:04,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2053, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2193, PETRI_PLACES=301, PETRI_TRANSITIONS=228} [2024-06-04 17:10:04,622 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 271 predicate places. [2024-06-04 17:10:04,622 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 228 transitions, 2193 flow [2024-06-04 17:10:04,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:04,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:04,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:04,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2024-06-04 17:10:04,623 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:04,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:04,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1041977830, now seen corresponding path program 27 times [2024-06-04 17:10:04,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:04,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179557080] [2024-06-04 17:10:04,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:04,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:09,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:09,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179557080] [2024-06-04 17:10:09,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179557080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:09,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:09,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:10:09,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624802950] [2024-06-04 17:10:09,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:09,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:10:09,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:09,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:10:09,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:10:09,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:10:09,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 228 transitions, 2193 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:09,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:09,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:10:09,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:09,671 INFO L124 PetriNetUnfolderBase]: 613/1163 cut-off events. [2024-06-04 17:10:09,672 INFO L125 PetriNetUnfolderBase]: For 49208/49208 co-relation queries the response was YES. [2024-06-04 17:10:09,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6178 conditions, 1163 events. 613/1163 cut-off events. For 49208/49208 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6569 event pairs, 164 based on Foata normal form. 2/1162 useless extension candidates. Maximal degree in co-relation 6054. Up to 1068 conditions per place. [2024-06-04 17:10:09,680 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 207 selfloop transitions, 33 changer transitions 0/242 dead transitions. [2024-06-04 17:10:09,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 242 transitions, 2753 flow [2024-06-04 17:10:09,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:10:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:10:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-04 17:10:09,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-04 17:10:09,681 INFO L175 Difference]: Start difference. First operand has 301 places, 228 transitions, 2193 flow. Second operand 10 states and 105 transitions. [2024-06-04 17:10:09,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 242 transitions, 2753 flow [2024-06-04 17:10:09,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 242 transitions, 2623 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-04 17:10:09,837 INFO L231 Difference]: Finished difference. Result has 303 places, 229 transitions, 2181 flow [2024-06-04 17:10:09,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2063, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2181, PETRI_PLACES=303, PETRI_TRANSITIONS=229} [2024-06-04 17:10:09,837 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 273 predicate places. [2024-06-04 17:10:09,838 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 229 transitions, 2181 flow [2024-06-04 17:10:09,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:09,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:09,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:09,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2024-06-04 17:10:09,838 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:09,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:09,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1065875686, now seen corresponding path program 28 times [2024-06-04 17:10:09,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:09,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669721502] [2024-06-04 17:10:09,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:09,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:14,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:14,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:14,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669721502] [2024-06-04 17:10:14,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669721502] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:14,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:14,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:10:14,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99598749] [2024-06-04 17:10:14,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:14,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:10:14,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:14,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:10:14,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:10:14,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:10:14,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 229 transitions, 2181 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:14,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:14,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:10:14,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:14,539 INFO L124 PetriNetUnfolderBase]: 633/1207 cut-off events. [2024-06-04 17:10:14,539 INFO L125 PetriNetUnfolderBase]: For 82117/82117 co-relation queries the response was YES. [2024-06-04 17:10:14,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6350 conditions, 1207 events. 633/1207 cut-off events. For 82117/82117 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6862 event pairs, 170 based on Foata normal form. 12/1216 useless extension candidates. Maximal degree in co-relation 6225. Up to 961 conditions per place. [2024-06-04 17:10:14,550 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 188 selfloop transitions, 51 changer transitions 7/248 dead transitions. [2024-06-04 17:10:14,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 248 transitions, 2807 flow [2024-06-04 17:10:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:10:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:10:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 17:10:14,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-04 17:10:14,551 INFO L175 Difference]: Start difference. First operand has 303 places, 229 transitions, 2181 flow. Second operand 10 states and 115 transitions. [2024-06-04 17:10:14,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 248 transitions, 2807 flow [2024-06-04 17:10:14,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 248 transitions, 2699 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-04 17:10:14,730 INFO L231 Difference]: Finished difference. Result has 305 places, 227 transitions, 2210 flow [2024-06-04 17:10:14,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2073, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2210, PETRI_PLACES=305, PETRI_TRANSITIONS=227} [2024-06-04 17:10:14,731 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 275 predicate places. [2024-06-04 17:10:14,731 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 227 transitions, 2210 flow [2024-06-04 17:10:14,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:14,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:14,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:14,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2024-06-04 17:10:14,731 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:14,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:14,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1041982480, now seen corresponding path program 29 times [2024-06-04 17:10:14,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:14,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220472156] [2024-06-04 17:10:14,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:14,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:18,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:18,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:18,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220472156] [2024-06-04 17:10:18,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220472156] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:18,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:18,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:10:18,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854187719] [2024-06-04 17:10:18,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:18,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:10:18,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:18,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:10:18,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:10:18,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:10:18,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 227 transitions, 2210 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:18,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:18,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:10:18,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:19,406 INFO L124 PetriNetUnfolderBase]: 649/1239 cut-off events. [2024-06-04 17:10:19,407 INFO L125 PetriNetUnfolderBase]: For 92181/92181 co-relation queries the response was YES. [2024-06-04 17:10:19,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7631 conditions, 1239 events. 649/1239 cut-off events. For 92181/92181 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7052 event pairs, 182 based on Foata normal form. 2/1238 useless extension candidates. Maximal degree in co-relation 7505. Up to 1056 conditions per place. [2024-06-04 17:10:19,419 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 210 selfloop transitions, 35 changer transitions 0/247 dead transitions. [2024-06-04 17:10:19,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 247 transitions, 3046 flow [2024-06-04 17:10:19,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:10:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:10:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-04 17:10:19,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-04 17:10:19,420 INFO L175 Difference]: Start difference. First operand has 305 places, 227 transitions, 2210 flow. Second operand 10 states and 110 transitions. [2024-06-04 17:10:19,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 247 transitions, 3046 flow [2024-06-04 17:10:19,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 247 transitions, 2900 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-04 17:10:19,697 INFO L231 Difference]: Finished difference. Result has 307 places, 229 transitions, 2240 flow [2024-06-04 17:10:19,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2240, PETRI_PLACES=307, PETRI_TRANSITIONS=229} [2024-06-04 17:10:19,697 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 277 predicate places. [2024-06-04 17:10:19,697 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 229 transitions, 2240 flow [2024-06-04 17:10:19,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:19,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:19,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:19,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2024-06-04 17:10:19,698 INFO L420 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:19,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:19,698 INFO L85 PathProgramCache]: Analyzing trace with hash -688638184, now seen corresponding path program 12 times [2024-06-04 17:10:19,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:19,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409560681] [2024-06-04 17:10:19,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:19,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:24,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:24,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409560681] [2024-06-04 17:10:24,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409560681] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:24,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:24,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:10:24,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851144941] [2024-06-04 17:10:24,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:24,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:10:24,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:24,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:10:24,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:10:24,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:10:24,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 229 transitions, 2240 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:24,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:24,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:10:24,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:25,277 INFO L124 PetriNetUnfolderBase]: 665/1275 cut-off events. [2024-06-04 17:10:25,278 INFO L125 PetriNetUnfolderBase]: For 120076/120076 co-relation queries the response was YES. [2024-06-04 17:10:25,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7696 conditions, 1275 events. 665/1275 cut-off events. For 120076/120076 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7307 event pairs, 188 based on Foata normal form. 10/1282 useless extension candidates. Maximal degree in co-relation 7569. Up to 1134 conditions per place. [2024-06-04 17:10:25,291 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 203 selfloop transitions, 27 changer transitions 16/248 dead transitions. [2024-06-04 17:10:25,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 248 transitions, 2820 flow [2024-06-04 17:10:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:10:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:10:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2024-06-04 17:10:25,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3460410557184751 [2024-06-04 17:10:25,292 INFO L175 Difference]: Start difference. First operand has 307 places, 229 transitions, 2240 flow. Second operand 11 states and 118 transitions. [2024-06-04 17:10:25,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 248 transitions, 2820 flow [2024-06-04 17:10:25,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 248 transitions, 2726 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-04 17:10:25,609 INFO L231 Difference]: Finished difference. Result has 312 places, 223 transitions, 2156 flow [2024-06-04 17:10:25,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2146, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2156, PETRI_PLACES=312, PETRI_TRANSITIONS=223} [2024-06-04 17:10:25,610 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 282 predicate places. [2024-06-04 17:10:25,610 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 223 transitions, 2156 flow [2024-06-04 17:10:25,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:25,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:25,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:25,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2024-06-04 17:10:25,610 INFO L420 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:25,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1072304776, now seen corresponding path program 30 times [2024-06-04 17:10:25,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:25,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672157146] [2024-06-04 17:10:25,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:25,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:29,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:29,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:29,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672157146] [2024-06-04 17:10:29,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672157146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:29,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:29,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:10:29,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362006989] [2024-06-04 17:10:29,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:29,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:10:29,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:29,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:10:29,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:10:29,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:10:29,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 223 transitions, 2156 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:29,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:29,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:10:29,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:30,368 INFO L124 PetriNetUnfolderBase]: 633/1215 cut-off events. [2024-06-04 17:10:30,368 INFO L125 PetriNetUnfolderBase]: For 95609/95609 co-relation queries the response was YES. [2024-06-04 17:10:30,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7472 conditions, 1215 events. 633/1215 cut-off events. For 95609/95609 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6913 event pairs, 180 based on Foata normal form. 2/1214 useless extension candidates. Maximal degree in co-relation 7343. Up to 1033 conditions per place. [2024-06-04 17:10:30,381 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 183 selfloop transitions, 53 changer transitions 0/238 dead transitions. [2024-06-04 17:10:30,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 238 transitions, 2718 flow [2024-06-04 17:10:30,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:10:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:10:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-04 17:10:30,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-04 17:10:30,382 INFO L175 Difference]: Start difference. First operand has 312 places, 223 transitions, 2156 flow. Second operand 10 states and 110 transitions. [2024-06-04 17:10:30,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 238 transitions, 2718 flow [2024-06-04 17:10:30,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 238 transitions, 2632 flow, removed 10 selfloop flow, removed 12 redundant places. [2024-06-04 17:10:30,656 INFO L231 Difference]: Finished difference. Result has 304 places, 224 transitions, 2234 flow [2024-06-04 17:10:30,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2074, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2234, PETRI_PLACES=304, PETRI_TRANSITIONS=224} [2024-06-04 17:10:30,656 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 274 predicate places. [2024-06-04 17:10:30,656 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 224 transitions, 2234 flow [2024-06-04 17:10:30,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:30,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:30,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:30,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2024-06-04 17:10:30,657 INFO L420 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:30,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:30,657 INFO L85 PathProgramCache]: Analyzing trace with hash -141907664, now seen corresponding path program 31 times [2024-06-04 17:10:30,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:30,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025381168] [2024-06-04 17:10:30,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:30,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:35,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:35,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025381168] [2024-06-04 17:10:35,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025381168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:35,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:35,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:10:35,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272321815] [2024-06-04 17:10:35,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:35,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:10:35,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:35,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:10:35,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:10:35,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:10:35,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 224 transitions, 2234 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:35,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:35,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:10:35,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:35,619 INFO L124 PetriNetUnfolderBase]: 617/1187 cut-off events. [2024-06-04 17:10:35,619 INFO L125 PetriNetUnfolderBase]: For 82237/82237 co-relation queries the response was YES. [2024-06-04 17:10:35,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6325 conditions, 1187 events. 617/1187 cut-off events. For 82237/82237 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6788 event pairs, 172 based on Foata normal form. 12/1196 useless extension candidates. Maximal degree in co-relation 6199. Up to 1066 conditions per place. [2024-06-04 17:10:35,636 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 207 selfloop transitions, 25 changer transitions 7/241 dead transitions. [2024-06-04 17:10:35,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 241 transitions, 2794 flow [2024-06-04 17:10:35,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:10:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:10:35,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-04 17:10:35,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34838709677419355 [2024-06-04 17:10:35,641 INFO L175 Difference]: Start difference. First operand has 304 places, 224 transitions, 2234 flow. Second operand 10 states and 108 transitions. [2024-06-04 17:10:35,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 241 transitions, 2794 flow [2024-06-04 17:10:35,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 241 transitions, 2612 flow, removed 39 selfloop flow, removed 8 redundant places. [2024-06-04 17:10:35,831 INFO L231 Difference]: Finished difference. Result has 306 places, 221 transitions, 2083 flow [2024-06-04 17:10:35,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2052, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2083, PETRI_PLACES=306, PETRI_TRANSITIONS=221} [2024-06-04 17:10:35,831 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 276 predicate places. [2024-06-04 17:10:35,832 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 221 transitions, 2083 flow [2024-06-04 17:10:35,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:35,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:35,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:35,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2024-06-04 17:10:35,832 INFO L420 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:35,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1035541796, now seen corresponding path program 13 times [2024-06-04 17:10:35,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:35,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199135616] [2024-06-04 17:10:35,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:35,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:40,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:40,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199135616] [2024-06-04 17:10:40,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199135616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:40,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:40,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:10:40,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649160086] [2024-06-04 17:10:40,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:40,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:10:40,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:40,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:10:40,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:10:40,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:10:40,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 221 transitions, 2083 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:40,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:40,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:10:40,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:40,897 INFO L124 PetriNetUnfolderBase]: 609/1175 cut-off events. [2024-06-04 17:10:40,898 INFO L125 PetriNetUnfolderBase]: For 75387/75387 co-relation queries the response was YES. [2024-06-04 17:10:40,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6058 conditions, 1175 events. 609/1175 cut-off events. For 75387/75387 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6695 event pairs, 174 based on Foata normal form. 10/1182 useless extension candidates. Maximal degree in co-relation 5931. Up to 1056 conditions per place. [2024-06-04 17:10:40,911 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 202 selfloop transitions, 19 changer transitions 16/239 dead transitions. [2024-06-04 17:10:40,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 239 transitions, 2641 flow [2024-06-04 17:10:40,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:10:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:10:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2024-06-04 17:10:40,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3343108504398827 [2024-06-04 17:10:40,912 INFO L175 Difference]: Start difference. First operand has 306 places, 221 transitions, 2083 flow. Second operand 11 states and 114 transitions. [2024-06-04 17:10:40,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 239 transitions, 2641 flow [2024-06-04 17:10:41,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 239 transitions, 2547 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-04 17:10:41,097 INFO L231 Difference]: Finished difference. Result has 305 places, 215 transitions, 1990 flow [2024-06-04 17:10:41,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1989, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1990, PETRI_PLACES=305, PETRI_TRANSITIONS=215} [2024-06-04 17:10:41,098 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 275 predicate places. [2024-06-04 17:10:41,098 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 215 transitions, 1990 flow [2024-06-04 17:10:41,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:41,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:41,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:41,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2024-06-04 17:10:41,098 INFO L420 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:41,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:41,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1497256636, now seen corresponding path program 32 times [2024-06-04 17:10:41,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:41,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706151061] [2024-06-04 17:10:41,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:41,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:45,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:45,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706151061] [2024-06-04 17:10:45,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706151061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:45,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:45,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:10:45,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101007231] [2024-06-04 17:10:45,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:45,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:10:45,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:45,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:10:45,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:10:45,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:10:45,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 215 transitions, 1990 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:45,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:45,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:10:45,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:46,262 INFO L124 PetriNetUnfolderBase]: 615/1189 cut-off events. [2024-06-04 17:10:46,263 INFO L125 PetriNetUnfolderBase]: For 93048/93048 co-relation queries the response was YES. [2024-06-04 17:10:46,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7223 conditions, 1189 events. 615/1189 cut-off events. For 93048/93048 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6781 event pairs, 178 based on Foata normal form. 2/1188 useless extension candidates. Maximal degree in co-relation 7097. Up to 933 conditions per place. [2024-06-04 17:10:46,273 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 183 selfloop transitions, 51 changer transitions 0/236 dead transitions. [2024-06-04 17:10:46,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 236 transitions, 2810 flow [2024-06-04 17:10:46,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:10:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:10:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 17:10:46,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-04 17:10:46,274 INFO L175 Difference]: Start difference. First operand has 305 places, 215 transitions, 1990 flow. Second operand 10 states and 115 transitions. [2024-06-04 17:10:46,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 236 transitions, 2810 flow [2024-06-04 17:10:46,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 236 transitions, 2750 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-04 17:10:46,540 INFO L231 Difference]: Finished difference. Result has 298 places, 217 transitions, 2146 flow [2024-06-04 17:10:46,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2146, PETRI_PLACES=298, PETRI_TRANSITIONS=217} [2024-06-04 17:10:46,540 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 268 predicate places. [2024-06-04 17:10:46,541 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 217 transitions, 2146 flow [2024-06-04 17:10:46,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:46,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:46,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:46,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2024-06-04 17:10:46,541 INFO L420 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:46,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:46,541 INFO L85 PathProgramCache]: Analyzing trace with hash 681851628, now seen corresponding path program 14 times [2024-06-04 17:10:46,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:46,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388284890] [2024-06-04 17:10:46,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:46,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:10:50,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:50,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388284890] [2024-06-04 17:10:50,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388284890] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:50,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:50,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:10:50,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302396298] [2024-06-04 17:10:50,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:50,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:10:50,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:50,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:10:50,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:10:50,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:10:50,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 217 transitions, 2146 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:50,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:50,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:10:50,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:51,030 INFO L124 PetriNetUnfolderBase]: 656/1276 cut-off events. [2024-06-04 17:10:51,030 INFO L125 PetriNetUnfolderBase]: For 135967/135967 co-relation queries the response was YES. [2024-06-04 17:10:51,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8386 conditions, 1276 events. 656/1276 cut-off events. For 135967/135967 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7357 event pairs, 199 based on Foata normal form. 8/1281 useless extension candidates. Maximal degree in co-relation 8263. Up to 991 conditions per place. [2024-06-04 17:10:51,043 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 188 selfloop transitions, 41 changer transitions 8/239 dead transitions. [2024-06-04 17:10:51,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 239 transitions, 2902 flow [2024-06-04 17:10:51,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:10:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:10:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 17:10:51,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 17:10:51,044 INFO L175 Difference]: Start difference. First operand has 298 places, 217 transitions, 2146 flow. Second operand 11 states and 124 transitions. [2024-06-04 17:10:51,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 239 transitions, 2902 flow [2024-06-04 17:10:51,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 239 transitions, 2756 flow, removed 27 selfloop flow, removed 7 redundant places. [2024-06-04 17:10:51,398 INFO L231 Difference]: Finished difference. Result has 302 places, 214 transitions, 2067 flow [2024-06-04 17:10:51,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2067, PETRI_PLACES=302, PETRI_TRANSITIONS=214} [2024-06-04 17:10:51,398 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 272 predicate places. [2024-06-04 17:10:51,398 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 214 transitions, 2067 flow [2024-06-04 17:10:51,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:51,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:51,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:51,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2024-06-04 17:10:51,399 INFO L420 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:51,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:51,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1065868742, now seen corresponding path program 15 times [2024-06-04 17:10:51,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:51,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186586384] [2024-06-04 17:10:51,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:51,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:56,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-04 17:10:56,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:56,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186586384] [2024-06-04 17:10:56,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186586384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:56,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:56,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:10:56,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858670434] [2024-06-04 17:10:56,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:56,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:10:56,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:56,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:10:56,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:10:56,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:10:56,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 214 transitions, 2067 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:56,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:56,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:10:56,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:57,196 INFO L124 PetriNetUnfolderBase]: 653/1271 cut-off events. [2024-06-04 17:10:57,196 INFO L125 PetriNetUnfolderBase]: For 144716/144716 co-relation queries the response was YES. [2024-06-04 17:10:57,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8283 conditions, 1271 events. 653/1271 cut-off events. For 144716/144716 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7329 event pairs, 203 based on Foata normal form. 10/1278 useless extension candidates. Maximal degree in co-relation 8159. Up to 1070 conditions per place. [2024-06-04 17:10:57,209 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 182 selfloop transitions, 41 changer transitions 9/234 dead transitions. [2024-06-04 17:10:57,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 234 transitions, 2623 flow [2024-06-04 17:10:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:10:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:10:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2024-06-04 17:10:57,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34946236559139787 [2024-06-04 17:10:57,210 INFO L175 Difference]: Start difference. First operand has 302 places, 214 transitions, 2067 flow. Second operand 12 states and 130 transitions. [2024-06-04 17:10:57,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 234 transitions, 2623 flow [2024-06-04 17:10:57,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 234 transitions, 2541 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-04 17:10:57,596 INFO L231 Difference]: Finished difference. Result has 300 places, 211 transitions, 2049 flow [2024-06-04 17:10:57,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1985, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2049, PETRI_PLACES=300, PETRI_TRANSITIONS=211} [2024-06-04 17:10:57,596 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 270 predicate places. [2024-06-04 17:10:57,596 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 211 transitions, 2049 flow [2024-06-04 17:10:57,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:10:57,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:57,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:57,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2024-06-04 17:10:57,597 INFO L420 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:57,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:57,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1212800230, now seen corresponding path program 33 times [2024-06-04 17:10:57,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:57,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959407390] [2024-06-04 17:10:57,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:57,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:11:02,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:02,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959407390] [2024-06-04 17:11:02,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959407390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:02,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:02,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:11:02,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087390865] [2024-06-04 17:11:02,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:02,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:11:02,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:02,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:11:02,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:11:02,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:11:02,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 211 transitions, 2049 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:11:02,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:02,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:11:02,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:03,318 INFO L124 PetriNetUnfolderBase]: 624/1216 cut-off events. [2024-06-04 17:11:03,318 INFO L125 PetriNetUnfolderBase]: For 108247/108247 co-relation queries the response was YES. [2024-06-04 17:11:03,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7801 conditions, 1216 events. 624/1216 cut-off events. For 108247/108247 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6928 event pairs, 150 based on Foata normal form. 2/1213 useless extension candidates. Maximal degree in co-relation 7679. Up to 1076 conditions per place. [2024-06-04 17:11:03,330 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 181 selfloop transitions, 42 changer transitions 0/225 dead transitions. [2024-06-04 17:11:03,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 225 transitions, 2529 flow [2024-06-04 17:11:03,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:11:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:11:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2024-06-04 17:11:03,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32903225806451614 [2024-06-04 17:11:03,331 INFO L175 Difference]: Start difference. First operand has 300 places, 211 transitions, 2049 flow. Second operand 10 states and 102 transitions. [2024-06-04 17:11:03,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 225 transitions, 2529 flow [2024-06-04 17:11:03,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 225 transitions, 2441 flow, removed 2 selfloop flow, removed 12 redundant places. [2024-06-04 17:11:03,640 INFO L231 Difference]: Finished difference. Result has 296 places, 211 transitions, 2049 flow [2024-06-04 17:11:03,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1961, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2049, PETRI_PLACES=296, PETRI_TRANSITIONS=211} [2024-06-04 17:11:03,641 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 266 predicate places. [2024-06-04 17:11:03,641 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 211 transitions, 2049 flow [2024-06-04 17:11:03,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:11:03,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:03,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:11:03,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2024-06-04 17:11:03,642 INFO L420 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:11:03,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:03,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1035302786, now seen corresponding path program 16 times [2024-06-04 17:11:03,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:03,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505940250] [2024-06-04 17:11:03,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:11:07,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:07,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505940250] [2024-06-04 17:11:07,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505940250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:07,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:07,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:11:07,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40511053] [2024-06-04 17:11:07,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:07,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:11:07,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:07,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:11:07,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:11:07,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-04 17:11:07,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 211 transitions, 2049 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:11:07,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:07,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-04 17:11:07,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:08,284 INFO L124 PetriNetUnfolderBase]: 636/1244 cut-off events. [2024-06-04 17:11:08,284 INFO L125 PetriNetUnfolderBase]: For 123246/123246 co-relation queries the response was YES. [2024-06-04 17:11:08,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7897 conditions, 1244 events. 636/1244 cut-off events. For 123246/123246 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7144 event pairs, 208 based on Foata normal form. 8/1249 useless extension candidates. Maximal degree in co-relation 7776. Up to 1153 conditions per place. [2024-06-04 17:11:08,297 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 195 selfloop transitions, 17 changer transitions 12/226 dead transitions. [2024-06-04 17:11:08,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 226 transitions, 2561 flow [2024-06-04 17:11:08,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:11:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:11:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2024-06-04 17:11:08,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3258064516129032 [2024-06-04 17:11:08,297 INFO L175 Difference]: Start difference. First operand has 296 places, 211 transitions, 2049 flow. Second operand 10 states and 101 transitions. [2024-06-04 17:11:08,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 226 transitions, 2561 flow [2024-06-04 17:11:08,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 226 transitions, 2376 flow, removed 23 selfloop flow, removed 11 redundant places. [2024-06-04 17:11:08,631 INFO L231 Difference]: Finished difference. Result has 295 places, 207 transitions, 1880 flow [2024-06-04 17:11:08,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1880, PETRI_PLACES=295, PETRI_TRANSITIONS=207} [2024-06-04 17:11:08,631 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 265 predicate places. [2024-06-04 17:11:08,631 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 207 transitions, 1880 flow [2024-06-04 17:11:08,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:11:08,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:08,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:11:08,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2024-06-04 17:11:08,632 INFO L420 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:11:08,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:08,632 INFO L85 PathProgramCache]: Analyzing trace with hash -314390610, now seen corresponding path program 17 times [2024-06-04 17:11:08,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:08,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209865537] [2024-06-04 17:11:08,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15