./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix000.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix000.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 14:22:31,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:22:31,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:22:31,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:22:31,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:22:31,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:22:31,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:22:31,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:22:31,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:22:31,729 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:22:31,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:22:31,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:22:31,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:22:31,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:22:31,732 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:22:31,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:22:31,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:22:31,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:22:31,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:22:31,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:22:31,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:22:31,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:22:31,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:22:31,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:22:31,734 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:22:31,734 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:22:31,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:22:31,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:22:31,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:22:31,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:22:31,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:22:31,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:22:31,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:22:31,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:22:31,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:22:31,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:22:31,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:22:31,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:22:31,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:22:31,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:22:31,738 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:22:31,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:22:31,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:22:31,739 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 14:22:31,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:22:31,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:22:31,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:22:31,949 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:22:31,950 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:22:31,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2024-06-14 14:22:32,973 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:22:33,214 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:22:33,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2024-06-14 14:22:33,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82883ba1/bee2876f7a714b6293dfcd25aac58f67/FLAGe894dbbf6 [2024-06-14 14:22:33,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82883ba1/bee2876f7a714b6293dfcd25aac58f67 [2024-06-14 14:22:33,245 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:22:33,246 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:22:33,247 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/mix000.opt.yml/witness.yml [2024-06-14 14:22:33,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:22:33,402 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:22:33,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:22:33,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:22:33,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:22:33,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:22:33" (1/2) ... [2024-06-14 14:22:33,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c2b3eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:33, skipping insertion in model container [2024-06-14 14:22:33,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:22:33" (1/2) ... [2024-06-14 14:22:33,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@343df31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:33, skipping insertion in model container [2024-06-14 14:22:33,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:33" (2/2) ... [2024-06-14 14:22:33,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c2b3eb1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:33, skipping insertion in model container [2024-06-14 14:22:33,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:33" (2/2) ... [2024-06-14 14:22:33,428 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:22:33,482 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:22:33,483 INFO L97 edCorrectnessWitness]: Location invariant before [L830-L830] (((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL && (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_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )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) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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_p0_EAX >= 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_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 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_p0_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (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) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (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_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (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 || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 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_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && 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) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) [2024-06-14 14:22:33,484 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] (((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL && (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_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )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) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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_p0_EAX >= 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_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 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_p0_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (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) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (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_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (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 || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 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_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && 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) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) [2024-06-14 14:22:33,484 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:22:33,484 INFO L106 edCorrectnessWitness]: ghost_update [L827-L827] multithreaded = 1; [2024-06-14 14:22:33,508 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:22:33,742 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:22:33,765 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 14:22:34,015 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:22:34,054 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:22:34,060 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:34 WrapperNode [2024-06-14 14:22:34,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:22:34,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:22:34,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:22:34,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:22:34,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,163 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-06-14 14:22:34,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:22:34,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:22:34,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:22:34,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:22:34,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,215 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 14:22:34,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:22:34,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:22:34,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:22:34,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:22:34,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:22:34,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:34,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 14:22:34,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 14:22:34,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:22:34,330 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 14:22:34,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 14:22:34,330 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 14:22:34,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 14:22:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:22:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 14:22:34,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:22:34,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:22:34,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 14:22:34,332 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 14:22:34,441 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:22:34,442 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:22:35,262 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:22:35,262 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:22:35,463 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:22:35,463 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 14:22:35,465 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:22:35 BoogieIcfgContainer [2024-06-14 14:22:35,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:22:35,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:22:35,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:22:35,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:22:35,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:22:33" (1/4) ... [2024-06-14 14:22:35,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228c25b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:22:35, skipping insertion in model container [2024-06-14 14:22:35,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:33" (2/4) ... [2024-06-14 14:22:35,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228c25b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:22:35, skipping insertion in model container [2024-06-14 14:22:35,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:34" (3/4) ... [2024-06-14 14:22:35,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228c25b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:22:35, skipping insertion in model container [2024-06-14 14:22:35,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:22:35" (4/4) ... [2024-06-14 14:22:35,477 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2024-06-14 14:22:35,491 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:22:35,492 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 14:22:35,492 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:22:35,565 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 14:22:35,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 14:22:35,632 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-14 14:22:35,632 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:35,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 14:22:35,635 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 14:22:35,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-14 14:22:35,648 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:22:35,655 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;@59db60ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:22:35,655 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:22:35,663 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:22:35,663 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-14 14:22:35,663 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:35,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:35,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 14:22:35,664 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:35,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:35,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1642904383, now seen corresponding path program 1 times [2024-06-14 14:22:35,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:35,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109761054] [2024-06-14 14:22:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:39,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:39,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:39,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109761054] [2024-06-14 14:22:39,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109761054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:39,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:39,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:22:39,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789222015] [2024-06-14 14:22:39,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:39,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:22:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:39,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:22:39,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:22:40,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-14 14:22:40,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:40,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:40,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-14 14:22:40,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:40,252 INFO L124 PetriNetUnfolderBase]: 131/262 cut-off events. [2024-06-14 14:22:40,252 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-14 14:22:40,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 262 events. 131/262 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1025 event pairs, 75 based on Foata normal form. 1/252 useless extension candidates. Maximal degree in co-relation 506. Up to 235 conditions per place. [2024-06-14 14:22:40,258 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 22 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-14 14:22:40,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 119 flow [2024-06-14 14:22:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:22:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:22:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-06-14 14:22:40,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-06-14 14:22:40,269 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 57 transitions. [2024-06-14 14:22:40,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 119 flow [2024-06-14 14:22:40,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:22:40,273 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-14 14:22:40,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-14 14:22:40,278 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-14 14:22:40,278 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-14 14:22:40,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:40,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:40,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:40,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:22:40,279 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:40,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1717139950, now seen corresponding path program 1 times [2024-06-14 14:22:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:40,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366273988] [2024-06-14 14:22:40,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:40,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:43,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:43,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366273988] [2024-06-14 14:22:43,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366273988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:43,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:43,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 14:22:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199231379] [2024-06-14 14:22:43,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:43,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 14:22:43,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:43,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 14:22:43,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 14:22:43,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:22:43,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:43,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:43,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:22:43,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:44,256 INFO L124 PetriNetUnfolderBase]: 186/342 cut-off events. [2024-06-14 14:22:44,256 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-06-14 14:22:44,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 342 events. 186/342 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1273 event pairs, 94 based on Foata normal form. 2/341 useless extension candidates. Maximal degree in co-relation 771. Up to 319 conditions per place. [2024-06-14 14:22:44,261 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 28 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-14 14:22:44,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 165 flow [2024-06-14 14:22:44,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:22:44,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:22:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-14 14:22:44,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2024-06-14 14:22:44,265 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 67 transitions. [2024-06-14 14:22:44,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 165 flow [2024-06-14 14:22:44,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:22:44,268 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-14 14:22:44,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-14 14:22:44,270 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-14 14:22:44,270 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-14 14:22:44,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:44,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:44,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:44,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 14:22:44,271 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:44,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:44,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1683688252, now seen corresponding path program 1 times [2024-06-14 14:22:44,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:44,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322854013] [2024-06-14 14:22:44,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:44,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:47,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:47,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322854013] [2024-06-14 14:22:47,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322854013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:47,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:47,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 14:22:47,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348821587] [2024-06-14 14:22:47,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:47,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:22:47,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:47,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:22:47,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 14:22:47,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:22:47,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:47,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:47,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:22:47,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:47,586 INFO L124 PetriNetUnfolderBase]: 183/337 cut-off events. [2024-06-14 14:22:47,586 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-06-14 14:22:47,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 337 events. 183/337 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1246 event pairs, 73 based on Foata normal form. 2/337 useless extension candidates. Maximal degree in co-relation 843. Up to 305 conditions per place. [2024-06-14 14:22:47,588 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 32 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-14 14:22:47,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 213 flow [2024-06-14 14:22:47,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:22:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:22:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-06-14 14:22:47,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50625 [2024-06-14 14:22:47,592 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 81 transitions. [2024-06-14 14:22:47,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 213 flow [2024-06-14 14:22:47,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 204 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 14:22:47,595 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-14 14:22:47,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-14 14:22:47,596 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-14 14:22:47,596 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-14 14:22:47,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:47,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:47,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:47,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 14:22:47,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:47,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:47,597 INFO L85 PathProgramCache]: Analyzing trace with hash 654729215, now seen corresponding path program 1 times [2024-06-14 14:22:47,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:47,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117223479] [2024-06-14 14:22:47,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:47,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:51,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:51,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117223479] [2024-06-14 14:22:51,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117223479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:51,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:51,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:22:51,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430993086] [2024-06-14 14:22:51,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:51,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:22:51,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:51,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:22:51,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:22:51,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:22:51,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:51,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:51,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:22:51,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:51,608 INFO L124 PetriNetUnfolderBase]: 180/332 cut-off events. [2024-06-14 14:22:51,609 INFO L125 PetriNetUnfolderBase]: For 332/332 co-relation queries the response was YES. [2024-06-14 14:22:51,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 332 events. 180/332 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1216 event pairs, 52 based on Foata normal form. 2/332 useless extension candidates. Maximal degree in co-relation 910. Up to 291 conditions per place. [2024-06-14 14:22:51,611 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 9 changer transitions 0/48 dead transitions. [2024-06-14 14:22:51,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 261 flow [2024-06-14 14:22:51,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:22:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:22:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-14 14:22:51,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-06-14 14:22:51,612 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 6 states and 95 transitions. [2024-06-14 14:22:51,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 261 flow [2024-06-14 14:22:51,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 246 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 14:22:51,614 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 145 flow [2024-06-14 14:22:51,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2024-06-14 14:22:51,615 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-14 14:22:51,615 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 145 flow [2024-06-14 14:22:51,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:51,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:51,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:51,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:22:51,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:51,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:51,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1621724491, now seen corresponding path program 1 times [2024-06-14 14:22:51,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:51,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512817041] [2024-06-14 14:22:51,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:51,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:57,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:57,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512817041] [2024-06-14 14:22:57,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512817041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:57,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:57,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:22:57,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353205314] [2024-06-14 14:22:57,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:57,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:22:57,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:57,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:22:57,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:22:57,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 14:22:57,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:57,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:57,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 14:22:57,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:57,405 INFO L124 PetriNetUnfolderBase]: 137/284 cut-off events. [2024-06-14 14:22:57,405 INFO L125 PetriNetUnfolderBase]: For 406/406 co-relation queries the response was YES. [2024-06-14 14:22:57,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 284 events. 137/284 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1111 event pairs, 42 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 816. Up to 243 conditions per place. [2024-06-14 14:22:57,407 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 27 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2024-06-14 14:22:57,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 229 flow [2024-06-14 14:22:57,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:22:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:22:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-06-14 14:22:57,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-06-14 14:22:57,408 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 145 flow. Second operand 5 states and 74 transitions. [2024-06-14 14:22:57,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 229 flow [2024-06-14 14:22:57,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 208 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 14:22:57,410 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 151 flow [2024-06-14 14:22:57,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2024-06-14 14:22:57,411 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2024-06-14 14:22:57,411 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 151 flow [2024-06-14 14:22:57,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:57,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:57,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:57,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:22:57,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:57,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2129581982, now seen corresponding path program 1 times [2024-06-14 14:22:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:57,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807710472] [2024-06-14 14:22:57,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:01,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:01,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807710472] [2024-06-14 14:23:01,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807710472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:01,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:01,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:23:01,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027406060] [2024-06-14 14:23:01,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:01,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:23:01,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:01,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:23:01,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:23:01,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:23:01,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 151 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:01,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:01,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:23:01,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:01,950 INFO L124 PetriNetUnfolderBase]: 174/321 cut-off events. [2024-06-14 14:23:01,950 INFO L125 PetriNetUnfolderBase]: For 646/646 co-relation queries the response was YES. [2024-06-14 14:23:01,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 321 events. 174/321 cut-off events. For 646/646 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1150 event pairs, 29 based on Foata normal form. 4/323 useless extension candidates. Maximal degree in co-relation 989. Up to 262 conditions per place. [2024-06-14 14:23:01,952 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 38 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2024-06-14 14:23:01,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 281 flow [2024-06-14 14:23:01,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-14 14:23:01,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-14 14:23:01,954 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 151 flow. Second operand 7 states and 104 transitions. [2024-06-14 14:23:01,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 281 flow [2024-06-14 14:23:01,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 270 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 14:23:01,956 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 154 flow [2024-06-14 14:23:01,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2024-06-14 14:23:01,958 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2024-06-14 14:23:01,959 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 154 flow [2024-06-14 14:23:01,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:01,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:01,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:01,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 14:23:01,959 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:01,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:01,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1276874622, now seen corresponding path program 1 times [2024-06-14 14:23:01,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:01,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620549334] [2024-06-14 14:23:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:01,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:08,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:08,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620549334] [2024-06-14 14:23:08,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620549334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:08,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:08,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:23:08,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407418605] [2024-06-14 14:23:08,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:08,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:23:08,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:08,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:23:08,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:23:09,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 14:23:09,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:09,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:09,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 14:23:09,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:09,274 INFO L124 PetriNetUnfolderBase]: 131/271 cut-off events. [2024-06-14 14:23:09,275 INFO L125 PetriNetUnfolderBase]: For 682/682 co-relation queries the response was YES. [2024-06-14 14:23:09,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 271 events. 131/271 cut-off events. For 682/682 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1023 event pairs, 37 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 856. Up to 229 conditions per place. [2024-06-14 14:23:09,276 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 27 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2024-06-14 14:23:09,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 246 flow [2024-06-14 14:23:09,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:23:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:23:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-14 14:23:09,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2024-06-14 14:23:09,278 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 154 flow. Second operand 6 states and 85 transitions. [2024-06-14 14:23:09,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 246 flow [2024-06-14 14:23:09,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 220 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 14:23:09,280 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 161 flow [2024-06-14 14:23:09,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-06-14 14:23:09,281 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-14 14:23:09,281 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 161 flow [2024-06-14 14:23:09,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:09,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:09,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:09,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 14:23:09,282 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:09,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:09,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2075778054, now seen corresponding path program 1 times [2024-06-14 14:23:09,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:09,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179162115] [2024-06-14 14:23:09,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:09,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:14,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:14,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179162115] [2024-06-14 14:23:14,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179162115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:14,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:14,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:23:14,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117335327] [2024-06-14 14:23:14,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:14,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:23:14,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:14,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:23:14,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:23:14,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:23:14,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 161 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:14,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:14,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:23:14,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:15,117 INFO L124 PetriNetUnfolderBase]: 173/320 cut-off events. [2024-06-14 14:23:15,118 INFO L125 PetriNetUnfolderBase]: For 987/987 co-relation queries the response was YES. [2024-06-14 14:23:15,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 320 events. 173/320 cut-off events. For 987/987 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1135 event pairs, 44 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 1072. Up to 294 conditions per place. [2024-06-14 14:23:15,120 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 35 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-14 14:23:15,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 277 flow [2024-06-14 14:23:15,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:23:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:23:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-06-14 14:23:15,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 14:23:15,123 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 161 flow. Second operand 6 states and 78 transitions. [2024-06-14 14:23:15,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 277 flow [2024-06-14 14:23:15,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 260 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 14:23:15,126 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 177 flow [2024-06-14 14:23:15,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-06-14 14:23:15,128 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-14 14:23:15,128 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 177 flow [2024-06-14 14:23:15,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:15,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:15,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:15,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:23:15,129 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:15,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash 595932692, now seen corresponding path program 2 times [2024-06-14 14:23:15,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:15,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096033058] [2024-06-14 14:23:15,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:15,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:20,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:20,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096033058] [2024-06-14 14:23:20,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096033058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:20,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:20,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:23:20,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148703730] [2024-06-14 14:23:20,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:20,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:23:20,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:20,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:23:20,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:23:20,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:23:20,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 177 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:20,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:20,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:23:20,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:20,361 INFO L124 PetriNetUnfolderBase]: 171/318 cut-off events. [2024-06-14 14:23:20,361 INFO L125 PetriNetUnfolderBase]: For 1231/1231 co-relation queries the response was YES. [2024-06-14 14:23:20,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 318 events. 171/318 cut-off events. For 1231/1231 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1147 event pairs, 45 based on Foata normal form. 1/316 useless extension candidates. Maximal degree in co-relation 1120. Up to 285 conditions per place. [2024-06-14 14:23:20,363 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 31 selfloop transitions, 13 changer transitions 0/47 dead transitions. [2024-06-14 14:23:20,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 307 flow [2024-06-14 14:23:20,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-14 14:23:20,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2024-06-14 14:23:20,364 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 177 flow. Second operand 7 states and 86 transitions. [2024-06-14 14:23:20,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 307 flow [2024-06-14 14:23:20,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 47 transitions, 286 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 14:23:20,366 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 220 flow [2024-06-14 14:23:20,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-06-14 14:23:20,367 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2024-06-14 14:23:20,367 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 220 flow [2024-06-14 14:23:20,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:20,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:20,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:20,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 14:23:20,367 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:20,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:20,368 INFO L85 PathProgramCache]: Analyzing trace with hash -103213844, now seen corresponding path program 1 times [2024-06-14 14:23:20,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:20,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281014533] [2024-06-14 14:23:20,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:20,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:25,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281014533] [2024-06-14 14:23:25,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281014533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:25,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:25,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:23:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065243147] [2024-06-14 14:23:25,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:25,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:23:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:25,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:23:25,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:23:26,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:23:26,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 220 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:26,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:26,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:23:26,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:26,325 INFO L124 PetriNetUnfolderBase]: 186/345 cut-off events. [2024-06-14 14:23:26,325 INFO L125 PetriNetUnfolderBase]: For 1550/1550 co-relation queries the response was YES. [2024-06-14 14:23:26,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 345 events. 186/345 cut-off events. For 1550/1550 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1258 event pairs, 44 based on Foata normal form. 1/344 useless extension candidates. Maximal degree in co-relation 1292. Up to 299 conditions per place. [2024-06-14 14:23:26,328 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 42 selfloop transitions, 17 changer transitions 0/62 dead transitions. [2024-06-14 14:23:26,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 425 flow [2024-06-14 14:23:26,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:23:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:23:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-14 14:23:26,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-14 14:23:26,331 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 220 flow. Second operand 8 states and 102 transitions. [2024-06-14 14:23:26,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 425 flow [2024-06-14 14:23:26,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 399 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 14:23:26,334 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 312 flow [2024-06-14 14:23:26,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=312, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2024-06-14 14:23:26,336 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2024-06-14 14:23:26,337 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 312 flow [2024-06-14 14:23:26,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:26,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:26,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:26,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 14:23:26,338 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:26,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1087242412, now seen corresponding path program 2 times [2024-06-14 14:23:26,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:26,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823804716] [2024-06-14 14:23:26,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:26,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:31,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:31,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823804716] [2024-06-14 14:23:31,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823804716] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:31,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:31,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:23:31,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163317820] [2024-06-14 14:23:31,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:31,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:23:31,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:31,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:23:31,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:23:31,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:23:31,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 312 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:31,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:31,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:23:31,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:32,244 INFO L124 PetriNetUnfolderBase]: 192/357 cut-off events. [2024-06-14 14:23:32,244 INFO L125 PetriNetUnfolderBase]: For 2026/2026 co-relation queries the response was YES. [2024-06-14 14:23:32,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 357 events. 192/357 cut-off events. For 2026/2026 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1326 event pairs, 43 based on Foata normal form. 2/357 useless extension candidates. Maximal degree in co-relation 1435. Up to 299 conditions per place. [2024-06-14 14:23:32,246 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 43 selfloop transitions, 18 changer transitions 0/64 dead transitions. [2024-06-14 14:23:32,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 480 flow [2024-06-14 14:23:32,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-14 14:23:32,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-14 14:23:32,248 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 312 flow. Second operand 7 states and 92 transitions. [2024-06-14 14:23:32,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 480 flow [2024-06-14 14:23:32,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 456 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 14:23:32,251 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 350 flow [2024-06-14 14:23:32,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=350, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-06-14 14:23:32,251 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 32 predicate places. [2024-06-14 14:23:32,251 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 350 flow [2024-06-14 14:23:32,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:32,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:32,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:32,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 14:23:32,252 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:32,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:32,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1153185446, now seen corresponding path program 3 times [2024-06-14 14:23:32,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:32,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023811622] [2024-06-14 14:23:32,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:32,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:37,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:37,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023811622] [2024-06-14 14:23:37,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023811622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:37,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:37,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:23:37,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636633891] [2024-06-14 14:23:37,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:37,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:23:37,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:37,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:23:37,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:23:37,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:23:37,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 350 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:37,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:37,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:23:37,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:37,910 INFO L124 PetriNetUnfolderBase]: 195/362 cut-off events. [2024-06-14 14:23:37,910 INFO L125 PetriNetUnfolderBase]: For 2459/2459 co-relation queries the response was YES. [2024-06-14 14:23:37,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 362 events. 195/362 cut-off events. For 2459/2459 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1345 event pairs, 45 based on Foata normal form. 1/361 useless extension candidates. Maximal degree in co-relation 1540. Up to 301 conditions per place. [2024-06-14 14:23:37,913 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 42 selfloop transitions, 20 changer transitions 0/65 dead transitions. [2024-06-14 14:23:37,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 531 flow [2024-06-14 14:23:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-14 14:23:37,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2024-06-14 14:23:37,914 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 350 flow. Second operand 7 states and 90 transitions. [2024-06-14 14:23:37,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 531 flow [2024-06-14 14:23:37,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 65 transitions, 486 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 14:23:37,918 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 404 flow [2024-06-14 14:23:37,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=404, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-06-14 14:23:37,919 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-14 14:23:37,919 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 404 flow [2024-06-14 14:23:37,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:37,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:37,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:37,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 14:23:37,921 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:37,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:37,921 INFO L85 PathProgramCache]: Analyzing trace with hash 75391297, now seen corresponding path program 1 times [2024-06-14 14:23:37,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:37,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599052985] [2024-06-14 14:23:37,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:37,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:44,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:44,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599052985] [2024-06-14 14:23:44,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599052985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:44,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:44,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:23:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915943600] [2024-06-14 14:23:44,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:44,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:23:44,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:44,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:23:44,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:23:44,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:23:44,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 404 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:44,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:44,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:23:44,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:44,535 INFO L124 PetriNetUnfolderBase]: 198/367 cut-off events. [2024-06-14 14:23:44,535 INFO L125 PetriNetUnfolderBase]: For 2889/2889 co-relation queries the response was YES. [2024-06-14 14:23:44,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 367 events. 198/367 cut-off events. For 2889/2889 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1364 event pairs, 42 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 1628. Up to 330 conditions per place. [2024-06-14 14:23:44,538 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 51 selfloop transitions, 13 changer transitions 0/67 dead transitions. [2024-06-14 14:23:44,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 562 flow [2024-06-14 14:23:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2024-06-14 14:23:44,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2024-06-14 14:23:44,540 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 404 flow. Second operand 7 states and 88 transitions. [2024-06-14 14:23:44,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 562 flow [2024-06-14 14:23:44,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 532 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-14 14:23:44,543 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 419 flow [2024-06-14 14:23:44,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=419, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2024-06-14 14:23:44,543 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2024-06-14 14:23:44,544 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 419 flow [2024-06-14 14:23:44,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:44,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:44,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:44,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 14:23:44,544 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:44,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:44,545 INFO L85 PathProgramCache]: Analyzing trace with hash 80955270, now seen corresponding path program 4 times [2024-06-14 14:23:44,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:44,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533229555] [2024-06-14 14:23:44,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:44,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:50,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:50,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:50,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533229555] [2024-06-14 14:23:50,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533229555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:50,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:50,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:23:50,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645851735] [2024-06-14 14:23:50,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:50,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:23:50,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:50,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:23:50,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:23:50,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:23:50,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 419 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:50,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:50,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:23:50,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:50,958 INFO L124 PetriNetUnfolderBase]: 204/382 cut-off events. [2024-06-14 14:23:50,958 INFO L125 PetriNetUnfolderBase]: For 3396/3396 co-relation queries the response was YES. [2024-06-14 14:23:50,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 382 events. 204/382 cut-off events. For 3396/3396 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1475 event pairs, 50 based on Foata normal form. 2/379 useless extension candidates. Maximal degree in co-relation 1758. Up to 295 conditions per place. [2024-06-14 14:23:50,962 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 43 selfloop transitions, 25 changer transitions 0/71 dead transitions. [2024-06-14 14:23:50,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 645 flow [2024-06-14 14:23:50,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-14 14:23:50,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-14 14:23:50,963 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 419 flow. Second operand 7 states and 92 transitions. [2024-06-14 14:23:50,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 645 flow [2024-06-14 14:23:50,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 71 transitions, 616 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 14:23:50,967 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 489 flow [2024-06-14 14:23:50,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=489, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2024-06-14 14:23:50,968 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2024-06-14 14:23:50,969 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 489 flow [2024-06-14 14:23:50,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:50,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:50,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:50,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 14:23:50,969 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:50,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:50,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1294045799, now seen corresponding path program 2 times [2024-06-14 14:23:50,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:50,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059711451] [2024-06-14 14:23:50,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:50,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:57,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059711451] [2024-06-14 14:23:57,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059711451] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:57,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:57,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:23:57,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911884399] [2024-06-14 14:23:57,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:57,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:23:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:57,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:23:57,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:23:58,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:23:58,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 489 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:58,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:58,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:23:58,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:58,310 INFO L124 PetriNetUnfolderBase]: 207/387 cut-off events. [2024-06-14 14:23:58,310 INFO L125 PetriNetUnfolderBase]: For 3890/3890 co-relation queries the response was YES. [2024-06-14 14:23:58,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 387 events. 207/387 cut-off events. For 3890/3890 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1488 event pairs, 45 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 1867. Up to 339 conditions per place. [2024-06-14 14:23:58,313 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 52 selfloop transitions, 16 changer transitions 0/71 dead transitions. [2024-06-14 14:23:58,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 71 transitions, 653 flow [2024-06-14 14:23:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-14 14:23:58,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38839285714285715 [2024-06-14 14:23:58,314 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 489 flow. Second operand 7 states and 87 transitions. [2024-06-14 14:23:58,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 71 transitions, 653 flow [2024-06-14 14:23:58,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 71 transitions, 624 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 14:23:58,319 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 515 flow [2024-06-14 14:23:58,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=515, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2024-06-14 14:23:58,320 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2024-06-14 14:23:58,320 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 515 flow [2024-06-14 14:23:58,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:58,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:58,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:58,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 14:23:58,321 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:58,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1294312709, now seen corresponding path program 3 times [2024-06-14 14:23:58,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:58,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595352613] [2024-06-14 14:23:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:58,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:04,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:04,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595352613] [2024-06-14 14:24:04,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595352613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:04,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:04,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:24:04,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737456605] [2024-06-14 14:24:04,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:04,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:24:04,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:04,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:24:04,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:24:04,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:24:04,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 515 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:04,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:04,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:24:04,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:04,875 INFO L124 PetriNetUnfolderBase]: 205/384 cut-off events. [2024-06-14 14:24:04,875 INFO L125 PetriNetUnfolderBase]: For 4158/4158 co-relation queries the response was YES. [2024-06-14 14:24:04,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 384 events. 205/384 cut-off events. For 4158/4158 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1472 event pairs, 45 based on Foata normal form. 1/381 useless extension candidates. Maximal degree in co-relation 1911. Up to 327 conditions per place. [2024-06-14 14:24:04,878 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 51 selfloop transitions, 21 changer transitions 0/75 dead transitions. [2024-06-14 14:24:04,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 75 transitions, 701 flow [2024-06-14 14:24:04,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:24:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:24:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-14 14:24:04,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42410714285714285 [2024-06-14 14:24:04,879 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 515 flow. Second operand 7 states and 95 transitions. [2024-06-14 14:24:04,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 75 transitions, 701 flow [2024-06-14 14:24:04,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 662 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 14:24:04,884 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 566 flow [2024-06-14 14:24:04,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=566, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2024-06-14 14:24:04,885 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 48 predicate places. [2024-06-14 14:24:04,885 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 566 flow [2024-06-14 14:24:04,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:04,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:04,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:04,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 14:24:04,886 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:04,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:04,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1294322629, now seen corresponding path program 1 times [2024-06-14 14:24:04,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:04,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218176775] [2024-06-14 14:24:04,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:04,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:12,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:12,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218176775] [2024-06-14 14:24:12,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218176775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:12,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:12,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:24:12,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799646840] [2024-06-14 14:24:12,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:12,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:24:12,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:12,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:24:12,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:24:12,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 14:24:12,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 566 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:12,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:12,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 14:24:12,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:12,733 INFO L124 PetriNetUnfolderBase]: 188/363 cut-off events. [2024-06-14 14:24:12,733 INFO L125 PetriNetUnfolderBase]: For 4468/4472 co-relation queries the response was YES. [2024-06-14 14:24:12,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1884 conditions, 363 events. 188/363 cut-off events. For 4468/4472 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1429 event pairs, 42 based on Foata normal form. 5/365 useless extension candidates. Maximal degree in co-relation 1844. Up to 309 conditions per place. [2024-06-14 14:24:12,736 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 55 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2024-06-14 14:24:12,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 78 transitions, 724 flow [2024-06-14 14:24:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:24:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:24:12,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2024-06-14 14:24:12,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45089285714285715 [2024-06-14 14:24:12,738 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 566 flow. Second operand 7 states and 101 transitions. [2024-06-14 14:24:12,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 78 transitions, 724 flow [2024-06-14 14:24:12,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 78 transitions, 693 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 14:24:12,743 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 576 flow [2024-06-14 14:24:12,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2024-06-14 14:24:12,743 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 52 predicate places. [2024-06-14 14:24:12,743 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 576 flow [2024-06-14 14:24:12,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:12,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:12,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:12,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 14:24:12,744 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:12,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1962604071, now seen corresponding path program 1 times [2024-06-14 14:24:12,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:12,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245313260] [2024-06-14 14:24:12,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:12,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:19,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:19,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245313260] [2024-06-14 14:24:19,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245313260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:19,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:19,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:19,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184528049] [2024-06-14 14:24:19,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:19,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:19,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:19,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:19,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:19,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:24:19,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 576 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:19,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:19,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:24:19,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:20,201 INFO L124 PetriNetUnfolderBase]: 201/377 cut-off events. [2024-06-14 14:24:20,201 INFO L125 PetriNetUnfolderBase]: For 4767/4767 co-relation queries the response was YES. [2024-06-14 14:24:20,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2026 conditions, 377 events. 201/377 cut-off events. For 4767/4767 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1446 event pairs, 40 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 1985. Up to 310 conditions per place. [2024-06-14 14:24:20,204 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 65 selfloop transitions, 19 changer transitions 0/87 dead transitions. [2024-06-14 14:24:20,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 87 transitions, 808 flow [2024-06-14 14:24:20,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-14 14:24:20,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 14:24:20,205 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 576 flow. Second operand 8 states and 104 transitions. [2024-06-14 14:24:20,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 87 transitions, 808 flow [2024-06-14 14:24:20,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 87 transitions, 761 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 14:24:20,211 INFO L231 Difference]: Finished difference. Result has 85 places, 73 transitions, 600 flow [2024-06-14 14:24:20,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=600, PETRI_PLACES=85, PETRI_TRANSITIONS=73} [2024-06-14 14:24:20,211 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2024-06-14 14:24:20,212 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 73 transitions, 600 flow [2024-06-14 14:24:20,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:20,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:20,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:20,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 14:24:20,212 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:20,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1962483915, now seen corresponding path program 1 times [2024-06-14 14:24:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:20,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973234442] [2024-06-14 14:24:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:20,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:27,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:27,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:27,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973234442] [2024-06-14 14:24:27,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973234442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:27,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:27,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:27,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763899177] [2024-06-14 14:24:27,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:27,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:27,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:27,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:27,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:27,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:24:27,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 73 transitions, 600 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:27,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:27,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:24:27,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:27,911 INFO L124 PetriNetUnfolderBase]: 207/387 cut-off events. [2024-06-14 14:24:27,911 INFO L125 PetriNetUnfolderBase]: For 5498/5498 co-relation queries the response was YES. [2024-06-14 14:24:27,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2125 conditions, 387 events. 207/387 cut-off events. For 5498/5498 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1491 event pairs, 39 based on Foata normal form. 2/387 useless extension candidates. Maximal degree in co-relation 2083. Up to 317 conditions per place. [2024-06-14 14:24:27,914 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 62 selfloop transitions, 22 changer transitions 0/87 dead transitions. [2024-06-14 14:24:27,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 87 transitions, 822 flow [2024-06-14 14:24:27,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-14 14:24:27,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37109375 [2024-06-14 14:24:27,916 INFO L175 Difference]: Start difference. First operand has 85 places, 73 transitions, 600 flow. Second operand 8 states and 95 transitions. [2024-06-14 14:24:27,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 87 transitions, 822 flow [2024-06-14 14:24:27,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 87 transitions, 767 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 14:24:27,922 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 629 flow [2024-06-14 14:24:27,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=629, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2024-06-14 14:24:27,922 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-14 14:24:27,923 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 629 flow [2024-06-14 14:24:27,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:27,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:27,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:27,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 14:24:27,923 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:27,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:27,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1957842285, now seen corresponding path program 2 times [2024-06-14 14:24:27,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:27,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403365272] [2024-06-14 14:24:27,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:27,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:33,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:33,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:33,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403365272] [2024-06-14 14:24:33,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403365272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:33,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:33,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:33,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302895050] [2024-06-14 14:24:33,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:33,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:33,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:33,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:34,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:24:34,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 629 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:34,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:34,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:24:34,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:34,381 INFO L124 PetriNetUnfolderBase]: 214/399 cut-off events. [2024-06-14 14:24:34,381 INFO L125 PetriNetUnfolderBase]: For 6189/6189 co-relation queries the response was YES. [2024-06-14 14:24:34,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2261 conditions, 399 events. 214/399 cut-off events. For 6189/6189 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1544 event pairs, 41 based on Foata normal form. 2/399 useless extension candidates. Maximal degree in co-relation 2218. Up to 318 conditions per place. [2024-06-14 14:24:34,384 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 62 selfloop transitions, 24 changer transitions 0/89 dead transitions. [2024-06-14 14:24:34,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 89 transitions, 895 flow [2024-06-14 14:24:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-14 14:24:34,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 14:24:34,386 INFO L175 Difference]: Start difference. First operand has 87 places, 76 transitions, 629 flow. Second operand 8 states and 104 transitions. [2024-06-14 14:24:34,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 89 transitions, 895 flow [2024-06-14 14:24:34,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 89 transitions, 837 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 14:24:34,393 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 664 flow [2024-06-14 14:24:34,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=664, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2024-06-14 14:24:34,393 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-06-14 14:24:34,393 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 664 flow [2024-06-14 14:24:34,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:34,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:34,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:34,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 14:24:34,394 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:34,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:34,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1388414467, now seen corresponding path program 2 times [2024-06-14 14:24:34,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:34,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892069515] [2024-06-14 14:24:34,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:34,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:40,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:40,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892069515] [2024-06-14 14:24:40,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892069515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:40,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:40,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:40,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513026590] [2024-06-14 14:24:40,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:40,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:40,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:40,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:40,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:40,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:24:40,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 664 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:40,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:40,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:24:40,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:40,824 INFO L124 PetriNetUnfolderBase]: 211/394 cut-off events. [2024-06-14 14:24:40,824 INFO L125 PetriNetUnfolderBase]: For 6629/6629 co-relation queries the response was YES. [2024-06-14 14:24:40,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 394 events. 211/394 cut-off events. For 6629/6629 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1527 event pairs, 41 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 2232. Up to 321 conditions per place. [2024-06-14 14:24:40,827 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 63 selfloop transitions, 22 changer transitions 0/88 dead transitions. [2024-06-14 14:24:40,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 88 transitions, 856 flow [2024-06-14 14:24:40,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-14 14:24:40,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-14 14:24:40,829 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 664 flow. Second operand 8 states and 101 transitions. [2024-06-14 14:24:40,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 88 transitions, 856 flow [2024-06-14 14:24:40,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 88 transitions, 761 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-14 14:24:40,835 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 618 flow [2024-06-14 14:24:40,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=618, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2024-06-14 14:24:40,836 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 60 predicate places. [2024-06-14 14:24:40,836 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 618 flow [2024-06-14 14:24:40,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:40,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:40,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:40,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 14:24:40,837 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:40,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash -444048529, now seen corresponding path program 3 times [2024-06-14 14:24:40,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:40,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277742562] [2024-06-14 14:24:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:40,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:48,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:48,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277742562] [2024-06-14 14:24:48,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277742562] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:48,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:48,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:48,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6360099] [2024-06-14 14:24:48,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:48,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:48,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:48,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:48,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:48,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:24:48,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 618 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:48,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:48,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:24:48,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:48,514 INFO L124 PetriNetUnfolderBase]: 214/399 cut-off events. [2024-06-14 14:24:48,515 INFO L125 PetriNetUnfolderBase]: For 7068/7068 co-relation queries the response was YES. [2024-06-14 14:24:48,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 399 events. 214/399 cut-off events. For 7068/7068 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1544 event pairs, 41 based on Foata normal form. 1/398 useless extension candidates. Maximal degree in co-relation 2234. Up to 306 conditions per place. [2024-06-14 14:24:48,518 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 57 selfloop transitions, 30 changer transitions 0/90 dead transitions. [2024-06-14 14:24:48,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 90 transitions, 838 flow [2024-06-14 14:24:48,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 14:24:48,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2024-06-14 14:24:48,519 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 618 flow. Second operand 8 states and 103 transitions. [2024-06-14 14:24:48,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 90 transitions, 838 flow [2024-06-14 14:24:48,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 791 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 14:24:48,526 INFO L231 Difference]: Finished difference. Result has 92 places, 81 transitions, 664 flow [2024-06-14 14:24:48,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=664, PETRI_PLACES=92, PETRI_TRANSITIONS=81} [2024-06-14 14:24:48,527 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 61 predicate places. [2024-06-14 14:24:48,527 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 81 transitions, 664 flow [2024-06-14 14:24:48,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:48,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:48,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:48,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 14:24:48,528 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:48,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:48,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1388407523, now seen corresponding path program 1 times [2024-06-14 14:24:48,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:48,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707604797] [2024-06-14 14:24:48,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:48,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:55,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:55,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707604797] [2024-06-14 14:24:55,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707604797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:55,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:55,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:55,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382647854] [2024-06-14 14:24:55,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:55,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:55,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:55,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:55,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:55,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:24:55,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 81 transitions, 664 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:55,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:55,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:24:55,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:56,219 INFO L124 PetriNetUnfolderBase]: 220/409 cut-off events. [2024-06-14 14:24:56,219 INFO L125 PetriNetUnfolderBase]: For 7982/7982 co-relation queries the response was YES. [2024-06-14 14:24:56,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2407 conditions, 409 events. 220/409 cut-off events. For 7982/7982 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1599 event pairs, 38 based on Foata normal form. 2/409 useless extension candidates. Maximal degree in co-relation 2361. Up to 362 conditions per place. [2024-06-14 14:24:56,222 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 75 selfloop transitions, 15 changer transitions 0/93 dead transitions. [2024-06-14 14:24:56,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 93 transitions, 888 flow [2024-06-14 14:24:56,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 14:24:56,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38671875 [2024-06-14 14:24:56,224 INFO L175 Difference]: Start difference. First operand has 92 places, 81 transitions, 664 flow. Second operand 8 states and 99 transitions. [2024-06-14 14:24:56,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 93 transitions, 888 flow [2024-06-14 14:24:56,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 93 transitions, 811 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 14:24:56,231 INFO L231 Difference]: Finished difference. Result has 94 places, 83 transitions, 644 flow [2024-06-14 14:24:56,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=644, PETRI_PLACES=94, PETRI_TRANSITIONS=83} [2024-06-14 14:24:56,232 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 63 predicate places. [2024-06-14 14:24:56,232 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 83 transitions, 644 flow [2024-06-14 14:24:56,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:56,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:56,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:56,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 14:24:56,232 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:56,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:56,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1460708909, now seen corresponding path program 4 times [2024-06-14 14:24:56,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:56,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842183799] [2024-06-14 14:24:56,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:56,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:02,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-14 14:25:02,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:02,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842183799] [2024-06-14 14:25:02,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842183799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:02,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:02,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:25:02,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567650167] [2024-06-14 14:25:02,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:02,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:25:02,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:02,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:25:02,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:25:02,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:25:02,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 83 transitions, 644 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:02,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:02,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:25:02,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:02,678 INFO L124 PetriNetUnfolderBase]: 226/420 cut-off events. [2024-06-14 14:25:02,678 INFO L125 PetriNetUnfolderBase]: For 8641/8641 co-relation queries the response was YES. [2024-06-14 14:25:02,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2485 conditions, 420 events. 226/420 cut-off events. For 8641/8641 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1668 event pairs, 46 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 2438. Up to 328 conditions per place. [2024-06-14 14:25:02,681 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 63 selfloop transitions, 28 changer transitions 0/94 dead transitions. [2024-06-14 14:25:02,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 94 transitions, 898 flow [2024-06-14 14:25:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:25:02,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:25:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-14 14:25:02,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 14:25:02,683 INFO L175 Difference]: Start difference. First operand has 94 places, 83 transitions, 644 flow. Second operand 8 states and 94 transitions. [2024-06-14 14:25:02,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 94 transitions, 898 flow [2024-06-14 14:25:02,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 94 transitions, 857 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 14:25:02,691 INFO L231 Difference]: Finished difference. Result has 96 places, 86 transitions, 713 flow [2024-06-14 14:25:02,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=713, PETRI_PLACES=96, PETRI_TRANSITIONS=86} [2024-06-14 14:25:02,691 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 65 predicate places. [2024-06-14 14:25:02,691 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 86 transitions, 713 flow [2024-06-14 14:25:02,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:02,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:02,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:02,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 14:25:02,692 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:02,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:02,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1460715419, now seen corresponding path program 5 times [2024-06-14 14:25:02,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:02,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673939274] [2024-06-14 14:25:02,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:02,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:10,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:10,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673939274] [2024-06-14 14:25:10,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673939274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:10,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:10,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:25:10,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507164841] [2024-06-14 14:25:10,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:10,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:25:10,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:10,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:25:10,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:25:10,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:25:10,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 86 transitions, 713 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:10,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:10,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:25:10,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:10,587 INFO L124 PetriNetUnfolderBase]: 229/425 cut-off events. [2024-06-14 14:25:10,587 INFO L125 PetriNetUnfolderBase]: For 9296/9296 co-relation queries the response was YES. [2024-06-14 14:25:10,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2608 conditions, 425 events. 229/425 cut-off events. For 9296/9296 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1700 event pairs, 46 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 2560. Up to 327 conditions per place. [2024-06-14 14:25:10,590 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 62 selfloop transitions, 31 changer transitions 0/96 dead transitions. [2024-06-14 14:25:10,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 96 transitions, 963 flow [2024-06-14 14:25:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:25:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:25:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-14 14:25:10,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 14:25:10,591 INFO L175 Difference]: Start difference. First operand has 96 places, 86 transitions, 713 flow. Second operand 8 states and 104 transitions. [2024-06-14 14:25:10,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 96 transitions, 963 flow [2024-06-14 14:25:10,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 96 transitions, 875 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 14:25:10,604 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 728 flow [2024-06-14 14:25:10,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=728, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2024-06-14 14:25:10,605 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-14 14:25:10,605 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 88 transitions, 728 flow [2024-06-14 14:25:10,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:10,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:10,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:10,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 14:25:10,606 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:10,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1785345637, now seen corresponding path program 2 times [2024-06-14 14:25:10,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:10,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996495625] [2024-06-14 14:25:10,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:18,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:18,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996495625] [2024-06-14 14:25:18,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996495625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:18,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:18,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:25:18,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229055121] [2024-06-14 14:25:18,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:18,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:25:18,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:18,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:25:18,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:25:18,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:25:18,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 88 transitions, 728 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:18,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:18,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:25:18,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:19,128 INFO L124 PetriNetUnfolderBase]: 232/430 cut-off events. [2024-06-14 14:25:19,128 INFO L125 PetriNetUnfolderBase]: For 10016/10016 co-relation queries the response was YES. [2024-06-14 14:25:19,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2658 conditions, 430 events. 232/430 cut-off events. For 10016/10016 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1715 event pairs, 41 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 2609. Up to 379 conditions per place. [2024-06-14 14:25:19,132 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 76 selfloop transitions, 18 changer transitions 0/97 dead transitions. [2024-06-14 14:25:19,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 97 transitions, 952 flow [2024-06-14 14:25:19,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:25:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:25:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 14:25:19,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37890625 [2024-06-14 14:25:19,133 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 728 flow. Second operand 8 states and 97 transitions. [2024-06-14 14:25:19,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 97 transitions, 952 flow [2024-06-14 14:25:19,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 97 transitions, 865 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-14 14:25:19,142 INFO L231 Difference]: Finished difference. Result has 100 places, 90 transitions, 706 flow [2024-06-14 14:25:19,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=706, PETRI_PLACES=100, PETRI_TRANSITIONS=90} [2024-06-14 14:25:19,142 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 69 predicate places. [2024-06-14 14:25:19,142 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 90 transitions, 706 flow [2024-06-14 14:25:19,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:19,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:19,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:19,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 14:25:19,143 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:19,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:19,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1785115245, now seen corresponding path program 6 times [2024-06-14 14:25:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:19,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161525145] [2024-06-14 14:25:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:25,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:25,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161525145] [2024-06-14 14:25:25,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161525145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:25,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:25,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:25:25,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101268933] [2024-06-14 14:25:25,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:25,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:25:25,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:25,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:25:25,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:25:25,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:25:25,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 706 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:25,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:25,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:25:25,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:26,225 INFO L124 PetriNetUnfolderBase]: 230/427 cut-off events. [2024-06-14 14:25:26,226 INFO L125 PetriNetUnfolderBase]: For 10193/10193 co-relation queries the response was YES. [2024-06-14 14:25:26,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 427 events. 230/427 cut-off events. For 10193/10193 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1703 event pairs, 45 based on Foata normal form. 1/423 useless extension candidates. Maximal degree in co-relation 2563. Up to 300 conditions per place. [2024-06-14 14:25:26,229 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 53 selfloop transitions, 44 changer transitions 0/100 dead transitions. [2024-06-14 14:25:26,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 100 transitions, 970 flow [2024-06-14 14:25:26,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:25:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:25:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 14:25:26,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2024-06-14 14:25:26,230 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 706 flow. Second operand 8 states and 103 transitions. [2024-06-14 14:25:26,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 100 transitions, 970 flow [2024-06-14 14:25:26,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 100 transitions, 921 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 14:25:26,240 INFO L231 Difference]: Finished difference. Result has 102 places, 92 transitions, 790 flow [2024-06-14 14:25:26,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=790, PETRI_PLACES=102, PETRI_TRANSITIONS=92} [2024-06-14 14:25:26,240 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 71 predicate places. [2024-06-14 14:25:26,240 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 92 transitions, 790 flow [2024-06-14 14:25:26,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:26,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:26,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:26,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 14:25:26,241 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:26,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:26,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1785114997, now seen corresponding path program 3 times [2024-06-14 14:25:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:26,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847998124] [2024-06-14 14:25:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:32,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:32,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847998124] [2024-06-14 14:25:32,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847998124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:32,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:32,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:25:32,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974130243] [2024-06-14 14:25:32,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:32,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:25:32,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:32,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:25:32,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:25:33,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:25:33,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 790 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:33,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:33,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:25:33,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:33,388 INFO L124 PetriNetUnfolderBase]: 233/432 cut-off events. [2024-06-14 14:25:33,389 INFO L125 PetriNetUnfolderBase]: For 10958/10958 co-relation queries the response was YES. [2024-06-14 14:25:33,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2747 conditions, 432 events. 233/432 cut-off events. For 10958/10958 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1721 event pairs, 40 based on Foata normal form. 1/429 useless extension candidates. Maximal degree in co-relation 2696. Up to 359 conditions per place. [2024-06-14 14:25:33,392 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 75 selfloop transitions, 28 changer transitions 0/106 dead transitions. [2024-06-14 14:25:33,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 106 transitions, 1126 flow [2024-06-14 14:25:33,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:25:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:25:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-14 14:25:33,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-14 14:25:33,410 INFO L175 Difference]: Start difference. First operand has 102 places, 92 transitions, 790 flow. Second operand 8 states and 101 transitions. [2024-06-14 14:25:33,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 106 transitions, 1126 flow [2024-06-14 14:25:33,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 106 transitions, 1009 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-14 14:25:33,420 INFO L231 Difference]: Finished difference. Result has 105 places, 98 transitions, 810 flow [2024-06-14 14:25:33,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=810, PETRI_PLACES=105, PETRI_TRANSITIONS=98} [2024-06-14 14:25:33,425 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 74 predicate places. [2024-06-14 14:25:33,425 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 98 transitions, 810 flow [2024-06-14 14:25:33,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:33,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:33,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:33,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 14:25:33,426 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:33,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:33,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1469286547, now seen corresponding path program 4 times [2024-06-14 14:25:33,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:33,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696097690] [2024-06-14 14:25:33,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:33,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:39,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:39,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696097690] [2024-06-14 14:25:39,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696097690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:39,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:39,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:25:39,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128618460] [2024-06-14 14:25:39,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:39,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:25:39,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:39,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:25:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:25:39,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:25:39,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 98 transitions, 810 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:39,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:39,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:25:39,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:40,213 INFO L124 PetriNetUnfolderBase]: 234/433 cut-off events. [2024-06-14 14:25:40,213 INFO L125 PetriNetUnfolderBase]: For 11593/11593 co-relation queries the response was YES. [2024-06-14 14:25:40,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2735 conditions, 433 events. 234/433 cut-off events. For 11593/11593 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1706 event pairs, 40 based on Foata normal form. 2/433 useless extension candidates. Maximal degree in co-relation 2682. Up to 391 conditions per place. [2024-06-14 14:25:40,218 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 90 selfloop transitions, 14 changer transitions 0/107 dead transitions. [2024-06-14 14:25:40,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 107 transitions, 1060 flow [2024-06-14 14:25:40,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:25:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:25:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 14:25:40,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37890625 [2024-06-14 14:25:40,221 INFO L175 Difference]: Start difference. First operand has 105 places, 98 transitions, 810 flow. Second operand 8 states and 97 transitions. [2024-06-14 14:25:40,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 107 transitions, 1060 flow [2024-06-14 14:25:40,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 1005 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-14 14:25:40,232 INFO L231 Difference]: Finished difference. Result has 110 places, 100 transitions, 820 flow [2024-06-14 14:25:40,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=820, PETRI_PLACES=110, PETRI_TRANSITIONS=100} [2024-06-14 14:25:40,232 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 79 predicate places. [2024-06-14 14:25:40,233 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 100 transitions, 820 flow [2024-06-14 14:25:40,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:40,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:40,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:40,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 14:25:40,233 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:40,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:40,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1469297459, now seen corresponding path program 1 times [2024-06-14 14:25:40,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:40,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134196776] [2024-06-14 14:25:40,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:40,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:48,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:48,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134196776] [2024-06-14 14:25:48,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134196776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:48,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:48,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:25:48,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777913963] [2024-06-14 14:25:48,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:48,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:25:48,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:48,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:25:48,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:25:48,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:25:48,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 100 transitions, 820 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:48,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:48,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:25:48,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:48,853 INFO L124 PetriNetUnfolderBase]: 218/413 cut-off events. [2024-06-14 14:25:48,854 INFO L125 PetriNetUnfolderBase]: For 11452/11456 co-relation queries the response was YES. [2024-06-14 14:25:48,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 413 events. 218/413 cut-off events. For 11452/11456 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1662 event pairs, 37 based on Foata normal form. 6/416 useless extension candidates. Maximal degree in co-relation 2535. Up to 339 conditions per place. [2024-06-14 14:25:48,857 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 78 selfloop transitions, 13 changer transitions 0/109 dead transitions. [2024-06-14 14:25:48,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 1022 flow [2024-06-14 14:25:48,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:25:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:25:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 14:25:48,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 14:25:48,858 INFO L175 Difference]: Start difference. First operand has 110 places, 100 transitions, 820 flow. Second operand 9 states and 112 transitions. [2024-06-14 14:25:48,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 1022 flow [2024-06-14 14:25:48,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 977 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-14 14:25:48,868 INFO L231 Difference]: Finished difference. Result has 113 places, 100 transitions, 805 flow [2024-06-14 14:25:48,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=805, PETRI_PLACES=113, PETRI_TRANSITIONS=100} [2024-06-14 14:25:48,869 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 82 predicate places. [2024-06-14 14:25:48,869 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 805 flow [2024-06-14 14:25:48,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:48,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:48,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:48,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 14:25:48,869 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:48,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash -711182526, now seen corresponding path program 1 times [2024-06-14 14:25:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887205994] [2024-06-14 14:25:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:48,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:57,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:57,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887205994] [2024-06-14 14:25:57,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887205994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:57,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:57,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:25:57,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351488292] [2024-06-14 14:25:57,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:57,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:25:57,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:57,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:25:57,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:25:57,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:25:57,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 100 transitions, 805 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:57,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:57,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:25:57,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:57,659 INFO L124 PetriNetUnfolderBase]: 234/435 cut-off events. [2024-06-14 14:25:57,660 INFO L125 PetriNetUnfolderBase]: For 11697/11697 co-relation queries the response was YES. [2024-06-14 14:25:57,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 435 events. 234/435 cut-off events. For 11697/11697 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1728 event pairs, 35 based on Foata normal form. 1/434 useless extension candidates. Maximal degree in co-relation 2699. Up to 363 conditions per place. [2024-06-14 14:25:57,662 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 93 selfloop transitions, 21 changer transitions 0/117 dead transitions. [2024-06-14 14:25:57,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 1111 flow [2024-06-14 14:25:57,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:25:57,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:25:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 14:25:57,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 14:25:57,663 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 805 flow. Second operand 9 states and 114 transitions. [2024-06-14 14:25:57,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 1111 flow [2024-06-14 14:25:57,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 117 transitions, 1079 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 14:25:57,673 INFO L231 Difference]: Finished difference. Result has 115 places, 102 transitions, 860 flow [2024-06-14 14:25:57,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=860, PETRI_PLACES=115, PETRI_TRANSITIONS=102} [2024-06-14 14:25:57,674 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-14 14:25:57,674 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 102 transitions, 860 flow [2024-06-14 14:25:57,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:57,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:57,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:57,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 14:25:57,674 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:57,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash -707457659, now seen corresponding path program 1 times [2024-06-14 14:25:57,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:57,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093097267] [2024-06-14 14:25:57,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:57,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:06,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:06,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093097267] [2024-06-14 14:26:06,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093097267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:06,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:06,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:26:06,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938673782] [2024-06-14 14:26:06,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:06,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:26:06,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:06,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:26:06,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:26:06,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:26:06,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 102 transitions, 860 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:06,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:06,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:26:06,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:06,535 INFO L124 PetriNetUnfolderBase]: 240/445 cut-off events. [2024-06-14 14:26:06,535 INFO L125 PetriNetUnfolderBase]: For 13118/13118 co-relation queries the response was YES. [2024-06-14 14:26:06,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2884 conditions, 445 events. 240/445 cut-off events. For 13118/13118 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1788 event pairs, 34 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 2827. Up to 367 conditions per place. [2024-06-14 14:26:06,538 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 89 selfloop transitions, 25 changer transitions 0/117 dead transitions. [2024-06-14 14:26:06,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 1164 flow [2024-06-14 14:26:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:26:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:26:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 14:26:06,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 14:26:06,549 INFO L175 Difference]: Start difference. First operand has 115 places, 102 transitions, 860 flow. Second operand 9 states and 114 transitions. [2024-06-14 14:26:06,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 1164 flow [2024-06-14 14:26:06,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 1093 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 14:26:06,563 INFO L231 Difference]: Finished difference. Result has 117 places, 105 transitions, 897 flow [2024-06-14 14:26:06,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=897, PETRI_PLACES=117, PETRI_TRANSITIONS=105} [2024-06-14 14:26:06,563 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 86 predicate places. [2024-06-14 14:26:06,563 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 105 transitions, 897 flow [2024-06-14 14:26:06,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:06,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:06,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:06,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 14:26:06,564 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:06,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:06,564 INFO L85 PathProgramCache]: Analyzing trace with hash -96530786, now seen corresponding path program 2 times [2024-06-14 14:26:06,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:06,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766901786] [2024-06-14 14:26:06,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:06,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:16,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:16,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766901786] [2024-06-14 14:26:16,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766901786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:16,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:16,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:26:16,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026624745] [2024-06-14 14:26:16,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:16,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:26:16,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:16,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:26:16,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:26:16,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:26:16,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 105 transitions, 897 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:16,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:16,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:26:16,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:16,568 INFO L124 PetriNetUnfolderBase]: 243/452 cut-off events. [2024-06-14 14:26:16,568 INFO L125 PetriNetUnfolderBase]: For 13758/13758 co-relation queries the response was YES. [2024-06-14 14:26:16,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 452 events. 243/452 cut-off events. For 13758/13758 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1834 event pairs, 34 based on Foata normal form. 1/451 useless extension candidates. Maximal degree in co-relation 2929. Up to 375 conditions per place. [2024-06-14 14:26:16,571 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 92 selfloop transitions, 24 changer transitions 0/119 dead transitions. [2024-06-14 14:26:16,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 119 transitions, 1201 flow [2024-06-14 14:26:16,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:26:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:26:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 14:26:16,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-14 14:26:16,572 INFO L175 Difference]: Start difference. First operand has 117 places, 105 transitions, 897 flow. Second operand 9 states and 113 transitions. [2024-06-14 14:26:16,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 119 transitions, 1201 flow [2024-06-14 14:26:16,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 119 transitions, 1115 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-14 14:26:16,585 INFO L231 Difference]: Finished difference. Result has 119 places, 107 transitions, 910 flow [2024-06-14 14:26:16,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=910, PETRI_PLACES=119, PETRI_TRANSITIONS=107} [2024-06-14 14:26:16,586 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2024-06-14 14:26:16,586 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 107 transitions, 910 flow [2024-06-14 14:26:16,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:16,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:16,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:16,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 14:26:16,586 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:16,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:16,587 INFO L85 PathProgramCache]: Analyzing trace with hash -90958939, now seen corresponding path program 2 times [2024-06-14 14:26:16,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:16,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628281688] [2024-06-14 14:26:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:16,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:24,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:24,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628281688] [2024-06-14 14:26:24,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628281688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:24,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:24,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:26:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549660268] [2024-06-14 14:26:24,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:24,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:26:24,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:24,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:26:24,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:26:24,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:26:24,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 107 transitions, 910 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:24,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:24,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:26:24,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:24,566 INFO L124 PetriNetUnfolderBase]: 269/494 cut-off events. [2024-06-14 14:26:24,566 INFO L125 PetriNetUnfolderBase]: For 17965/17965 co-relation queries the response was YES. [2024-06-14 14:26:24,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3426 conditions, 494 events. 269/494 cut-off events. For 17965/17965 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2031 event pairs, 34 based on Foata normal form. 2/494 useless extension candidates. Maximal degree in co-relation 3367. Up to 353 conditions per place. [2024-06-14 14:26:24,569 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 83 selfloop transitions, 39 changer transitions 0/125 dead transitions. [2024-06-14 14:26:24,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 125 transitions, 1348 flow [2024-06-14 14:26:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:26:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:26:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 14:26:24,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-14 14:26:24,570 INFO L175 Difference]: Start difference. First operand has 119 places, 107 transitions, 910 flow. Second operand 9 states and 118 transitions. [2024-06-14 14:26:24,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 125 transitions, 1348 flow [2024-06-14 14:26:24,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 125 transitions, 1265 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-14 14:26:24,587 INFO L231 Difference]: Finished difference. Result has 122 places, 112 transitions, 1011 flow [2024-06-14 14:26:24,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1011, PETRI_PLACES=122, PETRI_TRANSITIONS=112} [2024-06-14 14:26:24,587 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 91 predicate places. [2024-06-14 14:26:24,588 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 112 transitions, 1011 flow [2024-06-14 14:26:24,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:24,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:24,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:24,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 14:26:24,588 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:24,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:24,588 INFO L85 PathProgramCache]: Analyzing trace with hash -90966379, now seen corresponding path program 3 times [2024-06-14 14:26:24,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:24,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128779868] [2024-06-14 14:26:24,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:24,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:33,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:33,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128779868] [2024-06-14 14:26:33,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128779868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:33,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:33,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:26:33,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914049148] [2024-06-14 14:26:33,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:33,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:26:33,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:33,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:26:33,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:26:33,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:26:33,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 112 transitions, 1011 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:33,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:33,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:26:33,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:33,894 INFO L124 PetriNetUnfolderBase]: 272/499 cut-off events. [2024-06-14 14:26:33,894 INFO L125 PetriNetUnfolderBase]: For 18624/18624 co-relation queries the response was YES. [2024-06-14 14:26:33,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 499 events. 272/499 cut-off events. For 18624/18624 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2058 event pairs, 36 based on Foata normal form. 1/498 useless extension candidates. Maximal degree in co-relation 3523. Up to 379 conditions per place. [2024-06-14 14:26:33,898 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 88 selfloop transitions, 39 changer transitions 0/130 dead transitions. [2024-06-14 14:26:33,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 130 transitions, 1489 flow [2024-06-14 14:26:33,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:26:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:26:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 14:26:33,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-14 14:26:33,899 INFO L175 Difference]: Start difference. First operand has 122 places, 112 transitions, 1011 flow. Second operand 9 states and 116 transitions. [2024-06-14 14:26:33,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 130 transitions, 1489 flow [2024-06-14 14:26:33,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 130 transitions, 1381 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-14 14:26:33,918 INFO L231 Difference]: Finished difference. Result has 127 places, 119 transitions, 1149 flow [2024-06-14 14:26:33,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1149, PETRI_PLACES=127, PETRI_TRANSITIONS=119} [2024-06-14 14:26:33,918 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2024-06-14 14:26:33,918 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 119 transitions, 1149 flow [2024-06-14 14:26:33,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:33,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:33,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:33,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 14:26:33,919 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:33,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:33,919 INFO L85 PathProgramCache]: Analyzing trace with hash -90966596, now seen corresponding path program 3 times [2024-06-14 14:26:33,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:33,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065944156] [2024-06-14 14:26:33,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:33,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:45,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:45,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:45,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065944156] [2024-06-14 14:26:45,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065944156] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:45,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:45,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:26:45,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112439182] [2024-06-14 14:26:45,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:45,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:26:45,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:45,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:26:45,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:26:45,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:26:45,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 119 transitions, 1149 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:45,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:45,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:26:45,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:46,110 INFO L124 PetriNetUnfolderBase]: 280/516 cut-off events. [2024-06-14 14:26:46,110 INFO L125 PetriNetUnfolderBase]: For 20407/20407 co-relation queries the response was YES. [2024-06-14 14:26:46,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3822 conditions, 516 events. 280/516 cut-off events. For 20407/20407 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2160 event pairs, 36 based on Foata normal form. 1/515 useless extension candidates. Maximal degree in co-relation 3758. Up to 405 conditions per place. [2024-06-14 14:26:46,113 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 97 selfloop transitions, 34 changer transitions 0/134 dead transitions. [2024-06-14 14:26:46,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 134 transitions, 1603 flow [2024-06-14 14:26:46,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:26:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:26:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 14:26:46,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 14:26:46,114 INFO L175 Difference]: Start difference. First operand has 127 places, 119 transitions, 1149 flow. Second operand 9 states and 114 transitions. [2024-06-14 14:26:46,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 134 transitions, 1603 flow [2024-06-14 14:26:46,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 134 transitions, 1540 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-14 14:26:46,134 INFO L231 Difference]: Finished difference. Result has 132 places, 123 transitions, 1259 flow [2024-06-14 14:26:46,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1259, PETRI_PLACES=132, PETRI_TRANSITIONS=123} [2024-06-14 14:26:46,134 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-06-14 14:26:46,134 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 123 transitions, 1259 flow [2024-06-14 14:26:46,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:46,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:46,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:46,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 14:26:46,135 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:46,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:46,135 INFO L85 PathProgramCache]: Analyzing trace with hash -563567129, now seen corresponding path program 4 times [2024-06-14 14:26:46,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:46,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371620134] [2024-06-14 14:26:46,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:46,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:52,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:52,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371620134] [2024-06-14 14:26:52,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371620134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:52,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:52,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:26:52,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739217365] [2024-06-14 14:26:52,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:52,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:26:52,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:52,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:26:52,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:26:53,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:26:53,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 123 transitions, 1259 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:53,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:53,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:26:53,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:53,451 INFO L124 PetriNetUnfolderBase]: 276/510 cut-off events. [2024-06-14 14:26:53,451 INFO L125 PetriNetUnfolderBase]: For 20982/20982 co-relation queries the response was YES. [2024-06-14 14:26:53,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3786 conditions, 510 events. 276/510 cut-off events. For 20982/20982 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2132 event pairs, 36 based on Foata normal form. 2/510 useless extension candidates. Maximal degree in co-relation 3720. Up to 417 conditions per place. [2024-06-14 14:26:53,454 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 103 selfloop transitions, 27 changer transitions 0/133 dead transitions. [2024-06-14 14:26:53,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 133 transitions, 1543 flow [2024-06-14 14:26:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:26:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:26:53,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 14:26:53,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 14:26:53,455 INFO L175 Difference]: Start difference. First operand has 132 places, 123 transitions, 1259 flow. Second operand 9 states and 114 transitions. [2024-06-14 14:26:53,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 133 transitions, 1543 flow [2024-06-14 14:26:53,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 133 transitions, 1431 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-14 14:26:53,478 INFO L231 Difference]: Finished difference. Result has 136 places, 123 transitions, 1207 flow [2024-06-14 14:26:53,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1207, PETRI_PLACES=136, PETRI_TRANSITIONS=123} [2024-06-14 14:26:53,479 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 105 predicate places. [2024-06-14 14:26:53,479 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 123 transitions, 1207 flow [2024-06-14 14:26:53,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:53,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:53,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:53,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 14:26:53,479 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:53,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash -563567346, now seen corresponding path program 4 times [2024-06-14 14:26:53,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:53,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214343446] [2024-06-14 14:26:53,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:53,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:06,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:06,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214343446] [2024-06-14 14:27:06,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214343446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:06,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:06,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:27:06,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810368514] [2024-06-14 14:27:06,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:06,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:27:06,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:06,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:27:06,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:27:06,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:27:06,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 123 transitions, 1207 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:06,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:06,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:27:06,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:06,497 INFO L124 PetriNetUnfolderBase]: 274/507 cut-off events. [2024-06-14 14:27:06,497 INFO L125 PetriNetUnfolderBase]: For 19890/19890 co-relation queries the response was YES. [2024-06-14 14:27:06,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3715 conditions, 507 events. 274/507 cut-off events. For 19890/19890 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2112 event pairs, 36 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 3647. Up to 417 conditions per place. [2024-06-14 14:27:06,501 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 104 selfloop transitions, 26 changer transitions 0/133 dead transitions. [2024-06-14 14:27:06,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 133 transitions, 1491 flow [2024-06-14 14:27:06,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:27:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:27:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 14:27:06,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-14 14:27:06,503 INFO L175 Difference]: Start difference. First operand has 136 places, 123 transitions, 1207 flow. Second operand 9 states and 113 transitions. [2024-06-14 14:27:06,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 133 transitions, 1491 flow [2024-06-14 14:27:06,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 133 transitions, 1401 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-14 14:27:06,531 INFO L231 Difference]: Finished difference. Result has 138 places, 123 transitions, 1174 flow [2024-06-14 14:27:06,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1174, PETRI_PLACES=138, PETRI_TRANSITIONS=123} [2024-06-14 14:27:06,532 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 107 predicate places. [2024-06-14 14:27:06,532 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 123 transitions, 1174 flow [2024-06-14 14:27:06,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:06,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:06,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:06,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 14:27:06,532 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:06,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:06,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1705693285, now seen corresponding path program 5 times [2024-06-14 14:27:06,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:06,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548814205] [2024-06-14 14:27:06,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:06,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:14,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:14,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:14,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548814205] [2024-06-14 14:27:14,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548814205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:14,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:14,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:27:14,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369094912] [2024-06-14 14:27:14,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:14,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:27:14,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:14,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:27:14,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:27:14,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:27:14,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 123 transitions, 1174 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:14,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:14,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:27:14,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:15,131 INFO L124 PetriNetUnfolderBase]: 277/512 cut-off events. [2024-06-14 14:27:15,132 INFO L125 PetriNetUnfolderBase]: For 20748/20748 co-relation queries the response was YES. [2024-06-14 14:27:15,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3742 conditions, 512 events. 277/512 cut-off events. For 20748/20748 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2128 event pairs, 37 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 3673. Up to 467 conditions per place. [2024-06-14 14:27:15,135 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 116 selfloop transitions, 14 changer transitions 0/133 dead transitions. [2024-06-14 14:27:15,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 133 transitions, 1486 flow [2024-06-14 14:27:15,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:27:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:27:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 14:27:15,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 14:27:15,138 INFO L175 Difference]: Start difference. First operand has 138 places, 123 transitions, 1174 flow. Second operand 9 states and 105 transitions. [2024-06-14 14:27:15,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 133 transitions, 1486 flow [2024-06-14 14:27:15,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 133 transitions, 1405 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 14:27:15,167 INFO L231 Difference]: Finished difference. Result has 139 places, 125 transitions, 1164 flow [2024-06-14 14:27:15,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1164, PETRI_PLACES=139, PETRI_TRANSITIONS=125} [2024-06-14 14:27:15,168 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 108 predicate places. [2024-06-14 14:27:15,168 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 125 transitions, 1164 flow [2024-06-14 14:27:15,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:15,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:15,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:15,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 14:27:15,169 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:15,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:15,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1705960195, now seen corresponding path program 6 times [2024-06-14 14:27:15,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:15,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962807217] [2024-06-14 14:27:15,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:15,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:22,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:22,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:22,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962807217] [2024-06-14 14:27:22,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962807217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:22,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:22,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:27:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274524500] [2024-06-14 14:27:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:22,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:27:22,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:22,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:27:22,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:27:22,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:27:22,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 125 transitions, 1164 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:22,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:22,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:27:22,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:23,072 INFO L124 PetriNetUnfolderBase]: 290/534 cut-off events. [2024-06-14 14:27:23,072 INFO L125 PetriNetUnfolderBase]: For 23477/23477 co-relation queries the response was YES. [2024-06-14 14:27:23,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4002 conditions, 534 events. 290/534 cut-off events. For 23477/23477 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2262 event pairs, 42 based on Foata normal form. 1/530 useless extension candidates. Maximal degree in co-relation 3932. Up to 344 conditions per place. [2024-06-14 14:27:23,076 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 78 selfloop transitions, 62 changer transitions 0/143 dead transitions. [2024-06-14 14:27:23,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 143 transitions, 1786 flow [2024-06-14 14:27:23,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:27:23,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:27:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-14 14:27:23,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-14 14:27:23,087 INFO L175 Difference]: Start difference. First operand has 139 places, 125 transitions, 1164 flow. Second operand 9 states and 118 transitions. [2024-06-14 14:27:23,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 143 transitions, 1786 flow [2024-06-14 14:27:23,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 143 transitions, 1728 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 14:27:23,120 INFO L231 Difference]: Finished difference. Result has 142 places, 133 transitions, 1442 flow [2024-06-14 14:27:23,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1442, PETRI_PLACES=142, PETRI_TRANSITIONS=133} [2024-06-14 14:27:23,121 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2024-06-14 14:27:23,121 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 133 transitions, 1442 flow [2024-06-14 14:27:23,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:23,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:23,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:23,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 14:27:23,122 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:23,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1962662515, now seen corresponding path program 7 times [2024-06-14 14:27:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:23,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192000863] [2024-06-14 14:27:23,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:30,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:30,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192000863] [2024-06-14 14:27:30,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192000863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:30,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:30,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:27:30,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824572964] [2024-06-14 14:27:30,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:30,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:27:30,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:30,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:27:30,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:27:30,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:27:30,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 133 transitions, 1442 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:30,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:30,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:27:30,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:31,011 INFO L124 PetriNetUnfolderBase]: 297/546 cut-off events. [2024-06-14 14:27:31,012 INFO L125 PetriNetUnfolderBase]: For 26561/26561 co-relation queries the response was YES. [2024-06-14 14:27:31,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4285 conditions, 546 events. 297/546 cut-off events. For 26561/26561 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2343 event pairs, 43 based on Foata normal form. 4/545 useless extension candidates. Maximal degree in co-relation 4213. Up to 434 conditions per place. [2024-06-14 14:27:31,017 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 110 selfloop transitions, 33 changer transitions 0/146 dead transitions. [2024-06-14 14:27:31,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 1854 flow [2024-06-14 14:27:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:27:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:27:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 14:27:31,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 14:27:31,025 INFO L175 Difference]: Start difference. First operand has 142 places, 133 transitions, 1442 flow. Second operand 9 states and 114 transitions. [2024-06-14 14:27:31,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 1854 flow [2024-06-14 14:27:31,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 146 transitions, 1775 flow, removed 30 selfloop flow, removed 3 redundant places. [2024-06-14 14:27:31,065 INFO L231 Difference]: Finished difference. Result has 148 places, 137 transitions, 1536 flow [2024-06-14 14:27:31,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1536, PETRI_PLACES=148, PETRI_TRANSITIONS=137} [2024-06-14 14:27:31,065 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-14 14:27:31,066 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 1536 flow [2024-06-14 14:27:31,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:31,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:31,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:31,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 14:27:31,066 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:31,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:31,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1616167348, now seen corresponding path program 5 times [2024-06-14 14:27:31,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:31,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218975124] [2024-06-14 14:27:31,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:31,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:39,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:39,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218975124] [2024-06-14 14:27:39,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218975124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:39,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:39,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:27:39,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982108098] [2024-06-14 14:27:39,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:39,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:27:39,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:39,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:27:39,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:27:40,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:27:40,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 1536 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:40,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:40,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:27:40,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:40,368 INFO L124 PetriNetUnfolderBase]: 300/553 cut-off events. [2024-06-14 14:27:40,368 INFO L125 PetriNetUnfolderBase]: For 26104/26104 co-relation queries the response was YES. [2024-06-14 14:27:40,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4438 conditions, 553 events. 300/553 cut-off events. For 26104/26104 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2386 event pairs, 42 based on Foata normal form. 1/549 useless extension candidates. Maximal degree in co-relation 4364. Up to 448 conditions per place. [2024-06-14 14:27:40,372 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 114 selfloop transitions, 30 changer transitions 0/147 dead transitions. [2024-06-14 14:27:40,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 147 transitions, 1898 flow [2024-06-14 14:27:40,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:27:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:27:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 14:27:40,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 14:27:40,381 INFO L175 Difference]: Start difference. First operand has 148 places, 137 transitions, 1536 flow. Second operand 9 states and 112 transitions. [2024-06-14 14:27:40,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 147 transitions, 1898 flow [2024-06-14 14:27:40,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 147 transitions, 1752 flow, removed 43 selfloop flow, removed 7 redundant places. [2024-06-14 14:27:40,418 INFO L231 Difference]: Finished difference. Result has 150 places, 139 transitions, 1515 flow [2024-06-14 14:27:40,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1515, PETRI_PLACES=150, PETRI_TRANSITIONS=139} [2024-06-14 14:27:40,419 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 119 predicate places. [2024-06-14 14:27:40,419 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 139 transitions, 1515 flow [2024-06-14 14:27:40,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:40,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:40,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:40,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 14:27:40,420 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:40,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1705952476, now seen corresponding path program 1 times [2024-06-14 14:27:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:40,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39450261] [2024-06-14 14:27:40,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:50,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:50,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39450261] [2024-06-14 14:27:50,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39450261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:50,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:50,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:27:50,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173868603] [2024-06-14 14:27:50,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:50,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:27:50,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:50,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:27:50,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:27:51,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:27:51,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 139 transitions, 1515 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:51,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:51,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:27:51,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:51,420 INFO L124 PetriNetUnfolderBase]: 303/558 cut-off events. [2024-06-14 14:27:51,420 INFO L125 PetriNetUnfolderBase]: For 27140/27140 co-relation queries the response was YES. [2024-06-14 14:27:51,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4436 conditions, 558 events. 303/558 cut-off events. For 27140/27140 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2410 event pairs, 37 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 4361. Up to 458 conditions per place. [2024-06-14 14:27:51,424 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 115 selfloop transitions, 34 changer transitions 0/152 dead transitions. [2024-06-14 14:27:51,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 152 transitions, 1985 flow [2024-06-14 14:27:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:27:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:27:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-14 14:27:51,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-14 14:27:51,426 INFO L175 Difference]: Start difference. First operand has 150 places, 139 transitions, 1515 flow. Second operand 9 states and 104 transitions. [2024-06-14 14:27:51,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 152 transitions, 1985 flow [2024-06-14 14:27:51,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 152 transitions, 1876 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-14 14:27:51,463 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 1551 flow [2024-06-14 14:27:51,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1551, PETRI_PLACES=152, PETRI_TRANSITIONS=143} [2024-06-14 14:27:51,463 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 121 predicate places. [2024-06-14 14:27:51,463 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 1551 flow [2024-06-14 14:27:51,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:51,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:51,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:51,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 14:27:51,464 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:51,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:51,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1705952755, now seen corresponding path program 8 times [2024-06-14 14:27:51,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:51,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137362723] [2024-06-14 14:27:51,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:51,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:59,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-14 14:27:59,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:59,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137362723] [2024-06-14 14:27:59,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137362723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:59,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:59,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:27:59,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296930315] [2024-06-14 14:27:59,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:59,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:27:59,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:59,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:27:59,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:27:59,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:27:59,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 143 transitions, 1551 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:59,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:59,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:27:59,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:59,554 INFO L124 PetriNetUnfolderBase]: 314/576 cut-off events. [2024-06-14 14:27:59,555 INFO L125 PetriNetUnfolderBase]: For 29659/29659 co-relation queries the response was YES. [2024-06-14 14:27:59,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4654 conditions, 576 events. 314/576 cut-off events. For 29659/29659 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2514 event pairs, 42 based on Foata normal form. 2/573 useless extension candidates. Maximal degree in co-relation 4578. Up to 319 conditions per place. [2024-06-14 14:27:59,559 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 87 selfloop transitions, 72 changer transitions 0/162 dead transitions. [2024-06-14 14:27:59,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 162 transitions, 2319 flow [2024-06-14 14:27:59,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:27:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:27:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-06-14 14:27:59,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-14 14:27:59,563 INFO L175 Difference]: Start difference. First operand has 152 places, 143 transitions, 1551 flow. Second operand 9 states and 124 transitions. [2024-06-14 14:27:59,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 162 transitions, 2319 flow [2024-06-14 14:27:59,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 162 transitions, 2239 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-14 14:27:59,604 INFO L231 Difference]: Finished difference. Result has 156 places, 151 transitions, 1794 flow [2024-06-14 14:27:59,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1794, PETRI_PLACES=156, PETRI_TRANSITIONS=151} [2024-06-14 14:27:59,604 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-14 14:27:59,604 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 151 transitions, 1794 flow [2024-06-14 14:27:59,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:59,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:59,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:59,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 14:27:59,605 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:59,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:59,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1705960412, now seen corresponding path program 6 times [2024-06-14 14:27:59,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:59,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953642210] [2024-06-14 14:27:59,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:59,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:08,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:08,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953642210] [2024-06-14 14:28:08,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953642210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:08,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:08,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:28:08,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729382960] [2024-06-14 14:28:08,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:08,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:28:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:28:08,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:28:09,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:28:09,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 151 transitions, 1794 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:09,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:09,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:28:09,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:09,289 INFO L124 PetriNetUnfolderBase]: 317/583 cut-off events. [2024-06-14 14:28:09,289 INFO L125 PetriNetUnfolderBase]: For 31053/31053 co-relation queries the response was YES. [2024-06-14 14:28:09,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4870 conditions, 583 events. 317/583 cut-off events. For 31053/31053 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2567 event pairs, 43 based on Foata normal form. 1/579 useless extension candidates. Maximal degree in co-relation 4792. Up to 425 conditions per place. [2024-06-14 14:28:09,293 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 110 selfloop transitions, 51 changer transitions 0/164 dead transitions. [2024-06-14 14:28:09,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 164 transitions, 2344 flow [2024-06-14 14:28:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:28:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:28:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 14:28:09,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 14:28:09,294 INFO L175 Difference]: Start difference. First operand has 156 places, 151 transitions, 1794 flow. Second operand 9 states and 114 transitions. [2024-06-14 14:28:09,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 164 transitions, 2344 flow [2024-06-14 14:28:09,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 164 transitions, 2266 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-14 14:28:09,335 INFO L231 Difference]: Finished difference. Result has 162 places, 155 transitions, 1947 flow [2024-06-14 14:28:09,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1716, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1947, PETRI_PLACES=162, PETRI_TRANSITIONS=155} [2024-06-14 14:28:09,336 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2024-06-14 14:28:09,336 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 155 transitions, 1947 flow [2024-06-14 14:28:09,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:09,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:09,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:09,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 14:28:09,337 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:09,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:09,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1962452986, now seen corresponding path program 2 times [2024-06-14 14:28:09,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:09,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841520192] [2024-06-14 14:28:09,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:09,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:17,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:17,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841520192] [2024-06-14 14:28:17,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841520192] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:17,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:17,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:28:17,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834213899] [2024-06-14 14:28:17,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:17,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:28:17,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:17,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:28:17,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:28:17,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:28:17,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 155 transitions, 1947 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:17,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:17,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:28:17,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:17,802 INFO L124 PetriNetUnfolderBase]: 315/580 cut-off events. [2024-06-14 14:28:17,802 INFO L125 PetriNetUnfolderBase]: For 31450/31450 co-relation queries the response was YES. [2024-06-14 14:28:17,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4891 conditions, 580 events. 315/580 cut-off events. For 31450/31450 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2551 event pairs, 38 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 4811. Up to 514 conditions per place. [2024-06-14 14:28:17,806 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 140 selfloop transitions, 20 changer transitions 0/163 dead transitions. [2024-06-14 14:28:17,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 163 transitions, 2285 flow [2024-06-14 14:28:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:28:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:28:17,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 14:28:17,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-14 14:28:17,807 INFO L175 Difference]: Start difference. First operand has 162 places, 155 transitions, 1947 flow. Second operand 9 states and 98 transitions. [2024-06-14 14:28:17,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 163 transitions, 2285 flow [2024-06-14 14:28:17,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 2169 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-06-14 14:28:17,851 INFO L231 Difference]: Finished difference. Result has 166 places, 155 transitions, 1876 flow [2024-06-14 14:28:17,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1831, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1876, PETRI_PLACES=166, PETRI_TRANSITIONS=155} [2024-06-14 14:28:17,852 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 135 predicate places. [2024-06-14 14:28:17,852 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 155 transitions, 1876 flow [2024-06-14 14:28:17,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:17,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:17,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:17,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 14:28:17,852 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:17,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:17,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1962460705, now seen corresponding path program 9 times [2024-06-14 14:28:17,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:17,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050696917] [2024-06-14 14:28:17,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:17,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:26,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:26,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050696917] [2024-06-14 14:28:26,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050696917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:26,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:26,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:28:26,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412472894] [2024-06-14 14:28:26,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:26,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:28:26,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:26,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:28:26,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:28:27,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:28:27,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 155 transitions, 1876 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:27,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:27,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:28:27,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:27,367 INFO L124 PetriNetUnfolderBase]: 318/585 cut-off events. [2024-06-14 14:28:27,367 INFO L125 PetriNetUnfolderBase]: For 31918/31918 co-relation queries the response was YES. [2024-06-14 14:28:27,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4902 conditions, 585 events. 318/585 cut-off events. For 31918/31918 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2565 event pairs, 42 based on Foata normal form. 1/581 useless extension candidates. Maximal degree in co-relation 4820. Up to 459 conditions per place. [2024-06-14 14:28:27,372 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 126 selfloop transitions, 38 changer transitions 0/167 dead transitions. [2024-06-14 14:28:27,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 167 transitions, 2381 flow [2024-06-14 14:28:27,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:28:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:28:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 14:28:27,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 14:28:27,376 INFO L175 Difference]: Start difference. First operand has 166 places, 155 transitions, 1876 flow. Second operand 9 states and 117 transitions. [2024-06-14 14:28:27,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 167 transitions, 2381 flow [2024-06-14 14:28:27,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 167 transitions, 2313 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 14:28:27,430 INFO L231 Difference]: Finished difference. Result has 167 places, 158 transitions, 1954 flow [2024-06-14 14:28:27,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1954, PETRI_PLACES=167, PETRI_TRANSITIONS=158} [2024-06-14 14:28:27,430 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-14 14:28:27,430 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 158 transitions, 1954 flow [2024-06-14 14:28:27,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:27,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:27,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:27,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 14:28:27,431 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:27,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:27,431 INFO L85 PathProgramCache]: Analyzing trace with hash 488853758, now seen corresponding path program 7 times [2024-06-14 14:28:27,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:27,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646997705] [2024-06-14 14:28:27,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:27,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:36,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:36,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646997705] [2024-06-14 14:28:36,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646997705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:36,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:36,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:28:36,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204771884] [2024-06-14 14:28:36,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:36,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:28:36,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:36,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:28:36,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:28:36,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:28:36,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 158 transitions, 1954 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:36,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:36,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:28:36,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:37,072 INFO L124 PetriNetUnfolderBase]: 316/582 cut-off events. [2024-06-14 14:28:37,072 INFO L125 PetriNetUnfolderBase]: For 32133/32133 co-relation queries the response was YES. [2024-06-14 14:28:37,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4878 conditions, 582 events. 316/582 cut-off events. For 32133/32133 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2554 event pairs, 43 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 4795. Up to 466 conditions per place. [2024-06-14 14:28:37,077 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 129 selfloop transitions, 34 changer transitions 0/166 dead transitions. [2024-06-14 14:28:37,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 166 transitions, 2298 flow [2024-06-14 14:28:37,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:28:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:28:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 14:28:37,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 14:28:37,078 INFO L175 Difference]: Start difference. First operand has 167 places, 158 transitions, 1954 flow. Second operand 9 states and 114 transitions. [2024-06-14 14:28:37,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 166 transitions, 2298 flow [2024-06-14 14:28:37,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 166 transitions, 2130 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-14 14:28:37,130 INFO L231 Difference]: Finished difference. Result has 170 places, 158 transitions, 1859 flow [2024-06-14 14:28:37,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1786, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1859, PETRI_PLACES=170, PETRI_TRANSITIONS=158} [2024-06-14 14:28:37,131 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 139 predicate places. [2024-06-14 14:28:37,131 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 158 transitions, 1859 flow [2024-06-14 14:28:37,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:37,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:37,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:37,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 14:28:37,131 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:37,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1962453265, now seen corresponding path program 10 times [2024-06-14 14:28:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:37,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698014093] [2024-06-14 14:28:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:45,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:45,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698014093] [2024-06-14 14:28:45,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698014093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:45,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:45,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:28:45,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814204707] [2024-06-14 14:28:45,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:45,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:28:45,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:45,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:28:45,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:28:45,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:28:45,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 158 transitions, 1859 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:45,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:45,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:28:45,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:45,893 INFO L124 PetriNetUnfolderBase]: 314/579 cut-off events. [2024-06-14 14:28:45,893 INFO L125 PetriNetUnfolderBase]: For 31750/31750 co-relation queries the response was YES. [2024-06-14 14:28:45,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4734 conditions, 579 events. 314/579 cut-off events. For 31750/31750 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2531 event pairs, 42 based on Foata normal form. 1/575 useless extension candidates. Maximal degree in co-relation 4650. Up to 454 conditions per place. [2024-06-14 14:28:45,897 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 124 selfloop transitions, 39 changer transitions 0/166 dead transitions. [2024-06-14 14:28:45,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 166 transitions, 2203 flow [2024-06-14 14:28:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:28:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:28:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 14:28:45,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-14 14:28:45,899 INFO L175 Difference]: Start difference. First operand has 170 places, 158 transitions, 1859 flow. Second operand 9 states and 116 transitions. [2024-06-14 14:28:45,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 166 transitions, 2203 flow [2024-06-14 14:28:45,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 2005 flow, removed 35 selfloop flow, removed 10 redundant places. [2024-06-14 14:28:45,948 INFO L231 Difference]: Finished difference. Result has 169 places, 158 transitions, 1744 flow [2024-06-14 14:28:45,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1744, PETRI_PLACES=169, PETRI_TRANSITIONS=158} [2024-06-14 14:28:45,948 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 138 predicate places. [2024-06-14 14:28:45,948 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 158 transitions, 1744 flow [2024-06-14 14:28:45,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:45,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:45,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:45,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 14:28:45,949 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:45,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:45,949 INFO L85 PathProgramCache]: Analyzing trace with hash 135655998, now seen corresponding path program 1 times [2024-06-14 14:28:45,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:45,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704086165] [2024-06-14 14:28:45,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:45,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:52,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:52,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704086165] [2024-06-14 14:28:52,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704086165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:52,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:52,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:28:52,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963062313] [2024-06-14 14:28:52,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:52,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:28:52,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:52,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:28:52,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:28:52,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:28:52,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 158 transitions, 1744 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:52,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:52,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:28:52,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:52,627 INFO L124 PetriNetUnfolderBase]: 318/586 cut-off events. [2024-06-14 14:28:52,628 INFO L125 PetriNetUnfolderBase]: For 33851/33851 co-relation queries the response was YES. [2024-06-14 14:28:52,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4662 conditions, 586 events. 318/586 cut-off events. For 33851/33851 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2580 event pairs, 15 based on Foata normal form. 2/586 useless extension candidates. Maximal degree in co-relation 4579. Up to 484 conditions per place. [2024-06-14 14:28:52,633 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 154 selfloop transitions, 19 changer transitions 0/176 dead transitions. [2024-06-14 14:28:52,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 176 transitions, 2154 flow [2024-06-14 14:28:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:28:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:28:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 14:28:52,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-14 14:28:52,639 INFO L175 Difference]: Start difference. First operand has 169 places, 158 transitions, 1744 flow. Second operand 9 states and 113 transitions. [2024-06-14 14:28:52,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 176 transitions, 2154 flow [2024-06-14 14:28:52,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 176 transitions, 2081 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 14:28:52,690 INFO L231 Difference]: Finished difference. Result has 171 places, 159 transitions, 1733 flow [2024-06-14 14:28:52,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1733, PETRI_PLACES=171, PETRI_TRANSITIONS=159} [2024-06-14 14:28:52,690 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 140 predicate places. [2024-06-14 14:28:52,691 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 159 transitions, 1733 flow [2024-06-14 14:28:52,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:52,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:52,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:52,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 14:28:52,691 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:52,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:52,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1576362194, now seen corresponding path program 2 times [2024-06-14 14:28:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:52,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545790996] [2024-06-14 14:28:52,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:52,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:58,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:58,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545790996] [2024-06-14 14:28:58,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545790996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:58,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:58,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:28:58,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701416886] [2024-06-14 14:28:58,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:58,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:28:58,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:58,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:28:58,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:28:58,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:28:58,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 159 transitions, 1733 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:58,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:58,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:28:58,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:59,030 INFO L124 PetriNetUnfolderBase]: 322/594 cut-off events. [2024-06-14 14:28:59,030 INFO L125 PetriNetUnfolderBase]: For 35216/35216 co-relation queries the response was YES. [2024-06-14 14:28:59,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4720 conditions, 594 events. 322/594 cut-off events. For 35216/35216 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2624 event pairs, 32 based on Foata normal form. 2/594 useless extension candidates. Maximal degree in co-relation 4636. Up to 509 conditions per place. [2024-06-14 14:28:59,035 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 153 selfloop transitions, 20 changer transitions 0/176 dead transitions. [2024-06-14 14:28:59,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 176 transitions, 2143 flow [2024-06-14 14:28:59,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:28:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:28:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 14:28:59,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 14:28:59,036 INFO L175 Difference]: Start difference. First operand has 171 places, 159 transitions, 1733 flow. Second operand 9 states and 114 transitions. [2024-06-14 14:28:59,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 176 transitions, 2143 flow [2024-06-14 14:28:59,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 176 transitions, 2091 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 14:28:59,089 INFO L231 Difference]: Finished difference. Result has 173 places, 160 transitions, 1747 flow [2024-06-14 14:28:59,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1681, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1747, PETRI_PLACES=173, PETRI_TRANSITIONS=160} [2024-06-14 14:28:59,090 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 142 predicate places. [2024-06-14 14:28:59,090 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 160 transitions, 1747 flow [2024-06-14 14:28:59,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:59,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:59,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:59,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 14:28:59,090 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:59,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1576367154, now seen corresponding path program 1 times [2024-06-14 14:28:59,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:59,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808880] [2024-06-14 14:28:59,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:59,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:08,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:08,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808880] [2024-06-14 14:29:08,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808880] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:08,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:08,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:29:08,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815728139] [2024-06-14 14:29:08,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:08,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:29:08,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:08,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:29:08,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:29:09,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:29:09,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 160 transitions, 1747 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:09,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:09,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:29:09,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:09,556 INFO L124 PetriNetUnfolderBase]: 325/601 cut-off events. [2024-06-14 14:29:09,556 INFO L125 PetriNetUnfolderBase]: For 36051/36051 co-relation queries the response was YES. [2024-06-14 14:29:09,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4784 conditions, 601 events. 325/601 cut-off events. For 36051/36051 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2692 event pairs, 31 based on Foata normal form. 1/600 useless extension candidates. Maximal degree in co-relation 4699. Up to 514 conditions per place. [2024-06-14 14:29:09,561 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 152 selfloop transitions, 23 changer transitions 0/178 dead transitions. [2024-06-14 14:29:09,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 178 transitions, 2189 flow [2024-06-14 14:29:09,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:29:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:29:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 14:29:09,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 14:29:09,562 INFO L175 Difference]: Start difference. First operand has 173 places, 160 transitions, 1747 flow. Second operand 10 states and 124 transitions. [2024-06-14 14:29:09,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 178 transitions, 2189 flow [2024-06-14 14:29:09,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 178 transitions, 2133 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 14:29:09,617 INFO L231 Difference]: Finished difference. Result has 176 places, 162 transitions, 1794 flow [2024-06-14 14:29:09,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1691, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1794, PETRI_PLACES=176, PETRI_TRANSITIONS=162} [2024-06-14 14:29:09,618 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-14 14:29:09,618 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 162 transitions, 1794 flow [2024-06-14 14:29:09,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:09,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:09,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:09,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 14:29:09,619 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:09,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:09,619 INFO L85 PathProgramCache]: Analyzing trace with hash -456534054, now seen corresponding path program 3 times [2024-06-14 14:29:09,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:09,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709787402] [2024-06-14 14:29:09,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:09,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709787402] [2024-06-14 14:29:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709787402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:15,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:15,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:29:15,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887825711] [2024-06-14 14:29:15,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:15,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:29:15,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:15,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:29:15,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:29:15,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:29:15,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 162 transitions, 1794 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:15,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:15,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:29:15,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:16,313 INFO L124 PetriNetUnfolderBase]: 329/609 cut-off events. [2024-06-14 14:29:16,313 INFO L125 PetriNetUnfolderBase]: For 38774/38774 co-relation queries the response was YES. [2024-06-14 14:29:16,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4861 conditions, 609 events. 329/609 cut-off events. For 38774/38774 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2732 event pairs, 31 based on Foata normal form. 2/609 useless extension candidates. Maximal degree in co-relation 4775. Up to 527 conditions per place. [2024-06-14 14:29:16,318 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 151 selfloop transitions, 22 changer transitions 0/176 dead transitions. [2024-06-14 14:29:16,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 176 transitions, 2194 flow [2024-06-14 14:29:16,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:29:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:29:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 14:29:16,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-14 14:29:16,319 INFO L175 Difference]: Start difference. First operand has 176 places, 162 transitions, 1794 flow. Second operand 9 states and 111 transitions. [2024-06-14 14:29:16,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 176 transitions, 2194 flow [2024-06-14 14:29:16,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 176 transitions, 2107 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-14 14:29:16,375 INFO L231 Difference]: Finished difference. Result has 177 places, 163 transitions, 1779 flow [2024-06-14 14:29:16,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1779, PETRI_PLACES=177, PETRI_TRANSITIONS=163} [2024-06-14 14:29:16,375 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 146 predicate places. [2024-06-14 14:29:16,376 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 163 transitions, 1779 flow [2024-06-14 14:29:16,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:16,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:16,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:16,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 14:29:16,376 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:16,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash -456349604, now seen corresponding path program 2 times [2024-06-14 14:29:16,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:16,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147664349] [2024-06-14 14:29:16,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:16,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:25,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:25,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147664349] [2024-06-14 14:29:25,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147664349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:25,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:25,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:29:25,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396600013] [2024-06-14 14:29:25,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:25,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:29:25,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:25,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:29:25,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:29:25,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:29:25,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 163 transitions, 1779 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:25,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:25,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:29:25,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:25,874 INFO L124 PetriNetUnfolderBase]: 356/658 cut-off events. [2024-06-14 14:29:25,874 INFO L125 PetriNetUnfolderBase]: For 46841/46841 co-relation queries the response was YES. [2024-06-14 14:29:25,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5523 conditions, 658 events. 356/658 cut-off events. For 46841/46841 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3031 event pairs, 29 based on Foata normal form. 2/658 useless extension candidates. Maximal degree in co-relation 5436. Up to 534 conditions per place. [2024-06-14 14:29:25,879 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 150 selfloop transitions, 33 changer transitions 0/186 dead transitions. [2024-06-14 14:29:25,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 186 transitions, 2484 flow [2024-06-14 14:29:25,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:29:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:29:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 14:29:25,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 14:29:25,880 INFO L175 Difference]: Start difference. First operand has 177 places, 163 transitions, 1779 flow. Second operand 10 states and 127 transitions. [2024-06-14 14:29:25,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 186 transitions, 2484 flow [2024-06-14 14:29:25,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 186 transitions, 2400 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 14:29:25,947 INFO L231 Difference]: Finished difference. Result has 180 places, 171 transitions, 1971 flow [2024-06-14 14:29:25,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1971, PETRI_PLACES=180, PETRI_TRANSITIONS=171} [2024-06-14 14:29:25,947 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 149 predicate places. [2024-06-14 14:29:25,947 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 171 transitions, 1971 flow [2024-06-14 14:29:25,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:25,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:25,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:25,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 14:29:25,948 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:25,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1691838062, now seen corresponding path program 1 times [2024-06-14 14:29:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:25,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449777410] [2024-06-14 14:29:25,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:34,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:34,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449777410] [2024-06-14 14:29:34,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449777410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:34,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:34,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:29:34,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059616730] [2024-06-14 14:29:34,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:34,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:29:34,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:34,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:29:34,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:29:34,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:29:34,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 171 transitions, 1971 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:34,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:34,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:29:34,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:34,783 INFO L124 PetriNetUnfolderBase]: 354/656 cut-off events. [2024-06-14 14:29:34,783 INFO L125 PetriNetUnfolderBase]: For 46923/46923 co-relation queries the response was YES. [2024-06-14 14:29:34,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5473 conditions, 656 events. 354/656 cut-off events. For 46923/46923 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3016 event pairs, 30 based on Foata normal form. 3/657 useless extension candidates. Maximal degree in co-relation 5385. Up to 527 conditions per place. [2024-06-14 14:29:34,788 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 149 selfloop transitions, 35 changer transitions 0/187 dead transitions. [2024-06-14 14:29:34,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 187 transitions, 2429 flow [2024-06-14 14:29:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:29:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:29:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 14:29:34,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-14 14:29:34,790 INFO L175 Difference]: Start difference. First operand has 180 places, 171 transitions, 1971 flow. Second operand 10 states and 126 transitions. [2024-06-14 14:29:34,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 187 transitions, 2429 flow [2024-06-14 14:29:34,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 187 transitions, 2329 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-14 14:29:34,868 INFO L231 Difference]: Finished difference. Result has 184 places, 173 transitions, 2006 flow [2024-06-14 14:29:34,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2006, PETRI_PLACES=184, PETRI_TRANSITIONS=173} [2024-06-14 14:29:34,868 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2024-06-14 14:29:34,868 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 173 transitions, 2006 flow [2024-06-14 14:29:34,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:34,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:34,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-14 14:29:34,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 14:29:34,869 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:34,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:34,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1691831304, now seen corresponding path program 3 times [2024-06-14 14:29:34,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:34,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99139219] [2024-06-14 14:29:34,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:34,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:43,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:43,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99139219] [2024-06-14 14:29:43,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99139219] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:43,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:43,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:29:43,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808907103] [2024-06-14 14:29:43,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:43,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:29:43,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:43,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:29:43,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:29:43,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:29:43,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 173 transitions, 2006 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:43,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:43,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:29:43,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:44,479 INFO L124 PetriNetUnfolderBase]: 352/653 cut-off events. [2024-06-14 14:29:44,479 INFO L125 PetriNetUnfolderBase]: For 43246/43246 co-relation queries the response was YES. [2024-06-14 14:29:44,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5397 conditions, 653 events. 352/653 cut-off events. For 43246/43246 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3005 event pairs, 30 based on Foata normal form. 1/652 useless extension candidates. Maximal degree in co-relation 5307. Up to 548 conditions per place. [2024-06-14 14:29:44,485 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 156 selfloop transitions, 30 changer transitions 0/189 dead transitions. [2024-06-14 14:29:44,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 189 transitions, 2468 flow [2024-06-14 14:29:44,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:29:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:29:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 14:29:44,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 14:29:44,487 INFO L175 Difference]: Start difference. First operand has 184 places, 173 transitions, 2006 flow. Second operand 10 states and 125 transitions. [2024-06-14 14:29:44,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 189 transitions, 2468 flow [2024-06-14 14:29:44,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 189 transitions, 2319 flow, removed 43 selfloop flow, removed 8 redundant places. [2024-06-14 14:29:44,567 INFO L231 Difference]: Finished difference. Result has 187 places, 176 transitions, 1992 flow [2024-06-14 14:29:44,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1857, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1992, PETRI_PLACES=187, PETRI_TRANSITIONS=176} [2024-06-14 14:29:44,568 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 156 predicate places. [2024-06-14 14:29:44,568 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 176 transitions, 1992 flow [2024-06-14 14:29:44,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:44,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:44,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:44,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 14:29:44,568 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:44,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1857292498, now seen corresponding path program 4 times [2024-06-14 14:29:44,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:44,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376703437] [2024-06-14 14:29:44,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:52,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:52,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376703437] [2024-06-14 14:29:52,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376703437] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:52,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:52,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:29:52,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269576859] [2024-06-14 14:29:52,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:52,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:29:52,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:52,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:29:52,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:29:52,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:29:52,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 176 transitions, 1992 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:52,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:52,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:29:52,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:52,592 INFO L124 PetriNetUnfolderBase]: 356/661 cut-off events. [2024-06-14 14:29:52,592 INFO L125 PetriNetUnfolderBase]: For 46664/46664 co-relation queries the response was YES. [2024-06-14 14:29:52,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5413 conditions, 661 events. 356/661 cut-off events. For 46664/46664 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3047 event pairs, 32 based on Foata normal form. 2/661 useless extension candidates. Maximal degree in co-relation 5321. Up to 562 conditions per place. [2024-06-14 14:29:52,598 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 162 selfloop transitions, 23 changer transitions 0/188 dead transitions. [2024-06-14 14:29:52,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 188 transitions, 2412 flow [2024-06-14 14:29:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:29:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:29:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 14:29:52,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-14 14:29:52,599 INFO L175 Difference]: Start difference. First operand has 187 places, 176 transitions, 1992 flow. Second operand 9 states and 111 transitions. [2024-06-14 14:29:52,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 188 transitions, 2412 flow [2024-06-14 14:29:52,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 188 transitions, 2315 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-14 14:29:52,671 INFO L231 Difference]: Finished difference. Result has 189 places, 177 transitions, 1971 flow [2024-06-14 14:29:52,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1971, PETRI_PLACES=189, PETRI_TRANSITIONS=177} [2024-06-14 14:29:52,672 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 158 predicate places. [2024-06-14 14:29:52,672 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 177 transitions, 1971 flow [2024-06-14 14:29:52,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:52,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:52,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:52,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 14:29:52,672 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:52,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:52,673 INFO L85 PathProgramCache]: Analyzing trace with hash -682667282, now seen corresponding path program 2 times [2024-06-14 14:29:52,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:52,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045121570] [2024-06-14 14:29:52,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:52,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:00,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:00,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045121570] [2024-06-14 14:30:00,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045121570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:00,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:00,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:30:00,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212223420] [2024-06-14 14:30:00,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:00,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:30:00,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:00,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:30:00,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:30:00,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:30:00,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 177 transitions, 1971 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:00,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:00,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:30:00,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:01,407 INFO L124 PetriNetUnfolderBase]: 357/661 cut-off events. [2024-06-14 14:30:01,408 INFO L125 PetriNetUnfolderBase]: For 46551/46551 co-relation queries the response was YES. [2024-06-14 14:30:01,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 661 events. 357/661 cut-off events. For 46551/46551 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3041 event pairs, 32 based on Foata normal form. 2/661 useless extension candidates. Maximal degree in co-relation 5267. Up to 552 conditions per place. [2024-06-14 14:30:01,416 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 157 selfloop transitions, 30 changer transitions 0/190 dead transitions. [2024-06-14 14:30:01,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 190 transitions, 2415 flow [2024-06-14 14:30:01,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:30:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:30:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 14:30:01,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 14:30:01,417 INFO L175 Difference]: Start difference. First operand has 189 places, 177 transitions, 1971 flow. Second operand 10 states and 125 transitions. [2024-06-14 14:30:01,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 190 transitions, 2415 flow [2024-06-14 14:30:01,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 190 transitions, 2349 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 14:30:01,500 INFO L231 Difference]: Finished difference. Result has 192 places, 179 transitions, 2019 flow [2024-06-14 14:30:01,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2019, PETRI_PLACES=192, PETRI_TRANSITIONS=179} [2024-06-14 14:30:01,501 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 161 predicate places. [2024-06-14 14:30:01,501 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 179 transitions, 2019 flow [2024-06-14 14:30:01,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:01,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:01,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:01,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 14:30:01,501 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:01,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:01,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1863733058, now seen corresponding path program 4 times [2024-06-14 14:30:01,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:01,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811688367] [2024-06-14 14:30:01,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:01,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:11,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:11,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811688367] [2024-06-14 14:30:11,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811688367] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:11,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:11,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:30:11,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126421918] [2024-06-14 14:30:11,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:11,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:30:11,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:11,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:30:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:30:11,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:30:11,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 179 transitions, 2019 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:11,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:11,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:30:11,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:11,947 INFO L124 PetriNetUnfolderBase]: 375/696 cut-off events. [2024-06-14 14:30:11,947 INFO L125 PetriNetUnfolderBase]: For 52863/52863 co-relation queries the response was YES. [2024-06-14 14:30:11,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5922 conditions, 696 events. 375/696 cut-off events. For 52863/52863 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3274 event pairs, 31 based on Foata normal form. 1/695 useless extension candidates. Maximal degree in co-relation 5828. Up to 526 conditions per place. [2024-06-14 14:30:11,953 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 149 selfloop transitions, 49 changer transitions 0/201 dead transitions. [2024-06-14 14:30:11,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 201 transitions, 3035 flow [2024-06-14 14:30:11,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:30:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:30:11,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-14 14:30:11,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-14 14:30:11,954 INFO L175 Difference]: Start difference. First operand has 192 places, 179 transitions, 2019 flow. Second operand 10 states and 140 transitions. [2024-06-14 14:30:11,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 201 transitions, 3035 flow [2024-06-14 14:30:12,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 201 transitions, 2908 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-06-14 14:30:12,038 INFO L231 Difference]: Finished difference. Result has 193 places, 187 transitions, 2239 flow [2024-06-14 14:30:12,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2239, PETRI_PLACES=193, PETRI_TRANSITIONS=187} [2024-06-14 14:30:12,039 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 162 predicate places. [2024-06-14 14:30:12,039 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 187 transitions, 2239 flow [2024-06-14 14:30:12,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:12,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:12,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:12,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 14:30:12,039 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:12,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:12,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1863733306, now seen corresponding path program 3 times [2024-06-14 14:30:12,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:12,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566827975] [2024-06-14 14:30:12,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:12,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:20,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:20,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566827975] [2024-06-14 14:30:20,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566827975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:20,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:20,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:30:20,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567163920] [2024-06-14 14:30:20,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:20,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:30:20,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:20,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:30:20,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:30:20,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:30:20,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 187 transitions, 2239 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:20,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:20,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:30:20,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:20,719 INFO L124 PetriNetUnfolderBase]: 373/693 cut-off events. [2024-06-14 14:30:20,719 INFO L125 PetriNetUnfolderBase]: For 52793/52793 co-relation queries the response was YES. [2024-06-14 14:30:20,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5843 conditions, 693 events. 373/693 cut-off events. For 52793/52793 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3262 event pairs, 31 based on Foata normal form. 1/692 useless extension candidates. Maximal degree in co-relation 5749. Up to 552 conditions per place. [2024-06-14 14:30:20,748 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 154 selfloop transitions, 41 changer transitions 0/198 dead transitions. [2024-06-14 14:30:20,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 198 transitions, 2655 flow [2024-06-14 14:30:20,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:30:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:30:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 14:30:20,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 14:30:20,750 INFO L175 Difference]: Start difference. First operand has 193 places, 187 transitions, 2239 flow. Second operand 10 states and 125 transitions. [2024-06-14 14:30:20,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 198 transitions, 2655 flow [2024-06-14 14:30:20,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 198 transitions, 2534 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-14 14:30:20,834 INFO L231 Difference]: Finished difference. Result has 199 places, 187 transitions, 2205 flow [2024-06-14 14:30:20,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2205, PETRI_PLACES=199, PETRI_TRANSITIONS=187} [2024-06-14 14:30:20,834 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 168 predicate places. [2024-06-14 14:30:20,834 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 187 transitions, 2205 flow [2024-06-14 14:30:20,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:20,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:20,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:20,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 14:30:20,835 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:20,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1863726548, now seen corresponding path program 5 times [2024-06-14 14:30:20,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:20,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513933910] [2024-06-14 14:30:20,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:20,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:29,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:29,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513933910] [2024-06-14 14:30:29,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513933910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:29,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:29,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:30:29,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763144913] [2024-06-14 14:30:29,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:29,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:30:29,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:29,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:30:29,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:30:29,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:30:29,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 187 transitions, 2205 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:29,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:29,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:30:29,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:30,553 INFO L124 PetriNetUnfolderBase]: 386/716 cut-off events. [2024-06-14 14:30:30,553 INFO L125 PetriNetUnfolderBase]: For 57404/57404 co-relation queries the response was YES. [2024-06-14 14:30:30,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6229 conditions, 716 events. 386/716 cut-off events. For 57404/57404 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3400 event pairs, 33 based on Foata normal form. 1/715 useless extension candidates. Maximal degree in co-relation 6133. Up to 491 conditions per place. [2024-06-14 14:30:30,558 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 142 selfloop transitions, 62 changer transitions 0/207 dead transitions. [2024-06-14 14:30:30,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 207 transitions, 3179 flow [2024-06-14 14:30:30,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:30:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:30:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 14:30:30,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-14 14:30:30,559 INFO L175 Difference]: Start difference. First operand has 199 places, 187 transitions, 2205 flow. Second operand 10 states and 133 transitions. [2024-06-14 14:30:30,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 207 transitions, 3179 flow [2024-06-14 14:30:30,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 207 transitions, 3035 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-14 14:30:30,662 INFO L231 Difference]: Finished difference. Result has 200 places, 193 transitions, 2368 flow [2024-06-14 14:30:30,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2061, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2368, PETRI_PLACES=200, PETRI_TRANSITIONS=193} [2024-06-14 14:30:30,662 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 169 predicate places. [2024-06-14 14:30:30,662 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 193 transitions, 2368 flow [2024-06-14 14:30:30,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:30,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:30,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:30,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 14:30:30,663 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:30,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:30,663 INFO L85 PathProgramCache]: Analyzing trace with hash 903795654, now seen corresponding path program 1 times [2024-06-14 14:30:30,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:30,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344800087] [2024-06-14 14:30:30,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:30,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:38,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:38,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344800087] [2024-06-14 14:30:38,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344800087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:38,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:38,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:30:38,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076773932] [2024-06-14 14:30:38,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:38,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:30:38,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:38,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:30:38,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:30:38,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:30:38,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 193 transitions, 2368 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:38,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:38,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:30:38,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:39,026 INFO L124 PetriNetUnfolderBase]: 390/724 cut-off events. [2024-06-14 14:30:39,026 INFO L125 PetriNetUnfolderBase]: For 62009/62009 co-relation queries the response was YES. [2024-06-14 14:30:39,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6324 conditions, 724 events. 390/724 cut-off events. For 62009/62009 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3468 event pairs, 31 based on Foata normal form. 2/724 useless extension candidates. Maximal degree in co-relation 6228. Up to 645 conditions per place. [2024-06-14 14:30:39,033 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 185 selfloop transitions, 18 changer transitions 0/206 dead transitions. [2024-06-14 14:30:39,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 206 transitions, 2826 flow [2024-06-14 14:30:39,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:30:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:30:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 14:30:39,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 14:30:39,035 INFO L175 Difference]: Start difference. First operand has 200 places, 193 transitions, 2368 flow. Second operand 10 states and 118 transitions. [2024-06-14 14:30:39,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 206 transitions, 2826 flow [2024-06-14 14:30:39,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 206 transitions, 2728 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-14 14:30:39,141 INFO L231 Difference]: Finished difference. Result has 204 places, 194 transitions, 2336 flow [2024-06-14 14:30:39,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2336, PETRI_PLACES=204, PETRI_TRANSITIONS=194} [2024-06-14 14:30:39,141 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 173 predicate places. [2024-06-14 14:30:39,142 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 194 transitions, 2336 flow [2024-06-14 14:30:39,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:39,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:39,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:39,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 14:30:39,142 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:39,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:39,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1528593658, now seen corresponding path program 6 times [2024-06-14 14:30:39,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:39,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001084274] [2024-06-14 14:30:39,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:39,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:49,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-14 14:30:49,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:49,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001084274] [2024-06-14 14:30:49,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001084274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:49,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:49,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:30:49,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744239979] [2024-06-14 14:30:49,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:49,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:30:49,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:49,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:30:49,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:30:49,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:30:49,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 194 transitions, 2336 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:49,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:49,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:30:49,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:49,875 INFO L124 PetriNetUnfolderBase]: 388/721 cut-off events. [2024-06-14 14:30:49,875 INFO L125 PetriNetUnfolderBase]: For 59506/59506 co-relation queries the response was YES. [2024-06-14 14:30:49,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6173 conditions, 721 events. 388/721 cut-off events. For 59506/59506 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3444 event pairs, 32 based on Foata normal form. 1/720 useless extension candidates. Maximal degree in co-relation 6076. Up to 551 conditions per place. [2024-06-14 14:30:49,882 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 150 selfloop transitions, 53 changer transitions 0/206 dead transitions. [2024-06-14 14:30:49,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 206 transitions, 2894 flow [2024-06-14 14:30:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:30:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:30:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-14 14:30:49,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-14 14:30:49,883 INFO L175 Difference]: Start difference. First operand has 204 places, 194 transitions, 2336 flow. Second operand 10 states and 136 transitions. [2024-06-14 14:30:49,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 206 transitions, 2894 flow [2024-06-14 14:30:49,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 206 transitions, 2755 flow, removed 32 selfloop flow, removed 10 redundant places. [2024-06-14 14:30:49,993 INFO L231 Difference]: Finished difference. Result has 204 places, 194 transitions, 2308 flow [2024-06-14 14:30:49,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2308, PETRI_PLACES=204, PETRI_TRANSITIONS=194} [2024-06-14 14:30:49,993 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 173 predicate places. [2024-06-14 14:30:49,993 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 194 transitions, 2308 flow [2024-06-14 14:30:49,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:49,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30: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-14 14:30:49,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 14:30:49,994 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:49,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash 897293466, now seen corresponding path program 7 times [2024-06-14 14:30:49,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:49,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281736129] [2024-06-14 14:30:49,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:49,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:59,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:59,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281736129] [2024-06-14 14:30:59,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281736129] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:59,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:59,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:30:59,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030664152] [2024-06-14 14:30:59,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:59,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:30:59,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:59,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:30:59,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:30:59,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:30:59,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 194 transitions, 2308 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:59,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:59,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:30:59,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:59,840 INFO L124 PetriNetUnfolderBase]: 396/738 cut-off events. [2024-06-14 14:30:59,840 INFO L125 PetriNetUnfolderBase]: For 63703/63703 co-relation queries the response was YES. [2024-06-14 14:30:59,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6407 conditions, 738 events. 396/738 cut-off events. For 63703/63703 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3574 event pairs, 32 based on Foata normal form. 1/737 useless extension candidates. Maximal degree in co-relation 6310. Up to 596 conditions per place. [2024-06-14 14:30:59,846 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 170 selfloop transitions, 38 changer transitions 0/211 dead transitions. [2024-06-14 14:30:59,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 211 transitions, 3132 flow [2024-06-14 14:30:59,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:30:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:30:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 14:30:59,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-14 14:30:59,849 INFO L175 Difference]: Start difference. First operand has 204 places, 194 transitions, 2308 flow. Second operand 10 states and 129 transitions. [2024-06-14 14:30:59,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 211 transitions, 3132 flow [2024-06-14 14:30:59,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 211 transitions, 3034 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 14:30:59,963 INFO L231 Difference]: Finished difference. Result has 206 places, 198 transitions, 2417 flow [2024-06-14 14:30:59,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2417, PETRI_PLACES=206, PETRI_TRANSITIONS=198} [2024-06-14 14:30:59,963 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 175 predicate places. [2024-06-14 14:30:59,963 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 198 transitions, 2417 flow [2024-06-14 14:30:59,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:59,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:59,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:59,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 14:30:59,964 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:59,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:59,964 INFO L85 PathProgramCache]: Analyzing trace with hash 897299976, now seen corresponding path program 8 times [2024-06-14 14:30:59,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:59,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706119136] [2024-06-14 14:30:59,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:59,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:07,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:07,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706119136] [2024-06-14 14:31:07,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706119136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:07,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:07,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:31:07,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177849810] [2024-06-14 14:31:07,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:07,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:31:07,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:07,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:31:07,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:31:07,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:31:07,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 198 transitions, 2417 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:07,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:07,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:31:07,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:08,230 INFO L124 PetriNetUnfolderBase]: 394/735 cut-off events. [2024-06-14 14:31:08,230 INFO L125 PetriNetUnfolderBase]: For 63325/63325 co-relation queries the response was YES. [2024-06-14 14:31:08,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6312 conditions, 735 events. 394/735 cut-off events. For 63325/63325 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3557 event pairs, 32 based on Foata normal form. 1/734 useless extension candidates. Maximal degree in co-relation 6214. Up to 611 conditions per place. [2024-06-14 14:31:08,236 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 174 selfloop transitions, 32 changer transitions 0/209 dead transitions. [2024-06-14 14:31:08,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 209 transitions, 2855 flow [2024-06-14 14:31:08,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:31:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:31:08,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-14 14:31:08,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-14 14:31:08,237 INFO L175 Difference]: Start difference. First operand has 206 places, 198 transitions, 2417 flow. Second operand 10 states and 134 transitions. [2024-06-14 14:31:08,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 209 transitions, 2855 flow [2024-06-14 14:31:08,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 209 transitions, 2662 flow, removed 55 selfloop flow, removed 7 redundant places. [2024-06-14 14:31:08,367 INFO L231 Difference]: Finished difference. Result has 209 places, 198 transitions, 2293 flow [2024-06-14 14:31:08,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2224, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2293, PETRI_PLACES=209, PETRI_TRANSITIONS=198} [2024-06-14 14:31:08,368 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 178 predicate places. [2024-06-14 14:31:08,368 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 198 transitions, 2293 flow [2024-06-14 14:31:08,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:08,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:08,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:08,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 14:31:08,368 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:31:08,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash 116352244, now seen corresponding path program 5 times [2024-06-14 14:31:08,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:08,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654714398] [2024-06-14 14:31:08,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:08,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:14,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:14,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654714398] [2024-06-14 14:31:14,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654714398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:14,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:14,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:31:14,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33162958] [2024-06-14 14:31:14,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:14,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:31:14,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:14,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:31:14,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:31:15,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:31:15,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 198 transitions, 2293 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:15,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:15,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:31:15,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:15,498 INFO L124 PetriNetUnfolderBase]: 391/731 cut-off events. [2024-06-14 14:31:15,498 INFO L125 PetriNetUnfolderBase]: For 61955/61955 co-relation queries the response was YES. [2024-06-14 14:31:15,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6053 conditions, 731 events. 391/731 cut-off events. For 61955/61955 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3548 event pairs, 37 based on Foata normal form. 2/728 useless extension candidates. Maximal degree in co-relation 5954. Up to 609 conditions per place. [2024-06-14 14:31:15,505 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 177 selfloop transitions, 28 changer transitions 0/208 dead transitions. [2024-06-14 14:31:15,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 208 transitions, 2736 flow [2024-06-14 14:31:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:31:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:31:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 14:31:15,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-14 14:31:15,506 INFO L175 Difference]: Start difference. First operand has 209 places, 198 transitions, 2293 flow. Second operand 9 states and 110 transitions. [2024-06-14 14:31:15,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 208 transitions, 2736 flow [2024-06-14 14:31:15,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 208 transitions, 2642 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 14:31:15,623 INFO L231 Difference]: Finished difference. Result has 209 places, 199 transitions, 2272 flow [2024-06-14 14:31:15,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2272, PETRI_PLACES=209, PETRI_TRANSITIONS=199} [2024-06-14 14:31:15,624 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 178 predicate places. [2024-06-14 14:31:15,624 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 199 transitions, 2272 flow [2024-06-14 14:31:15,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:15,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:15,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:15,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 14:31:15,624 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:31:15,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:15,625 INFO L85 PathProgramCache]: Analyzing trace with hash -706498798, now seen corresponding path program 2 times [2024-06-14 14:31:15,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:15,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450618864] [2024-06-14 14:31:15,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:15,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:24,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:24,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450618864] [2024-06-14 14:31:24,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450618864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:24,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:24,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:31:24,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599473227] [2024-06-14 14:31:24,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:24,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:31:24,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:24,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:31:24,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:31:24,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:31:24,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 199 transitions, 2272 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:24,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:24,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:31:24,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:24,574 INFO L124 PetriNetUnfolderBase]: 395/739 cut-off events. [2024-06-14 14:31:24,574 INFO L125 PetriNetUnfolderBase]: For 64105/64105 co-relation queries the response was YES. [2024-06-14 14:31:24,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6117 conditions, 739 events. 395/739 cut-off events. For 64105/64105 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3595 event pairs, 32 based on Foata normal form. 2/737 useless extension candidates. Maximal degree in co-relation 6017. Up to 649 conditions per place. [2024-06-14 14:31:24,581 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 186 selfloop transitions, 21 changer transitions 0/210 dead transitions. [2024-06-14 14:31:24,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 210 transitions, 2734 flow [2024-06-14 14:31:24,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:31:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:31:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 14:31:24,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-14 14:31:24,582 INFO L175 Difference]: Start difference. First operand has 209 places, 199 transitions, 2272 flow. Second operand 10 states and 117 transitions. [2024-06-14 14:31:24,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 210 transitions, 2734 flow [2024-06-14 14:31:24,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 210 transitions, 2605 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 14:31:24,709 INFO L231 Difference]: Finished difference. Result has 211 places, 200 transitions, 2217 flow [2024-06-14 14:31:24,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2217, PETRI_PLACES=211, PETRI_TRANSITIONS=200} [2024-06-14 14:31:24,710 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 180 predicate places. [2024-06-14 14:31:24,710 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 200 transitions, 2217 flow [2024-06-14 14:31:24,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:24,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:24,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:24,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 14:31:24,710 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:31:24,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1795466436, now seen corresponding path program 3 times [2024-06-14 14:31:24,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:24,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799412003] [2024-06-14 14:31:24,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:24,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:33,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:33,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799412003] [2024-06-14 14:31:33,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799412003] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:33,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:33,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:31:33,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852477222] [2024-06-14 14:31:33,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:33,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:31:33,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:31:33,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:31:33,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:31:33,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 200 transitions, 2217 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:33,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:33,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:31:33,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:33,671 INFO L124 PetriNetUnfolderBase]: 402/749 cut-off events. [2024-06-14 14:31:33,672 INFO L125 PetriNetUnfolderBase]: For 65975/65975 co-relation queries the response was YES. [2024-06-14 14:31:33,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6140 conditions, 749 events. 402/749 cut-off events. For 65975/65975 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3645 event pairs, 34 based on Foata normal form. 2/749 useless extension candidates. Maximal degree in co-relation 6039. Up to 678 conditions per place. [2024-06-14 14:31:33,680 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 195 selfloop transitions, 15 changer transitions 0/213 dead transitions. [2024-06-14 14:31:33,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 213 transitions, 2701 flow [2024-06-14 14:31:33,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:31:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:31:33,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 14:31:33,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 14:31:33,682 INFO L175 Difference]: Start difference. First operand has 211 places, 200 transitions, 2217 flow. Second operand 10 states and 115 transitions. [2024-06-14 14:31:33,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 213 transitions, 2701 flow [2024-06-14 14:31:33,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 213 transitions, 2618 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-14 14:31:33,819 INFO L231 Difference]: Finished difference. Result has 213 places, 203 transitions, 2219 flow [2024-06-14 14:31:33,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2219, PETRI_PLACES=213, PETRI_TRANSITIONS=203} [2024-06-14 14:31:33,819 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2024-06-14 14:31:33,820 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 203 transitions, 2219 flow [2024-06-14 14:31:33,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:33,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:33,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:33,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 14:31:33,820 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:31:33,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash -706738366, now seen corresponding path program 9 times [2024-06-14 14:31:33,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:33,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600476785] [2024-06-14 14:31:33,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:33,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:42,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:42,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600476785] [2024-06-14 14:31:42,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600476785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:42,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:42,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:31:42,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220272860] [2024-06-14 14:31:42,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:42,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:31:42,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:42,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:31:42,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:31:42,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:31:42,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 203 transitions, 2219 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:42,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:42,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:31:42,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:42,624 INFO L124 PetriNetUnfolderBase]: 444/829 cut-off events. [2024-06-14 14:31:42,624 INFO L125 PetriNetUnfolderBase]: For 85563/85563 co-relation queries the response was YES. [2024-06-14 14:31:42,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7421 conditions, 829 events. 444/829 cut-off events. For 85563/85563 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4150 event pairs, 38 based on Foata normal form. 2/826 useless extension candidates. Maximal degree in co-relation 7319. Up to 609 conditions per place. [2024-06-14 14:31:42,632 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 176 selfloop transitions, 50 changer transitions 0/229 dead transitions. [2024-06-14 14:31:42,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 229 transitions, 3479 flow [2024-06-14 14:31:42,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:31:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:31:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 145 transitions. [2024-06-14 14:31:42,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453125 [2024-06-14 14:31:42,633 INFO L175 Difference]: Start difference. First operand has 213 places, 203 transitions, 2219 flow. Second operand 10 states and 145 transitions. [2024-06-14 14:31:42,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 229 transitions, 3479 flow [2024-06-14 14:31:42,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 229 transitions, 3426 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 14:31:42,774 INFO L231 Difference]: Finished difference. Result has 217 places, 214 transitions, 2597 flow [2024-06-14 14:31:42,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2597, PETRI_PLACES=217, PETRI_TRANSITIONS=214} [2024-06-14 14:31:42,775 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-14 14:31:42,775 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 214 transitions, 2597 flow [2024-06-14 14:31:42,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:42,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:42,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:42,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 14:31:42,775 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:31:42,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:42,776 INFO L85 PathProgramCache]: Analyzing trace with hash 344677412, now seen corresponding path program 4 times [2024-06-14 14:31:42,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:42,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557649665] [2024-06-14 14:31:42,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:42,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:50,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:50,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557649665] [2024-06-14 14:31:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557649665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:50,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:50,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:31:50,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977914809] [2024-06-14 14:31:50,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:50,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:31:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:50,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:31:50,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:31:50,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:31:50,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 214 transitions, 2597 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:50,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:50,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:31:50,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:51,248 INFO L124 PetriNetUnfolderBase]: 448/837 cut-off events. [2024-06-14 14:31:51,249 INFO L125 PetriNetUnfolderBase]: For 88830/88830 co-relation queries the response was YES. [2024-06-14 14:31:51,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7641 conditions, 837 events. 448/837 cut-off events. For 88830/88830 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4207 event pairs, 36 based on Foata normal form. 2/835 useless extension candidates. Maximal degree in co-relation 7537. Up to 702 conditions per place. [2024-06-14 14:31:51,257 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 185 selfloop transitions, 36 changer transitions 0/224 dead transitions. [2024-06-14 14:31:51,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 224 transitions, 3089 flow [2024-06-14 14:31:51,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:31:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:31:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 14:31:51,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-14 14:31:51,257 INFO L175 Difference]: Start difference. First operand has 217 places, 214 transitions, 2597 flow. Second operand 9 states and 113 transitions. [2024-06-14 14:31:51,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 224 transitions, 3089 flow [2024-06-14 14:31:51,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 224 transitions, 2936 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-14 14:31:51,417 INFO L231 Difference]: Finished difference. Result has 222 places, 215 transitions, 2552 flow [2024-06-14 14:31:51,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2444, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2552, PETRI_PLACES=222, PETRI_TRANSITIONS=215} [2024-06-14 14:31:51,418 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 191 predicate places. [2024-06-14 14:31:51,418 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 215 transitions, 2552 flow [2024-06-14 14:31:51,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:51,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:51,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:51,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 14:31:51,418 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:31:51,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:51,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1091604292, now seen corresponding path program 4 times [2024-06-14 14:31:51,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:51,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929776829] [2024-06-14 14:31:51,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:51,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:03,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:03,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929776829] [2024-06-14 14:32:03,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929776829] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:03,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:03,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:32:03,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267785167] [2024-06-14 14:32:03,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:03,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:32:03,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:03,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:32:03,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:32:04,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:32:04,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 215 transitions, 2552 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:04,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:04,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:32:04,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:04,705 INFO L124 PetriNetUnfolderBase]: 456/849 cut-off events. [2024-06-14 14:32:04,705 INFO L125 PetriNetUnfolderBase]: For 90407/90407 co-relation queries the response was YES. [2024-06-14 14:32:04,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7696 conditions, 849 events. 456/849 cut-off events. For 90407/90407 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4290 event pairs, 35 based on Foata normal form. 1/848 useless extension candidates. Maximal degree in co-relation 7590. Up to 763 conditions per place. [2024-06-14 14:32:04,712 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 207 selfloop transitions, 19 changer transitions 0/229 dead transitions. [2024-06-14 14:32:04,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 229 transitions, 3250 flow [2024-06-14 14:32:04,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:32:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:32:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 14:32:04,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 14:32:04,713 INFO L175 Difference]: Start difference. First operand has 222 places, 215 transitions, 2552 flow. Second operand 10 states and 118 transitions. [2024-06-14 14:32:04,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 229 transitions, 3250 flow [2024-06-14 14:32:04,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 229 transitions, 3152 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 14:32:04,881 INFO L231 Difference]: Finished difference. Result has 225 places, 219 transitions, 2585 flow [2024-06-14 14:32:04,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2454, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2585, PETRI_PLACES=225, PETRI_TRANSITIONS=219} [2024-06-14 14:32:04,882 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 194 predicate places. [2024-06-14 14:32:04,882 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 219 transitions, 2585 flow [2024-06-14 14:32:04,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:04,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:04,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:04,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 14:32:04,883 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:04,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:04,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1344926508, now seen corresponding path program 10 times [2024-06-14 14:32:04,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:04,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629260206] [2024-06-14 14:32:04,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:04,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:14,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629260206] [2024-06-14 14:32:14,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629260206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:14,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:14,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:32:14,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047208018] [2024-06-14 14:32:14,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:14,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:32:14,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:14,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:32:14,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:32:14,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:32:14,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 219 transitions, 2585 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:14,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:14,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:32:14,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:15,260 INFO L124 PetriNetUnfolderBase]: 477/888 cut-off events. [2024-06-14 14:32:15,260 INFO L125 PetriNetUnfolderBase]: For 103167/103167 co-relation queries the response was YES. [2024-06-14 14:32:15,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8335 conditions, 888 events. 477/888 cut-off events. For 103167/103167 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4532 event pairs, 42 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 8228. Up to 434 conditions per place. [2024-06-14 14:32:15,269 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 138 selfloop transitions, 103 changer transitions 0/244 dead transitions. [2024-06-14 14:32:15,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 244 transitions, 4015 flow [2024-06-14 14:32:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:32:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:32:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2024-06-14 14:32:15,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465625 [2024-06-14 14:32:15,271 INFO L175 Difference]: Start difference. First operand has 225 places, 219 transitions, 2585 flow. Second operand 10 states and 149 transitions. [2024-06-14 14:32:15,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 244 transitions, 4015 flow [2024-06-14 14:32:15,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 244 transitions, 3961 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 14:32:15,462 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 3030 flow [2024-06-14 14:32:15,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2531, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3030, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2024-06-14 14:32:15,463 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 198 predicate places. [2024-06-14 14:32:15,463 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 3030 flow [2024-06-14 14:32:15,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:15,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:15,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:15,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 14:32:15,464 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:15,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:15,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1049342190, now seen corresponding path program 5 times [2024-06-14 14:32:15,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:15,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392641306] [2024-06-14 14:32:15,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:15,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:26,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-14 14:32:26,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:26,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392641306] [2024-06-14 14:32:26,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392641306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:26,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:26,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:32:26,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000570687] [2024-06-14 14:32:26,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:26,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:32:26,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:26,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:32:26,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:32:26,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:32:26,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 3030 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:26,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:26,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:32:26,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:27,325 INFO L124 PetriNetUnfolderBase]: 481/895 cut-off events. [2024-06-14 14:32:27,325 INFO L125 PetriNetUnfolderBase]: For 108044/108044 co-relation queries the response was YES. [2024-06-14 14:32:27,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8706 conditions, 895 events. 481/895 cut-off events. For 108044/108044 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4604 event pairs, 34 based on Foata normal form. 2/895 useless extension candidates. Maximal degree in co-relation 8597. Up to 780 conditions per place. [2024-06-14 14:32:27,334 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 218 selfloop transitions, 21 changer transitions 0/242 dead transitions. [2024-06-14 14:32:27,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 242 transitions, 3712 flow [2024-06-14 14:32:27,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:32:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:32:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-14 14:32:27,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36079545454545453 [2024-06-14 14:32:27,336 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 3030 flow. Second operand 11 states and 127 transitions. [2024-06-14 14:32:27,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 242 transitions, 3712 flow [2024-06-14 14:32:27,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 242 transitions, 3398 flow, removed 74 selfloop flow, removed 6 redundant places. [2024-06-14 14:32:27,542 INFO L231 Difference]: Finished difference. Result has 234 places, 229 transitions, 2794 flow [2024-06-14 14:32:27,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2716, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2794, PETRI_PLACES=234, PETRI_TRANSITIONS=229} [2024-06-14 14:32:27,543 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2024-06-14 14:32:27,543 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 229 transitions, 2794 flow [2024-06-14 14:32:27,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:27,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:27,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:27,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 14:32:27,543 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:27,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:27,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1059826390, now seen corresponding path program 5 times [2024-06-14 14:32:27,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:27,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688218306] [2024-06-14 14:32:27,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:27,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:37,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688218306] [2024-06-14 14:32:37,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688218306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:37,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:37,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:32:37,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091164603] [2024-06-14 14:32:37,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:37,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:32:37,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:37,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:32:37,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:32:37,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:32:37,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 229 transitions, 2794 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:37,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:37,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:32:37,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:37,700 INFO L124 PetriNetUnfolderBase]: 479/892 cut-off events. [2024-06-14 14:32:37,701 INFO L125 PetriNetUnfolderBase]: For 101861/101861 co-relation queries the response was YES. [2024-06-14 14:32:37,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8212 conditions, 892 events. 479/892 cut-off events. For 101861/101861 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4582 event pairs, 37 based on Foata normal form. 1/891 useless extension candidates. Maximal degree in co-relation 8103. Up to 809 conditions per place. [2024-06-14 14:32:37,710 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 219 selfloop transitions, 16 changer transitions 0/238 dead transitions. [2024-06-14 14:32:37,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 238 transitions, 3284 flow [2024-06-14 14:32:37,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:32:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:32:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 14:32:37,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 14:32:37,712 INFO L175 Difference]: Start difference. First operand has 234 places, 229 transitions, 2794 flow. Second operand 10 states and 115 transitions. [2024-06-14 14:32:37,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 238 transitions, 3284 flow [2024-06-14 14:32:37,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 238 transitions, 3193 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-14 14:32:37,903 INFO L231 Difference]: Finished difference. Result has 237 places, 229 transitions, 2740 flow [2024-06-14 14:32:37,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2703, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2740, PETRI_PLACES=237, PETRI_TRANSITIONS=229} [2024-06-14 14:32:37,904 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 206 predicate places. [2024-06-14 14:32:37,904 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 229 transitions, 2740 flow [2024-06-14 14:32:37,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:37,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:37,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:37,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 14:32:37,905 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:37,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:37,905 INFO L85 PathProgramCache]: Analyzing trace with hash -713000986, now seen corresponding path program 11 times [2024-06-14 14:32:37,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:37,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396904138] [2024-06-14 14:32:37,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:37,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:44,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:44,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396904138] [2024-06-14 14:32:44,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396904138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:44,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:44,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:32:44,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477947141] [2024-06-14 14:32:44,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:44,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:32:44,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:44,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:32:44,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:32:44,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:32:44,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 229 transitions, 2740 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:44,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:44,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:32:44,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:45,488 INFO L124 PetriNetUnfolderBase]: 487/910 cut-off events. [2024-06-14 14:32:45,489 INFO L125 PetriNetUnfolderBase]: For 107330/107330 co-relation queries the response was YES. [2024-06-14 14:32:45,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8383 conditions, 910 events. 487/910 cut-off events. For 107330/107330 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4728 event pairs, 41 based on Foata normal form. 1/906 useless extension candidates. Maximal degree in co-relation 8273. Up to 738 conditions per place. [2024-06-14 14:32:45,497 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 200 selfloop transitions, 42 changer transitions 0/245 dead transitions. [2024-06-14 14:32:45,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 245 transitions, 3686 flow [2024-06-14 14:32:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:32:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:32:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 14:32:45,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 14:32:45,498 INFO L175 Difference]: Start difference. First operand has 237 places, 229 transitions, 2740 flow. Second operand 10 states and 128 transitions. [2024-06-14 14:32:45,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 245 transitions, 3686 flow [2024-06-14 14:32:45,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 245 transitions, 3631 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 14:32:45,713 INFO L231 Difference]: Finished difference. Result has 238 places, 234 transitions, 2918 flow [2024-06-14 14:32:45,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2691, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2918, PETRI_PLACES=238, PETRI_TRANSITIONS=234} [2024-06-14 14:32:45,714 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 207 predicate places. [2024-06-14 14:32:45,714 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 234 transitions, 2918 flow [2024-06-14 14:32:45,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:45,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:45,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:45,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 14:32:45,714 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:45,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1803756084, now seen corresponding path program 12 times [2024-06-14 14:32:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:45,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173846739] [2024-06-14 14:32:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:54,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:54,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173846739] [2024-06-14 14:32:54,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173846739] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:54,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:54,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:32:54,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953960007] [2024-06-14 14:32:54,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:54,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:32:54,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:54,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:32:54,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:32:54,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:32:54,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 234 transitions, 2918 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:54,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:54,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:32:54,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:55,143 INFO L124 PetriNetUnfolderBase]: 490/917 cut-off events. [2024-06-14 14:32:55,143 INFO L125 PetriNetUnfolderBase]: For 111186/111186 co-relation queries the response was YES. [2024-06-14 14:32:55,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8526 conditions, 917 events. 490/917 cut-off events. For 111186/111186 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4781 event pairs, 39 based on Foata normal form. 1/913 useless extension candidates. Maximal degree in co-relation 8415. Up to 616 conditions per place. [2024-06-14 14:32:55,152 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 162 selfloop transitions, 91 changer transitions 0/256 dead transitions. [2024-06-14 14:32:55,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 256 transitions, 4043 flow [2024-06-14 14:32:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:32:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:32:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 14:32:55,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-14 14:32:55,155 INFO L175 Difference]: Start difference. First operand has 238 places, 234 transitions, 2918 flow. Second operand 10 states and 129 transitions. [2024-06-14 14:32:55,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 256 transitions, 4043 flow [2024-06-14 14:32:55,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 256 transitions, 3920 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-14 14:32:55,353 INFO L231 Difference]: Finished difference. Result has 244 places, 245 transitions, 3360 flow [2024-06-14 14:32:55,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2800, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3360, PETRI_PLACES=244, PETRI_TRANSITIONS=245} [2024-06-14 14:32:55,354 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 213 predicate places. [2024-06-14 14:32:55,354 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 245 transitions, 3360 flow [2024-06-14 14:32:55,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:55,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:55,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:55,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 14:32:55,354 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:55,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:55,355 INFO L85 PathProgramCache]: Analyzing trace with hash -706499108, now seen corresponding path program 6 times [2024-06-14 14:32:55,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:55,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486860857] [2024-06-14 14:32:55,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:55,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:03,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:03,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486860857] [2024-06-14 14:33:03,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486860857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:03,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:03,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:33:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265593663] [2024-06-14 14:33:03,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:03,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:33:03,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:03,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:33:03,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:33:03,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:33:03,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 245 transitions, 3360 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:03,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:03,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:33:03,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:04,130 INFO L124 PetriNetUnfolderBase]: 493/920 cut-off events. [2024-06-14 14:33:04,130 INFO L125 PetriNetUnfolderBase]: For 114207/114207 co-relation queries the response was YES. [2024-06-14 14:33:04,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8878 conditions, 920 events. 493/920 cut-off events. For 114207/114207 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4792 event pairs, 40 based on Foata normal form. 1/916 useless extension candidates. Maximal degree in co-relation 8763. Up to 740 conditions per place. [2024-06-14 14:33:04,139 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 204 selfloop transitions, 50 changer transitions 0/257 dead transitions. [2024-06-14 14:33:04,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 257 transitions, 4090 flow [2024-06-14 14:33:04,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:33:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:33:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 14:33:04,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-14 14:33:04,140 INFO L175 Difference]: Start difference. First operand has 244 places, 245 transitions, 3360 flow. Second operand 10 states and 129 transitions. [2024-06-14 14:33:04,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 257 transitions, 4090 flow [2024-06-14 14:33:04,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 257 transitions, 3980 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-14 14:33:04,343 INFO L231 Difference]: Finished difference. Result has 249 places, 247 transitions, 3403 flow [2024-06-14 14:33:04,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3250, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3403, PETRI_PLACES=249, PETRI_TRANSITIONS=247} [2024-06-14 14:33:04,344 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-14 14:33:04,344 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 247 transitions, 3403 flow [2024-06-14 14:33:04,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:04,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:04,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:04,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 14:33:04,344 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:33:04,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:04,345 INFO L85 PathProgramCache]: Analyzing trace with hash 116536694, now seen corresponding path program 13 times [2024-06-14 14:33:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:04,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5647129] [2024-06-14 14:33:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:04,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:13,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:13,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5647129] [2024-06-14 14:33:13,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5647129] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:13,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:13,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:33:13,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212094938] [2024-06-14 14:33:13,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:13,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:33:13,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:13,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:33:13,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:33:13,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:33:13,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 247 transitions, 3403 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:13,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:13,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:33:13,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:13,838 INFO L124 PetriNetUnfolderBase]: 491/919 cut-off events. [2024-06-14 14:33:13,838 INFO L125 PetriNetUnfolderBase]: For 114902/114902 co-relation queries the response was YES. [2024-06-14 14:33:13,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8823 conditions, 919 events. 491/919 cut-off events. For 114902/114902 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4798 event pairs, 38 based on Foata normal form. 1/915 useless extension candidates. Maximal degree in co-relation 8706. Up to 763 conditions per place. [2024-06-14 14:33:13,846 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 216 selfloop transitions, 37 changer transitions 0/256 dead transitions. [2024-06-14 14:33:13,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 256 transitions, 3929 flow [2024-06-14 14:33:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:33:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:33:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 14:33:13,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 14:33:13,847 INFO L175 Difference]: Start difference. First operand has 249 places, 247 transitions, 3403 flow. Second operand 10 states and 123 transitions. [2024-06-14 14:33:13,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 256 transitions, 3929 flow [2024-06-14 14:33:14,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 256 transitions, 3709 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-14 14:33:14,047 INFO L231 Difference]: Finished difference. Result has 250 places, 247 transitions, 3262 flow [2024-06-14 14:33:14,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3183, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3262, PETRI_PLACES=250, PETRI_TRANSITIONS=247} [2024-06-14 14:33:14,047 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 219 predicate places. [2024-06-14 14:33:14,048 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 247 transitions, 3262 flow [2024-06-14 14:33:14,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:14,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:14,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-14 14:33:14,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 14:33:14,048 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:33:14,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:14,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1345156900, now seen corresponding path program 7 times [2024-06-14 14:33:14,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:14,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342911193] [2024-06-14 14:33:14,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:14,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:21,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:21,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:21,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342911193] [2024-06-14 14:33:21,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342911193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:21,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:21,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:33:21,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732530438] [2024-06-14 14:33:21,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:21,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:33:21,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:21,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:33:21,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:33:21,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:33:21,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 247 transitions, 3262 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:21,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:21,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:33:21,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:22,341 INFO L124 PetriNetUnfolderBase]: 489/916 cut-off events. [2024-06-14 14:33:22,342 INFO L125 PetriNetUnfolderBase]: For 114186/114186 co-relation queries the response was YES. [2024-06-14 14:33:22,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8594 conditions, 916 events. 489/916 cut-off events. For 114186/114186 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4776 event pairs, 38 based on Foata normal form. 1/912 useless extension candidates. Maximal degree in co-relation 8477. Up to 683 conditions per place. [2024-06-14 14:33:22,351 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 184 selfloop transitions, 69 changer transitions 0/256 dead transitions. [2024-06-14 14:33:22,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 256 transitions, 3788 flow [2024-06-14 14:33:22,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:33:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:33:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 14:33:22,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-14 14:33:22,353 INFO L175 Difference]: Start difference. First operand has 250 places, 247 transitions, 3262 flow. Second operand 10 states and 126 transitions. [2024-06-14 14:33:22,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 256 transitions, 3788 flow [2024-06-14 14:33:22,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 256 transitions, 3626 flow, removed 40 selfloop flow, removed 8 redundant places. [2024-06-14 14:33:22,561 INFO L231 Difference]: Finished difference. Result has 252 places, 247 transitions, 3243 flow [2024-06-14 14:33:22,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3100, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3243, PETRI_PLACES=252, PETRI_TRANSITIONS=247} [2024-06-14 14:33:22,562 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 221 predicate places. [2024-06-14 14:33:22,562 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 247 transitions, 3243 flow [2024-06-14 14:33:22,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:22,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:22,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:22,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 14:33:22,563 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:33:22,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:22,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1345157148, now seen corresponding path program 14 times [2024-06-14 14:33:22,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:22,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507429265] [2024-06-14 14:33:22,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:22,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:29,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:29,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507429265] [2024-06-14 14:33:29,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507429265] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:29,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:29,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:33:29,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748029181] [2024-06-14 14:33:29,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:29,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:33:29,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:29,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:33:29,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:33:29,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:33:29,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 247 transitions, 3243 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:29,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:29,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:33:29,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:30,218 INFO L124 PetriNetUnfolderBase]: 490/920 cut-off events. [2024-06-14 14:33:30,218 INFO L125 PetriNetUnfolderBase]: For 115421/115421 co-relation queries the response was YES. [2024-06-14 14:33:30,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8531 conditions, 920 events. 490/920 cut-off events. For 115421/115421 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4836 event pairs, 40 based on Foata normal form. 2/917 useless extension candidates. Maximal degree in co-relation 8414. Up to 454 conditions per place. [2024-06-14 14:33:30,227 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 139 selfloop transitions, 120 changer transitions 0/262 dead transitions. [2024-06-14 14:33:30,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 262 transitions, 4332 flow [2024-06-14 14:33:30,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:33:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:33:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2024-06-14 14:33:30,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45625 [2024-06-14 14:33:30,229 INFO L175 Difference]: Start difference. First operand has 252 places, 247 transitions, 3243 flow. Second operand 10 states and 146 transitions. [2024-06-14 14:33:30,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 262 transitions, 4332 flow [2024-06-14 14:33:30,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 262 transitions, 4185 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 14:33:30,467 INFO L231 Difference]: Finished difference. Result has 253 places, 250 transitions, 3417 flow [2024-06-14 14:33:30,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3096, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3417, PETRI_PLACES=253, PETRI_TRANSITIONS=250} [2024-06-14 14:33:30,467 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 222 predicate places. [2024-06-14 14:33:30,467 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 250 transitions, 3417 flow [2024-06-14 14:33:30,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:30,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:30,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:30,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 14:33:30,468 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:33:30,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:30,468 INFO L85 PathProgramCache]: Analyzing trace with hash -706507478, now seen corresponding path program 8 times [2024-06-14 14:33:30,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:30,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016478377] [2024-06-14 14:33:30,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:30,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:40,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:40,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016478377] [2024-06-14 14:33:40,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016478377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:40,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:40,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:33:40,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158771810] [2024-06-14 14:33:40,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:40,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:33:40,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:40,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:33:40,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:33:40,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:33:40,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 250 transitions, 3417 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:40,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:40,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:33:40,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:41,347 INFO L124 PetriNetUnfolderBase]: 488/915 cut-off events. [2024-06-14 14:33:41,347 INFO L125 PetriNetUnfolderBase]: For 114170/114170 co-relation queries the response was YES. [2024-06-14 14:33:41,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8597 conditions, 915 events. 488/915 cut-off events. For 114170/114170 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4782 event pairs, 39 based on Foata normal form. 1/911 useless extension candidates. Maximal degree in co-relation 8479. Up to 750 conditions per place. [2024-06-14 14:33:41,355 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 214 selfloop transitions, 42 changer transitions 0/259 dead transitions. [2024-06-14 14:33:41,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 259 transitions, 3949 flow [2024-06-14 14:33:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:33:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:33:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 14:33:41,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-14 14:33:41,356 INFO L175 Difference]: Start difference. First operand has 253 places, 250 transitions, 3417 flow. Second operand 10 states and 126 transitions. [2024-06-14 14:33:41,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 259 transitions, 3949 flow [2024-06-14 14:33:41,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 259 transitions, 3624 flow, removed 42 selfloop flow, removed 8 redundant places. [2024-06-14 14:33:41,597 INFO L231 Difference]: Finished difference. Result has 255 places, 250 transitions, 3181 flow [2024-06-14 14:33:41,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3092, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3181, PETRI_PLACES=255, PETRI_TRANSITIONS=250} [2024-06-14 14:33:41,597 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 224 predicate places. [2024-06-14 14:33:41,597 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 250 transitions, 3181 flow [2024-06-14 14:33:41,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:41,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:41,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:41,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 14:33:41,598 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:33:41,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash -706507726, now seen corresponding path program 15 times [2024-06-14 14:33:41,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:41,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224830296] [2024-06-14 14:33:41,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:41,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:50,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:50,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224830296] [2024-06-14 14:33:50,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224830296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:50,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:50,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:33:50,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960978755] [2024-06-14 14:33:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:50,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:33:50,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:50,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:33:50,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:33:51,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:33:51,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 250 transitions, 3181 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:51,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:51,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:33:51,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:51,440 INFO L124 PetriNetUnfolderBase]: 486/912 cut-off events. [2024-06-14 14:33:51,441 INFO L125 PetriNetUnfolderBase]: For 111508/111508 co-relation queries the response was YES. [2024-06-14 14:33:51,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8208 conditions, 912 events. 486/912 cut-off events. For 111508/111508 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4778 event pairs, 38 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 8090. Up to 728 conditions per place. [2024-06-14 14:33:51,449 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 208 selfloop transitions, 50 changer transitions 0/261 dead transitions. [2024-06-14 14:33:51,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 261 transitions, 3910 flow [2024-06-14 14:33:51,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:33:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:33:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-14 14:33:51,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.428125 [2024-06-14 14:33:51,450 INFO L175 Difference]: Start difference. First operand has 255 places, 250 transitions, 3181 flow. Second operand 10 states and 137 transitions. [2024-06-14 14:33:51,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 261 transitions, 3910 flow [2024-06-14 14:33:51,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 261 transitions, 3788 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-14 14:33:51,714 INFO L231 Difference]: Finished difference. Result has 256 places, 251 transitions, 3193 flow [2024-06-14 14:33:51,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3059, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3193, PETRI_PLACES=256, PETRI_TRANSITIONS=251} [2024-06-14 14:33:51,714 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 225 predicate places. [2024-06-14 14:33:51,714 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 251 transitions, 3193 flow [2024-06-14 14:33:51,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:51,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:51,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:51,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 14:33:51,715 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:33:51,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:51,716 INFO L85 PathProgramCache]: Analyzing trace with hash -706744876, now seen corresponding path program 16 times [2024-06-14 14:33:51,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:51,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866086984] [2024-06-14 14:33:51,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:51,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:01,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-14 14:34:01,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:01,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866086984] [2024-06-14 14:34:01,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866086984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:01,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:01,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:34:01,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574447664] [2024-06-14 14:34:01,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:01,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:34:01,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:01,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:34:01,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:34:01,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:34:01,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 251 transitions, 3193 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:01,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:01,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:34:01,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:02,439 INFO L124 PetriNetUnfolderBase]: 489/919 cut-off events. [2024-06-14 14:34:02,439 INFO L125 PetriNetUnfolderBase]: For 114898/114898 co-relation queries the response was YES. [2024-06-14 14:34:02,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8268 conditions, 919 events. 489/919 cut-off events. For 114898/114898 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4817 event pairs, 38 based on Foata normal form. 1/915 useless extension candidates. Maximal degree in co-relation 8150. Up to 685 conditions per place. [2024-06-14 14:34:02,447 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 197 selfloop transitions, 65 changer transitions 0/265 dead transitions. [2024-06-14 14:34:02,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 265 transitions, 4289 flow [2024-06-14 14:34:02,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:34:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:34:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-14 14:34:02,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-14 14:34:02,450 INFO L175 Difference]: Start difference. First operand has 256 places, 251 transitions, 3193 flow. Second operand 10 states and 134 transitions. [2024-06-14 14:34:02,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 265 transitions, 4289 flow [2024-06-14 14:34:02,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 265 transitions, 4055 flow, removed 49 selfloop flow, removed 8 redundant places. [2024-06-14 14:34:02,688 INFO L231 Difference]: Finished difference. Result has 258 places, 253 transitions, 3148 flow [2024-06-14 14:34:02,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2959, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3148, PETRI_PLACES=258, PETRI_TRANSITIONS=253} [2024-06-14 14:34:02,689 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 227 predicate places. [2024-06-14 14:34:02,689 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 253 transitions, 3148 flow [2024-06-14 14:34:02,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:02,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:02,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:02,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 14:34:02,689 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:02,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash -706738118, now seen corresponding path program 9 times [2024-06-14 14:34:02,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:02,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118264102] [2024-06-14 14:34:02,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:02,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:10,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:10,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118264102] [2024-06-14 14:34:10,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118264102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:10,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:10,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:34:10,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172507909] [2024-06-14 14:34:10,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:10,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:34:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:10,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:34:10,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:34:10,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:34:10,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 253 transitions, 3148 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:10,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:10,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:34:10,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:10,877 INFO L124 PetriNetUnfolderBase]: 486/913 cut-off events. [2024-06-14 14:34:10,877 INFO L125 PetriNetUnfolderBase]: For 114115/114115 co-relation queries the response was YES. [2024-06-14 14:34:10,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8121 conditions, 913 events. 486/913 cut-off events. For 114115/114115 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4784 event pairs, 41 based on Foata normal form. 1/909 useless extension candidates. Maximal degree in co-relation 8002. Up to 714 conditions per place. [2024-06-14 14:34:10,885 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 212 selfloop transitions, 48 changer transitions 0/263 dead transitions. [2024-06-14 14:34:10,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 263 transitions, 3694 flow [2024-06-14 14:34:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:34:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:34:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 14:34:10,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-14 14:34:10,886 INFO L175 Difference]: Start difference. First operand has 258 places, 253 transitions, 3148 flow. Second operand 10 states and 129 transitions. [2024-06-14 14:34:10,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 263 transitions, 3694 flow [2024-06-14 14:34:11,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 263 transitions, 3554 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-14 14:34:11,163 INFO L231 Difference]: Finished difference. Result has 262 places, 253 transitions, 3109 flow [2024-06-14 14:34:11,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3008, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3109, PETRI_PLACES=262, PETRI_TRANSITIONS=253} [2024-06-14 14:34:11,163 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 231 predicate places. [2024-06-14 14:34:11,163 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 253 transitions, 3109 flow [2024-06-14 14:34:11,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:11,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:11,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-14 14:34:11,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 14:34:11,164 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:11,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:11,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1795475364, now seen corresponding path program 17 times [2024-06-14 14:34:11,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:11,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121091846] [2024-06-14 14:34:11,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:11,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:20,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121091846] [2024-06-14 14:34:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121091846] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:20,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:20,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:34:20,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435418284] [2024-06-14 14:34:20,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:20,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:34:20,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:20,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:34:20,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:34:20,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:34:20,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 253 transitions, 3109 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:20,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:20,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:34:20,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:20,647 INFO L124 PetriNetUnfolderBase]: 484/909 cut-off events. [2024-06-14 14:34:20,648 INFO L125 PetriNetUnfolderBase]: For 112718/112718 co-relation queries the response was YES. [2024-06-14 14:34:20,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7964 conditions, 909 events. 484/909 cut-off events. For 112718/112718 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4742 event pairs, 33 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 7844. Up to 819 conditions per place. [2024-06-14 14:34:20,656 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 243 selfloop transitions, 16 changer transitions 0/262 dead transitions. [2024-06-14 14:34:20,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 262 transitions, 3647 flow [2024-06-14 14:34:20,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:34:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:34:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 14:34:20,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 14:34:20,657 INFO L175 Difference]: Start difference. First operand has 262 places, 253 transitions, 3109 flow. Second operand 10 states and 115 transitions. [2024-06-14 14:34:20,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 262 transitions, 3647 flow [2024-06-14 14:34:20,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 262 transitions, 3508 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-14 14:34:20,907 INFO L231 Difference]: Finished difference. Result has 264 places, 253 transitions, 3007 flow [2024-06-14 14:34:20,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2970, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3007, PETRI_PLACES=264, PETRI_TRANSITIONS=253} [2024-06-14 14:34:20,908 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 233 predicate places. [2024-06-14 14:34:20,908 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 253 transitions, 3007 flow [2024-06-14 14:34:20,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:20,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:20,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:20,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 14:34:20,909 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:20,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1049698380, now seen corresponding path program 6 times [2024-06-14 14:34:20,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:20,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970636460] [2024-06-14 14:34:20,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:20,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:28,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:28,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970636460] [2024-06-14 14:34:28,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970636460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:28,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:28,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:34:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062165497] [2024-06-14 14:34:28,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:28,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:34:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:28,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:34:28,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:34:28,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:34:28,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 253 transitions, 3007 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:28,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:28,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:34:28,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:29,237 INFO L124 PetriNetUnfolderBase]: 481/902 cut-off events. [2024-06-14 14:34:29,237 INFO L125 PetriNetUnfolderBase]: For 111002/111002 co-relation queries the response was YES. [2024-06-14 14:34:29,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7681 conditions, 902 events. 481/902 cut-off events. For 111002/111002 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4680 event pairs, 32 based on Foata normal form. 2/902 useless extension candidates. Maximal degree in co-relation 7560. Up to 805 conditions per place. [2024-06-14 14:34:29,245 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 242 selfloop transitions, 19 changer transitions 0/264 dead transitions. [2024-06-14 14:34:29,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 264 transitions, 3553 flow [2024-06-14 14:34:29,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:34:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:34:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-14 14:34:29,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-14 14:34:29,248 INFO L175 Difference]: Start difference. First operand has 264 places, 253 transitions, 3007 flow. Second operand 11 states and 137 transitions. [2024-06-14 14:34:29,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 264 transitions, 3553 flow [2024-06-14 14:34:29,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 264 transitions, 3494 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 14:34:29,491 INFO L231 Difference]: Finished difference. Result has 267 places, 253 transitions, 2990 flow [2024-06-14 14:34:29,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2948, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2990, PETRI_PLACES=267, PETRI_TRANSITIONS=253} [2024-06-14 14:34:29,491 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 236 predicate places. [2024-06-14 14:34:29,491 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 253 transitions, 2990 flow [2024-06-14 14:34:29,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:29,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:29,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:29,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 14:34:29,492 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:29,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1795178446, now seen corresponding path program 10 times [2024-06-14 14:34:29,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:29,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100674458] [2024-06-14 14:34:29,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:38,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:38,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100674458] [2024-06-14 14:34:38,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100674458] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:38,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:34:38,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274622158] [2024-06-14 14:34:38,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:38,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:34:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:38,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:34:38,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:34:38,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:34:38,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 253 transitions, 2990 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:38,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:38,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:34:38,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:39,342 INFO L124 PetriNetUnfolderBase]: 479/901 cut-off events. [2024-06-14 14:34:39,343 INFO L125 PetriNetUnfolderBase]: For 105940/105940 co-relation queries the response was YES. [2024-06-14 14:34:39,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7559 conditions, 901 events. 479/901 cut-off events. For 105940/105940 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4700 event pairs, 32 based on Foata normal form. 1/900 useless extension candidates. Maximal degree in co-relation 7437. Up to 796 conditions per place. [2024-06-14 14:34:39,350 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 236 selfloop transitions, 24 changer transitions 0/263 dead transitions. [2024-06-14 14:34:39,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 263 transitions, 3532 flow [2024-06-14 14:34:39,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:34:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:34:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-14 14:34:39,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 14:34:39,351 INFO L175 Difference]: Start difference. First operand has 267 places, 253 transitions, 2990 flow. Second operand 11 states and 128 transitions. [2024-06-14 14:34:39,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 263 transitions, 3532 flow [2024-06-14 14:34:39,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 263 transitions, 3417 flow, removed 15 selfloop flow, removed 13 redundant places. [2024-06-14 14:34:39,649 INFO L231 Difference]: Finished difference. Result has 265 places, 253 transitions, 2928 flow [2024-06-14 14:34:39,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2875, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2928, PETRI_PLACES=265, PETRI_TRANSITIONS=253} [2024-06-14 14:34:39,650 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 234 predicate places. [2024-06-14 14:34:39,650 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 253 transitions, 2928 flow [2024-06-14 14:34:39,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:39,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:39,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:39,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 14:34:39,650 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:39,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:39,652 INFO L85 PathProgramCache]: Analyzing trace with hash -635276989, now seen corresponding path program 1 times [2024-06-14 14:34:39,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:39,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149818174] [2024-06-14 14:34:39,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:39,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:48,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:48,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149818174] [2024-06-14 14:34:48,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149818174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:48,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:48,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:34:48,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342542128] [2024-06-14 14:34:48,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:48,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:34:48,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:48,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:34:48,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:34:48,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:34:48,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 253 transitions, 2928 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:48,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:48,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:34:48,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:48,675 INFO L124 PetriNetUnfolderBase]: 483/909 cut-off events. [2024-06-14 14:34:48,675 INFO L125 PetriNetUnfolderBase]: For 112040/112040 co-relation queries the response was YES. [2024-06-14 14:34:48,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7599 conditions, 909 events. 483/909 cut-off events. For 112040/112040 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4753 event pairs, 13 based on Foata normal form. 2/909 useless extension candidates. Maximal degree in co-relation 7477. Up to 761 conditions per place. [2024-06-14 14:34:48,684 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 250 selfloop transitions, 20 changer transitions 0/273 dead transitions. [2024-06-14 14:34:48,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 273 transitions, 3544 flow [2024-06-14 14:34:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:34:48,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:34:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 14:34:48,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 14:34:48,686 INFO L175 Difference]: Start difference. First operand has 265 places, 253 transitions, 2928 flow. Second operand 10 states and 123 transitions. [2024-06-14 14:34:48,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 273 transitions, 3544 flow [2024-06-14 14:34:48,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 273 transitions, 3461 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-14 14:34:48,948 INFO L231 Difference]: Finished difference. Result has 264 places, 254 transitions, 2917 flow [2024-06-14 14:34:48,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2845, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2917, PETRI_PLACES=264, PETRI_TRANSITIONS=254} [2024-06-14 14:34:48,948 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 233 predicate places. [2024-06-14 14:34:48,949 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 254 transitions, 2917 flow [2024-06-14 14:34:48,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:48,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:48,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:48,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 14:34:48,949 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:48,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1535897479, now seen corresponding path program 2 times [2024-06-14 14:34:48,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:48,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040632201] [2024-06-14 14:34:48,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:48,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:58,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:58,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040632201] [2024-06-14 14:34:58,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040632201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:58,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:58,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:34:58,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059731688] [2024-06-14 14:34:58,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:58,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:34:58,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:58,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:34:58,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:34:58,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:34:58,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 254 transitions, 2917 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:58,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:58,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:34:58,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:59,210 INFO L124 PetriNetUnfolderBase]: 487/915 cut-off events. [2024-06-14 14:34:59,210 INFO L125 PetriNetUnfolderBase]: For 114753/114753 co-relation queries the response was YES. [2024-06-14 14:34:59,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7671 conditions, 915 events. 487/915 cut-off events. For 114753/114753 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4780 event pairs, 27 based on Foata normal form. 2/915 useless extension candidates. Maximal degree in co-relation 7549. Up to 786 conditions per place. [2024-06-14 14:34:59,219 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 249 selfloop transitions, 21 changer transitions 0/273 dead transitions. [2024-06-14 14:34:59,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 273 transitions, 3533 flow [2024-06-14 14:34:59,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:34:59,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:34:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 14:34:59,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 14:34:59,219 INFO L175 Difference]: Start difference. First operand has 264 places, 254 transitions, 2917 flow. Second operand 10 states and 124 transitions. [2024-06-14 14:34:59,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 273 transitions, 3533 flow [2024-06-14 14:34:59,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 273 transitions, 3471 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 14:34:59,494 INFO L231 Difference]: Finished difference. Result has 266 places, 255 transitions, 2931 flow [2024-06-14 14:34:59,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2931, PETRI_PLACES=266, PETRI_TRANSITIONS=255} [2024-06-14 14:34:59,494 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 235 predicate places. [2024-06-14 14:34:59,494 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 255 transitions, 2931 flow [2024-06-14 14:34:59,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:59,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:59,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:34:59,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 14:34:59,495 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:59,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1622737159, now seen corresponding path program 3 times [2024-06-14 14:34:59,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:59,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922307907] [2024-06-14 14:34:59,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:07,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:07,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922307907] [2024-06-14 14:35:07,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922307907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:07,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:07,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:35:07,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112711733] [2024-06-14 14:35:07,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:07,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:35:07,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:07,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:35:07,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:35:07,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:35:07,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 255 transitions, 2931 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:07,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:07,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:35:07,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:08,040 INFO L124 PetriNetUnfolderBase]: 491/923 cut-off events. [2024-06-14 14:35:08,040 INFO L125 PetriNetUnfolderBase]: For 119335/119335 co-relation queries the response was YES. [2024-06-14 14:35:08,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7737 conditions, 923 events. 491/923 cut-off events. For 119335/119335 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4858 event pairs, 29 based on Foata normal form. 2/923 useless extension candidates. Maximal degree in co-relation 7614. Up to 799 conditions per place. [2024-06-14 14:35:08,048 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 248 selfloop transitions, 22 changer transitions 0/273 dead transitions. [2024-06-14 14:35:08,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 273 transitions, 3547 flow [2024-06-14 14:35:08,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:35:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:35:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 14:35:08,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 14:35:08,050 INFO L175 Difference]: Start difference. First operand has 266 places, 255 transitions, 2931 flow. Second operand 10 states and 124 transitions. [2024-06-14 14:35:08,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 273 transitions, 3547 flow [2024-06-14 14:35:08,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 273 transitions, 3481 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 14:35:08,315 INFO L231 Difference]: Finished difference. Result has 268 places, 256 transitions, 2945 flow [2024-06-14 14:35:08,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2865, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2945, PETRI_PLACES=268, PETRI_TRANSITIONS=256} [2024-06-14 14:35:08,316 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 237 predicate places. [2024-06-14 14:35:08,316 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 256 transitions, 2945 flow [2024-06-14 14:35:08,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:08,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:08,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:08,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 14:35:08,323 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:08,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:08,323 INFO L85 PathProgramCache]: Analyzing trace with hash 907158513, now seen corresponding path program 4 times [2024-06-14 14:35:08,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:08,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868737228] [2024-06-14 14:35:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:08,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:16,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:16,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868737228] [2024-06-14 14:35:16,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868737228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:16,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:16,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:35:16,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500792752] [2024-06-14 14:35:16,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:16,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:35:16,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:16,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:35:16,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:35:16,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:35:16,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 256 transitions, 2945 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:16,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:16,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:35:16,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:17,376 INFO L124 PetriNetUnfolderBase]: 495/931 cut-off events. [2024-06-14 14:35:17,377 INFO L125 PetriNetUnfolderBase]: For 122092/122092 co-relation queries the response was YES. [2024-06-14 14:35:17,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7803 conditions, 931 events. 495/931 cut-off events. For 122092/122092 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4910 event pairs, 29 based on Foata normal form. 2/931 useless extension candidates. Maximal degree in co-relation 7679. Up to 804 conditions per place. [2024-06-14 14:35:17,385 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 243 selfloop transitions, 25 changer transitions 0/271 dead transitions. [2024-06-14 14:35:17,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 271 transitions, 3547 flow [2024-06-14 14:35:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:35:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:35:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 14:35:17,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 14:35:17,388 INFO L175 Difference]: Start difference. First operand has 268 places, 256 transitions, 2945 flow. Second operand 10 states and 123 transitions. [2024-06-14 14:35:17,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 271 transitions, 3547 flow [2024-06-14 14:35:17,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 271 transitions, 3477 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-14 14:35:17,731 INFO L231 Difference]: Finished difference. Result has 270 places, 257 transitions, 2963 flow [2024-06-14 14:35:17,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2875, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2963, PETRI_PLACES=270, PETRI_TRANSITIONS=257} [2024-06-14 14:35:17,732 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 239 predicate places. [2024-06-14 14:35:17,732 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 257 transitions, 2963 flow [2024-06-14 14:35:17,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:17,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:17,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:17,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 14:35:17,733 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:17,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash 901796133, now seen corresponding path program 5 times [2024-06-14 14:35:17,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:17,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62716785] [2024-06-14 14:35:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:28,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:28,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62716785] [2024-06-14 14:35:28,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62716785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:28,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:28,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:35:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107070915] [2024-06-14 14:35:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:28,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:35:28,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:28,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:35:28,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:35:28,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:35:28,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 257 transitions, 2963 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:28,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:28,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:35:28,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:29,240 INFO L124 PetriNetUnfolderBase]: 499/939 cut-off events. [2024-06-14 14:35:29,240 INFO L125 PetriNetUnfolderBase]: For 124756/124756 co-relation queries the response was YES. [2024-06-14 14:35:29,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7872 conditions, 939 events. 499/939 cut-off events. For 124756/124756 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 4988 event pairs, 31 based on Foata normal form. 2/939 useless extension candidates. Maximal degree in co-relation 7747. Up to 820 conditions per place. [2024-06-14 14:35:29,249 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 246 selfloop transitions, 24 changer transitions 0/273 dead transitions. [2024-06-14 14:35:29,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 273 transitions, 3584 flow [2024-06-14 14:35:29,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:35:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:35:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 14:35:29,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-14 14:35:29,250 INFO L175 Difference]: Start difference. First operand has 270 places, 257 transitions, 2963 flow. Second operand 10 states and 121 transitions. [2024-06-14 14:35:29,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 273 transitions, 3584 flow [2024-06-14 14:35:29,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 273 transitions, 3504 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 14:35:29,531 INFO L231 Difference]: Finished difference. Result has 273 places, 259 transitions, 2989 flow [2024-06-14 14:35:29,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2885, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2989, PETRI_PLACES=273, PETRI_TRANSITIONS=259} [2024-06-14 14:35:29,532 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 242 predicate places. [2024-06-14 14:35:29,532 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 259 transitions, 2989 flow [2024-06-14 14:35:29,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:29,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:29,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:29,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 14:35:29,532 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:29,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:29,532 INFO L85 PathProgramCache]: Analyzing trace with hash 901648263, now seen corresponding path program 6 times [2024-06-14 14:35:29,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:29,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273947446] [2024-06-14 14:35:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:38,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:38,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273947446] [2024-06-14 14:35:38,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273947446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:38,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:38,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:35:38,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772654325] [2024-06-14 14:35:38,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:38,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:35:38,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:38,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:35:38,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:35:38,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:35:38,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 259 transitions, 2989 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:38,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:38,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:35:38,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:39,031 INFO L124 PetriNetUnfolderBase]: 503/947 cut-off events. [2024-06-14 14:35:39,031 INFO L125 PetriNetUnfolderBase]: For 127608/127608 co-relation queries the response was YES. [2024-06-14 14:35:39,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7939 conditions, 947 events. 503/947 cut-off events. For 127608/127608 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5057 event pairs, 29 based on Foata normal form. 2/947 useless extension candidates. Maximal degree in co-relation 7812. Up to 805 conditions per place. [2024-06-14 14:35:39,040 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 249 selfloop transitions, 24 changer transitions 0/276 dead transitions. [2024-06-14 14:35:39,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 276 transitions, 3613 flow [2024-06-14 14:35:39,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:35:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:35:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 14:35:39,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 14:35:39,041 INFO L175 Difference]: Start difference. First operand has 273 places, 259 transitions, 2989 flow. Second operand 10 states and 123 transitions. [2024-06-14 14:35:39,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 276 transitions, 3613 flow [2024-06-14 14:35:39,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 276 transitions, 3538 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 14:35:39,357 INFO L231 Difference]: Finished difference. Result has 276 places, 260 transitions, 3004 flow [2024-06-14 14:35:39,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2914, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3004, PETRI_PLACES=276, PETRI_TRANSITIONS=260} [2024-06-14 14:35:39,357 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 245 predicate places. [2024-06-14 14:35:39,358 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 260 transitions, 3004 flow [2024-06-14 14:35:39,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:39,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:39,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:39,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 14:35:39,358 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:39,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:39,360 INFO L85 PathProgramCache]: Analyzing trace with hash 907164465, now seen corresponding path program 1 times [2024-06-14 14:35:39,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:39,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867779398] [2024-06-14 14:35:39,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:39,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:51,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:51,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867779398] [2024-06-14 14:35:51,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867779398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:51,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:51,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:35:51,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723442786] [2024-06-14 14:35:51,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:51,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:35:51,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:51,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:35:51,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:35:51,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:35:51,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 260 transitions, 3004 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:51,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:51,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:35:51,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:52,087 INFO L124 PetriNetUnfolderBase]: 506/952 cut-off events. [2024-06-14 14:35:52,088 INFO L125 PetriNetUnfolderBase]: For 125809/125809 co-relation queries the response was YES. [2024-06-14 14:35:52,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7975 conditions, 952 events. 506/952 cut-off events. For 125809/125809 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5073 event pairs, 31 based on Foata normal form. 1/951 useless extension candidates. Maximal degree in co-relation 7847. Up to 816 conditions per place. [2024-06-14 14:35:52,096 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 241 selfloop transitions, 32 changer transitions 0/276 dead transitions. [2024-06-14 14:35:52,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 276 transitions, 3634 flow [2024-06-14 14:35:52,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:35:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:35:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 14:35:52,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 14:35:52,097 INFO L175 Difference]: Start difference. First operand has 276 places, 260 transitions, 3004 flow. Second operand 11 states and 135 transitions. [2024-06-14 14:35:52,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 276 transitions, 3634 flow [2024-06-14 14:35:52,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 276 transitions, 3554 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 14:35:52,377 INFO L231 Difference]: Finished difference. Result has 279 places, 262 transitions, 3047 flow [2024-06-14 14:35:52,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2924, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3047, PETRI_PLACES=279, PETRI_TRANSITIONS=262} [2024-06-14 14:35:52,378 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 248 predicate places. [2024-06-14 14:35:52,378 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 262 transitions, 3047 flow [2024-06-14 14:35:52,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:52,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:52,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:35:52,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 14:35:52,378 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:52,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:52,379 INFO L85 PathProgramCache]: Analyzing trace with hash 907366275, now seen corresponding path program 2 times [2024-06-14 14:35:52,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:52,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727882429] [2024-06-14 14:35:52,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:52,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:01,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-14 14:36:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:01,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727882429] [2024-06-14 14:36:01,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727882429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:01,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:01,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:36:01,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894412862] [2024-06-14 14:36:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:01,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:36:01,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:01,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:36:01,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:36:01,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:36:01,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 262 transitions, 3047 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:01,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:01,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:36:01,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:02,395 INFO L124 PetriNetUnfolderBase]: 504/949 cut-off events. [2024-06-14 14:36:02,396 INFO L125 PetriNetUnfolderBase]: For 123536/123536 co-relation queries the response was YES. [2024-06-14 14:36:02,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7839 conditions, 949 events. 504/949 cut-off events. For 123536/123536 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5067 event pairs, 31 based on Foata normal form. 1/948 useless extension candidates. Maximal degree in co-relation 7710. Up to 813 conditions per place. [2024-06-14 14:36:02,406 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 240 selfloop transitions, 33 changer transitions 0/276 dead transitions. [2024-06-14 14:36:02,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 276 transitions, 3627 flow [2024-06-14 14:36:02,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:36:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:36:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 14:36:02,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-14 14:36:02,407 INFO L175 Difference]: Start difference. First operand has 279 places, 262 transitions, 3047 flow. Second operand 11 states and 134 transitions. [2024-06-14 14:36:02,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 276 transitions, 3627 flow [2024-06-14 14:36:02,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 276 transitions, 3496 flow, removed 35 selfloop flow, removed 9 redundant places. [2024-06-14 14:36:02,745 INFO L231 Difference]: Finished difference. Result has 281 places, 262 transitions, 2987 flow [2024-06-14 14:36:02,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2916, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2987, PETRI_PLACES=281, PETRI_TRANSITIONS=262} [2024-06-14 14:36:02,745 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 250 predicate places. [2024-06-14 14:36:02,745 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 262 transitions, 2987 flow [2024-06-14 14:36:02,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:02,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:02,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:02,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 14:36:02,746 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:02,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:02,746 INFO L85 PathProgramCache]: Analyzing trace with hash 888939968, now seen corresponding path program 1 times [2024-06-14 14:36:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:02,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844723036] [2024-06-14 14:36:02,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:02,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:11,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:11,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844723036] [2024-06-14 14:36:11,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844723036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:11,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:11,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:36:11,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493354507] [2024-06-14 14:36:11,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:11,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:36:11,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:11,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:36:11,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:36:11,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:36:11,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 262 transitions, 2987 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:11,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:11,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:36:11,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:12,272 INFO L124 PetriNetUnfolderBase]: 520/985 cut-off events. [2024-06-14 14:36:12,272 INFO L125 PetriNetUnfolderBase]: For 165031/165031 co-relation queries the response was YES. [2024-06-14 14:36:12,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8032 conditions, 985 events. 520/985 cut-off events. For 165031/165031 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5312 event pairs, 35 based on Foata normal form. 10/993 useless extension candidates. Maximal degree in co-relation 7902. Up to 817 conditions per place. [2024-06-14 14:36:12,282 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 245 selfloop transitions, 29 changer transitions 4/281 dead transitions. [2024-06-14 14:36:12,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 281 transitions, 3665 flow [2024-06-14 14:36:12,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:36:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:36:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 14:36:12,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 14:36:12,283 INFO L175 Difference]: Start difference. First operand has 281 places, 262 transitions, 2987 flow. Second operand 11 states and 138 transitions. [2024-06-14 14:36:12,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 281 transitions, 3665 flow [2024-06-14 14:36:12,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 281 transitions, 3558 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-14 14:36:12,643 INFO L231 Difference]: Finished difference. Result has 282 places, 262 transitions, 2962 flow [2024-06-14 14:36:12,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2880, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2962, PETRI_PLACES=282, PETRI_TRANSITIONS=262} [2024-06-14 14:36:12,643 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 251 predicate places. [2024-06-14 14:36:12,643 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 262 transitions, 2962 flow [2024-06-14 14:36:12,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:12,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:12,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:12,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 14:36:12,644 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:12,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1940943781, now seen corresponding path program 7 times [2024-06-14 14:36:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:12,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706768221] [2024-06-14 14:36:12,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:12,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:23,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:23,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706768221] [2024-06-14 14:36:23,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706768221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:23,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:23,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:36:23,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182053664] [2024-06-14 14:36:23,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:23,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:36:23,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:23,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:36:23,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:36:23,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:36:23,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 262 transitions, 2962 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:23,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:23,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:36:23,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:24,109 INFO L124 PetriNetUnfolderBase]: 518/983 cut-off events. [2024-06-14 14:36:24,109 INFO L125 PetriNetUnfolderBase]: For 134233/134233 co-relation queries the response was YES. [2024-06-14 14:36:24,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8059 conditions, 983 events. 518/983 cut-off events. For 134233/134233 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5308 event pairs, 37 based on Foata normal form. 2/983 useless extension candidates. Maximal degree in co-relation 7928. Up to 827 conditions per place. [2024-06-14 14:36:24,120 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 236 selfloop transitions, 36 changer transitions 0/275 dead transitions. [2024-06-14 14:36:24,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 275 transitions, 3572 flow [2024-06-14 14:36:24,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:36:24,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:36:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 14:36:24,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 14:36:24,123 INFO L175 Difference]: Start difference. First operand has 282 places, 262 transitions, 2962 flow. Second operand 10 states and 123 transitions. [2024-06-14 14:36:24,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 275 transitions, 3572 flow [2024-06-14 14:36:24,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 275 transitions, 3470 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-14 14:36:24,464 INFO L231 Difference]: Finished difference. Result has 282 places, 263 transitions, 2976 flow [2024-06-14 14:36:24,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2860, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2976, PETRI_PLACES=282, PETRI_TRANSITIONS=263} [2024-06-14 14:36:24,464 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 251 predicate places. [2024-06-14 14:36:24,464 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 263 transitions, 2976 flow [2024-06-14 14:36:24,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:24,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:24,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:24,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 14:36:24,465 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:24,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:24,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1741641991, now seen corresponding path program 8 times [2024-06-14 14:36:24,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:24,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377625243] [2024-06-14 14:36:24,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:24,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15