./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.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/mix031.oepc.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/mix031.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix031.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 15:04:44,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:04:44,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:04:44,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:04:44,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:04:44,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:04:44,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:04:44,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:04:44,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:04:44,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:04:44,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:04:44,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:04:44,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:04:44,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:04:44,626 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:04:44,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:04:44,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:04:44,627 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:04:44,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:04:44,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:04:44,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:04:44,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:04:44,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:04:44,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:04:44,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:04:44,632 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:04:44,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:04:44,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:04:44,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:04:44,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:04:44,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:04:44,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:04:44,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:04:44,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:04:44,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:04:44,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:04:44,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:04:44,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:04:44,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:04:44,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:04:44,638 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:04:44,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:04:44,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:04:44,639 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 15:04:44,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:04:44,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:04:44,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:04:44,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:04:44,831 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:04:44,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2024-06-14 15:04:45,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:04:45,981 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:04:45,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2024-06-14 15:04:45,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b0d778ce/36d7a7d86d8d4872a7459f9cb2345edd/FLAG9954b3222 [2024-06-14 15:04:46,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b0d778ce/36d7a7d86d8d4872a7459f9cb2345edd [2024-06-14 15:04:46,382 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:04:46,382 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:04:46,383 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/mix031.oepc.yml/witness.yml [2024-06-14 15:04:46,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:04:46,511 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:04:46,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:04:46,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:04:46,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:04:46,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:04:46" (1/2) ... [2024-06-14 15:04:46,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d8429a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:04:46, skipping insertion in model container [2024-06-14 15:04:46,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:04:46" (1/2) ... [2024-06-14 15:04:46,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1fc7b548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:04:46, skipping insertion in model container [2024-06-14 15:04:46,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:04:46" (2/2) ... [2024-06-14 15:04:46,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d8429a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:46, skipping insertion in model container [2024-06-14 15:04:46,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:04:46" (2/2) ... [2024-06-14 15:04:46,520 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:04:46,574 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:04:46,576 INFO L97 edCorrectnessWitness]: Location invariant before [L831-L831] (((((((((((((((((((! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$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)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:04:46,576 INFO L97 edCorrectnessWitness]: Location invariant before [L830-L830] (((((((((((((((((((! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$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)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:04:46,577 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:04:46,577 INFO L106 edCorrectnessWitness]: ghost_update [L828-L828] multithreaded = 1; [2024-06-14 15:04:46,617 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:04:46,868 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:04:46,881 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:04:47,195 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:04:47,238 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:04:47,239 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:47 WrapperNode [2024-06-14 15:04:47,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:04:47,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:04:47,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:04:47,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:04:47,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:47" (1/1) ... [2024-06-14 15:04:47,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:47" (1/1) ... [2024-06-14 15:04:47,349 INFO L138 Inliner]: procedures = 174, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 123 [2024-06-14 15:04:47,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:04:47,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:04:47,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:04:47,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:04:47,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:47" (1/1) ... [2024-06-14 15:04:47,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:47" (1/1) ... [2024-06-14 15:04:47,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:47" (1/1) ... [2024-06-14 15:04:47,418 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 15:04:47,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:47" (1/1) ... [2024-06-14 15:04:47,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:47" (1/1) ... [2024-06-14 15:04:47,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:47" (1/1) ... [2024-06-14 15:04:47,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:47" (1/1) ... [2024-06-14 15:04:47,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:47" (1/1) ... [2024-06-14 15:04:47,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:47" (1/1) ... [2024-06-14 15:04:47,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:04:47,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:04:47,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:04:47,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:04:47,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:47" (1/1) ... [2024-06-14 15:04:47,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:04:47,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:04:47,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 15:04:47,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 15:04:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:04:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:04:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:04:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:04:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:04:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:04:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:04:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:04:47,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:04:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:04:47,552 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:04:47,670 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:04:47,671 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:04:48,530 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:04:48,534 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:04:48,718 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:04:48,718 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:04:48,720 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:04:48 BoogieIcfgContainer [2024-06-14 15:04:48,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:04:48,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:04:48,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:04:48,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:04:48,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:04:46" (1/4) ... [2024-06-14 15:04:48,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3f67fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:04:48, skipping insertion in model container [2024-06-14 15:04:48,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:04:46" (2/4) ... [2024-06-14 15:04:48,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3f67fb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:04:48, skipping insertion in model container [2024-06-14 15:04:48,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:47" (3/4) ... [2024-06-14 15:04:48,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3f67fb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:04:48, skipping insertion in model container [2024-06-14 15:04:48,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:04:48" (4/4) ... [2024-06-14 15:04:48,728 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2024-06-14 15:04:48,740 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:04:48,741 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:04:48,741 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:04:48,819 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:04:48,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 76 flow [2024-06-14 15:04:48,898 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2024-06-14 15:04:48,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:04:48,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:04:48,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 34 transitions, 76 flow [2024-06-14 15:04:48,904 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 58 flow [2024-06-14 15:04:48,915 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:04:48,922 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;@726e4503, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:04:48,922 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:04:48,929 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:04:48,929 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-14 15:04:48,929 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:04:48,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:48,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:04:48,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:04:48,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:48,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1966790300, now seen corresponding path program 1 times [2024-06-14 15:04:48,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:48,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20670294] [2024-06-14 15:04:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:54,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:04:54,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:54,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20670294] [2024-06-14 15:04:54,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20670294] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:54,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:54,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:04:54,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469741928] [2024-06-14 15:04:54,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:54,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:04:54,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:54,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:04:54,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:04:54,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-06-14 15:04:54,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:04:54,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:54,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-06-14 15:04:54,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:54,677 INFO L124 PetriNetUnfolderBase]: 189/360 cut-off events. [2024-06-14 15:04:54,678 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-14 15:04:54,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 360 events. 189/360 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1418 event pairs, 115 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 704. Up to 333 conditions per place. [2024-06-14 15:04:54,682 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 24 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2024-06-14 15:04:54,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 127 flow [2024-06-14 15:04:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:04:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:04:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-06-14 15:04:54,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2024-06-14 15:04:54,692 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 58 flow. Second operand 3 states and 59 transitions. [2024-06-14 15:04:54,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 127 flow [2024-06-14 15:04:54,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 15:04:54,696 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 77 flow [2024-06-14 15:04:54,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-06-14 15:04:54,699 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2024-06-14 15:04:54,700 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 77 flow [2024-06-14 15:04:54,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:04:54,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:54,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:54,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:04:54,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:04:54,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash 299908411, now seen corresponding path program 1 times [2024-06-14 15:04:54,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:54,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970038025] [2024-06-14 15:04:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:04:58,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:58,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970038025] [2024-06-14 15:04:58,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970038025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:58,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:58,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:04:58,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562625253] [2024-06-14 15:04:58,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:58,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:04:58,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:58,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:04:58,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:04:58,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-06-14 15:04:58,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:04:58,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:58,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-06-14 15:04:58,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:58,826 INFO L124 PetriNetUnfolderBase]: 186/355 cut-off events. [2024-06-14 15:04:58,826 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-06-14 15:04:58,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 355 events. 186/355 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1411 event pairs, 94 based on Foata normal form. 2/349 useless extension candidates. Maximal degree in co-relation 784. Up to 319 conditions per place. [2024-06-14 15:04:58,831 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 28 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2024-06-14 15:04:58,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 169 flow [2024-06-14 15:04:58,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:04:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:04:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2024-06-14 15:04:58,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5514705882352942 [2024-06-14 15:04:58,835 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 77 flow. Second operand 4 states and 75 transitions. [2024-06-14 15:04:58,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 169 flow [2024-06-14 15:04:58,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:04:58,837 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2024-06-14 15:04:58,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2024-06-14 15:04:58,838 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2024-06-14 15:04:58,839 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2024-06-14 15:04:58,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:04:58,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:58,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:58,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:04:58,840 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:04:58,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:58,843 INFO L85 PathProgramCache]: Analyzing trace with hash 707227471, now seen corresponding path program 1 times [2024-06-14 15:04:58,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:58,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890218238] [2024-06-14 15:04:58,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:58,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:05:02,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:02,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890218238] [2024-06-14 15:05:02,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890218238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:02,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:02,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:05:02,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427367419] [2024-06-14 15:05:02,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:02,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:05:02,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:02,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:05:02,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:05:02,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-06-14 15:05:02,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:02,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:02,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-06-14 15:05:02,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:03,127 INFO L124 PetriNetUnfolderBase]: 219/413 cut-off events. [2024-06-14 15:05:03,127 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2024-06-14 15:05:03,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 413 events. 219/413 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1636 event pairs, 99 based on Foata normal form. 2/412 useless extension candidates. Maximal degree in co-relation 1004. Up to 366 conditions per place. [2024-06-14 15:05:03,130 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 33 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2024-06-14 15:05:03,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 219 flow [2024-06-14 15:05:03,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:05:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:05:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-14 15:05:03,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117647058823529 [2024-06-14 15:05:03,131 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 5 states and 87 transitions. [2024-06-14 15:05:03,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 219 flow [2024-06-14 15:05:03,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 210 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 15:05:03,133 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 125 flow [2024-06-14 15:05:03,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-06-14 15:05:03,134 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2024-06-14 15:05:03,134 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 125 flow [2024-06-14 15:05:03,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:03,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:03,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:03,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:05:03,135 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:05:03,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash 449216474, now seen corresponding path program 1 times [2024-06-14 15:05:03,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:03,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933868832] [2024-06-14 15:05:03,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:03,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:05:06,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:06,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933868832] [2024-06-14 15:05:06,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933868832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:06,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:06,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:05:06,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762764741] [2024-06-14 15:05:06,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:06,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:05:06,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:06,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:05:06,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:05:06,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-06-14 15:05:06,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:06,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:06,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-06-14 15:05:06,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:06,990 INFO L124 PetriNetUnfolderBase]: 216/410 cut-off events. [2024-06-14 15:05:06,990 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2024-06-14 15:05:06,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 410 events. 216/410 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1612 event pairs, 78 based on Foata normal form. 2/408 useless extension candidates. Maximal degree in co-relation 1084. Up to 352 conditions per place. [2024-06-14 15:05:06,992 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 37 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2024-06-14 15:05:06,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 267 flow [2024-06-14 15:05:06,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:05:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:05:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-14 15:05:06,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-14 15:05:06,995 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 125 flow. Second operand 6 states and 102 transitions. [2024-06-14 15:05:06,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 267 flow [2024-06-14 15:05:06,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 252 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 15:05:06,997 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 149 flow [2024-06-14 15:05:06,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2024-06-14 15:05:06,997 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2024-06-14 15:05:06,997 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 149 flow [2024-06-14 15:05:06,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:06,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:06,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:06,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:05:06,998 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:05:06,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:06,999 INFO L85 PathProgramCache]: Analyzing trace with hash 198722588, now seen corresponding path program 1 times [2024-06-14 15:05:06,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:06,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067803921] [2024-06-14 15:05:06,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:06,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:05:15,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:15,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067803921] [2024-06-14 15:05:15,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067803921] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:15,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:15,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:05:15,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404177010] [2024-06-14 15:05:15,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:15,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:05:15,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:15,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:05:15,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:05:15,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-14 15:05:15,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:15,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:15,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-14 15:05:15,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:15,673 INFO L124 PetriNetUnfolderBase]: 230/443 cut-off events. [2024-06-14 15:05:15,673 INFO L125 PetriNetUnfolderBase]: For 629/629 co-relation queries the response was YES. [2024-06-14 15:05:15,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 443 events. 230/443 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1732 event pairs, 100 based on Foata normal form. 1/444 useless extension candidates. Maximal degree in co-relation 1249. Up to 402 conditions per place. [2024-06-14 15:05:15,675 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 30 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2024-06-14 15:05:15,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 239 flow [2024-06-14 15:05:15,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:05:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:05:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-06-14 15:05:15,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4235294117647059 [2024-06-14 15:05:15,677 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 149 flow. Second operand 5 states and 72 transitions. [2024-06-14 15:05:15,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 239 flow [2024-06-14 15:05:15,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 218 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:05:15,679 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 155 flow [2024-06-14 15:05:15,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2024-06-14 15:05:15,680 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2024-06-14 15:05:15,680 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 155 flow [2024-06-14 15:05:15,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:15,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:15,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:15,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:05:15,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:05:15,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:15,681 INFO L85 PathProgramCache]: Analyzing trace with hash -420875807, now seen corresponding path program 1 times [2024-06-14 15:05:15,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:15,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864809512] [2024-06-14 15:05:15,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:15,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:05:20,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:20,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864809512] [2024-06-14 15:05:20,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864809512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:20,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:20,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:05:20,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412026412] [2024-06-14 15:05:20,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:20,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:05:20,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:20,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:05:20,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:05:20,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-14 15:05:20,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 155 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:20,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:20,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-14 15:05:20,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:20,636 INFO L124 PetriNetUnfolderBase]: 244/454 cut-off events. [2024-06-14 15:05:20,636 INFO L125 PetriNetUnfolderBase]: For 839/839 co-relation queries the response was YES. [2024-06-14 15:05:20,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 454 events. 244/454 cut-off events. For 839/839 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1735 event pairs, 61 based on Foata normal form. 2/456 useless extension candidates. Maximal degree in co-relation 1348. Up to 382 conditions per place. [2024-06-14 15:05:20,640 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 48 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2024-06-14 15:05:20,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 355 flow [2024-06-14 15:05:20,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:05:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:05:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-14 15:05:20,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45955882352941174 [2024-06-14 15:05:20,642 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 155 flow. Second operand 8 states and 125 transitions. [2024-06-14 15:05:20,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 355 flow [2024-06-14 15:05:20,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 344 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 15:05:20,647 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 204 flow [2024-06-14 15:05:20,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=204, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-06-14 15:05:20,649 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2024-06-14 15:05:20,650 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 204 flow [2024-06-14 15:05:20,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:20,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:20,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:20,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:05:20,651 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:05:20,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1846665422, now seen corresponding path program 1 times [2024-06-14 15:05:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:20,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011616520] [2024-06-14 15:05:20,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:29,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 15:05:29,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:29,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011616520] [2024-06-14 15:05:29,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011616520] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:29,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:29,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:05:29,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578521091] [2024-06-14 15:05:29,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:29,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:05:29,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:29,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:05:29,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:05:29,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:05:29,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 204 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:29,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:29,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:05:29,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:30,223 INFO L124 PetriNetUnfolderBase]: 258/473 cut-off events. [2024-06-14 15:05:30,223 INFO L125 PetriNetUnfolderBase]: For 1313/1313 co-relation queries the response was YES. [2024-06-14 15:05:30,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 473 events. 258/473 cut-off events. For 1313/1313 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1789 event pairs, 71 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 1575. Up to 449 conditions per place. [2024-06-14 15:05:30,225 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 36 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-14 15:05:30,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 314 flow [2024-06-14 15:05:30,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:05:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:05:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-06-14 15:05:30,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-14 15:05:30,226 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 204 flow. Second operand 6 states and 78 transitions. [2024-06-14 15:05:30,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 314 flow [2024-06-14 15:05:30,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 285 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 15:05:30,228 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 208 flow [2024-06-14 15:05:30,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-14 15:05:30,229 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2024-06-14 15:05:30,229 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 208 flow [2024-06-14 15:05:30,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:30,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:30,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:30,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:05:30,230 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:05:30,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:30,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1993595485, now seen corresponding path program 1 times [2024-06-14 15:05:30,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:30,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955007902] [2024-06-14 15:05:30,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:30,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:05:37,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:37,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955007902] [2024-06-14 15:05:37,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955007902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:37,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:37,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:05:37,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628956196] [2024-06-14 15:05:37,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:37,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:05:37,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:37,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:05:37,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:05:37,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-14 15:05:37,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:37,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:37,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-14 15:05:37,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:37,898 INFO L124 PetriNetUnfolderBase]: 244/461 cut-off events. [2024-06-14 15:05:37,899 INFO L125 PetriNetUnfolderBase]: For 1717/1717 co-relation queries the response was YES. [2024-06-14 15:05:37,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 461 events. 244/461 cut-off events. For 1717/1717 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1777 event pairs, 68 based on Foata normal form. 1/462 useless extension candidates. Maximal degree in co-relation 1595. Up to 399 conditions per place. [2024-06-14 15:05:37,901 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 39 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2024-06-14 15:05:37,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 362 flow [2024-06-14 15:05:37,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:05:37,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:05:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2024-06-14 15:05:37,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4362745098039216 [2024-06-14 15:05:37,903 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 208 flow. Second operand 6 states and 89 transitions. [2024-06-14 15:05:37,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 362 flow [2024-06-14 15:05:37,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 345 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:05:37,907 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 238 flow [2024-06-14 15:05:37,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-14 15:05:37,909 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2024-06-14 15:05:37,910 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 238 flow [2024-06-14 15:05:37,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:37,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:37,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:37,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:05:37,910 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:05:37,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:37,911 INFO L85 PathProgramCache]: Analyzing trace with hash -162246683, now seen corresponding path program 1 times [2024-06-14 15:05:37,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:37,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169012114] [2024-06-14 15:05:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:37,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:05:42,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:42,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169012114] [2024-06-14 15:05:42,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169012114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:42,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:42,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:05:42,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479223860] [2024-06-14 15:05:42,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:42,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:05:42,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:42,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:05:42,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:05:42,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-14 15:05:42,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 238 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:42,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:42,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-14 15:05:42,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:43,318 INFO L124 PetriNetUnfolderBase]: 258/471 cut-off events. [2024-06-14 15:05:43,318 INFO L125 PetriNetUnfolderBase]: For 2159/2159 co-relation queries the response was YES. [2024-06-14 15:05:43,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 471 events. 258/471 cut-off events. For 2159/2159 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1748 event pairs, 45 based on Foata normal form. 4/475 useless extension candidates. Maximal degree in co-relation 1708. Up to 376 conditions per place. [2024-06-14 15:05:43,321 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 53 selfloop transitions, 14 changer transitions 0/71 dead transitions. [2024-06-14 15:05:43,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 424 flow [2024-06-14 15:05:43,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:05:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:05:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2024-06-14 15:05:43,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43790849673202614 [2024-06-14 15:05:43,323 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 238 flow. Second operand 9 states and 134 transitions. [2024-06-14 15:05:43,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 424 flow [2024-06-14 15:05:43,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 414 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 15:05:43,326 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 248 flow [2024-06-14 15:05:43,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=248, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2024-06-14 15:05:43,327 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2024-06-14 15:05:43,327 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 248 flow [2024-06-14 15:05:43,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:43,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:43,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:43,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:05:43,328 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:05:43,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:43,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1993862395, now seen corresponding path program 2 times [2024-06-14 15:05:43,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:43,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475527622] [2024-06-14 15:05:43,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:05:50,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:50,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475527622] [2024-06-14 15:05:50,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475527622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:50,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:50,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:05:50,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126493040] [2024-06-14 15:05:50,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:50,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:05:50,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:50,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:05:50,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:05:50,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-14 15:05:50,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:50,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:50,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-14 15:05:50,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:50,900 INFO L124 PetriNetUnfolderBase]: 239/451 cut-off events. [2024-06-14 15:05:50,900 INFO L125 PetriNetUnfolderBase]: For 2534/2534 co-relation queries the response was YES. [2024-06-14 15:05:50,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 451 events. 239/451 cut-off events. For 2534/2534 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1707 event pairs, 64 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 1729. Up to 402 conditions per place. [2024-06-14 15:05:50,904 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 37 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2024-06-14 15:05:50,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 51 transitions, 352 flow [2024-06-14 15:05:50,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:05:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:05:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2024-06-14 15:05:50,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2024-06-14 15:05:50,906 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 248 flow. Second operand 6 states and 82 transitions. [2024-06-14 15:05:50,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 51 transitions, 352 flow [2024-06-14 15:05:50,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 314 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 15:05:50,909 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 231 flow [2024-06-14 15:05:50,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-06-14 15:05:50,911 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2024-06-14 15:05:50,912 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 231 flow [2024-06-14 15:05:50,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:50,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:50,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:50,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:05:50,913 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:05:50,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:50,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1993872315, now seen corresponding path program 1 times [2024-06-14 15:05:50,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:50,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28847701] [2024-06-14 15:05:50,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:50,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:06:00,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:00,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28847701] [2024-06-14 15:06:00,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28847701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:00,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:00,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:06:00,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204490506] [2024-06-14 15:06:00,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:00,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:06:00,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:00,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:06:00,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:06:00,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:06:00,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 231 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:00,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:00,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:06:00,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:01,293 INFO L124 PetriNetUnfolderBase]: 250/459 cut-off events. [2024-06-14 15:06:01,294 INFO L125 PetriNetUnfolderBase]: For 2935/2935 co-relation queries the response was YES. [2024-06-14 15:06:01,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 459 events. 250/459 cut-off events. For 2935/2935 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1683 event pairs, 63 based on Foata normal form. 3/462 useless extension candidates. Maximal degree in co-relation 1748. Up to 425 conditions per place. [2024-06-14 15:06:01,296 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 42 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2024-06-14 15:06:01,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 365 flow [2024-06-14 15:06:01,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:06:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:06:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-14 15:06:01,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3739495798319328 [2024-06-14 15:06:01,297 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 231 flow. Second operand 7 states and 89 transitions. [2024-06-14 15:06:01,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 365 flow [2024-06-14 15:06:01,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 56 transitions, 344 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-14 15:06:01,300 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 249 flow [2024-06-14 15:06:01,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-06-14 15:06:01,301 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2024-06-14 15:06:01,301 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 249 flow [2024-06-14 15:06:01,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:01,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:01,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:01,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:06:01,302 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:06:01,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:01,302 INFO L85 PathProgramCache]: Analyzing trace with hash 587341877, now seen corresponding path program 1 times [2024-06-14 15:06:01,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:01,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823202072] [2024-06-14 15:06:01,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:01,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:06:08,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:08,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823202072] [2024-06-14 15:06:08,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823202072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:08,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:08,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:06:08,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517720267] [2024-06-14 15:06:08,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:08,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:06:08,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:08,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:06:08,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:06:08,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:06:08,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 249 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:08,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:08,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:06:08,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:09,240 INFO L124 PetriNetUnfolderBase]: 253/464 cut-off events. [2024-06-14 15:06:09,241 INFO L125 PetriNetUnfolderBase]: For 3391/3391 co-relation queries the response was YES. [2024-06-14 15:06:09,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 464 events. 253/464 cut-off events. For 3391/3391 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1701 event pairs, 61 based on Foata normal form. 1/465 useless extension candidates. Maximal degree in co-relation 1843. Up to 396 conditions per place. [2024-06-14 15:06:09,243 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 45 selfloop transitions, 16 changer transitions 0/65 dead transitions. [2024-06-14 15:06:09,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 447 flow [2024-06-14 15:06:09,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:06:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:06:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-14 15:06:09,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40756302521008403 [2024-06-14 15:06:09,244 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 249 flow. Second operand 7 states and 97 transitions. [2024-06-14 15:06:09,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 447 flow [2024-06-14 15:06:09,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 424 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:06:09,247 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 287 flow [2024-06-14 15:06:09,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=287, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-06-14 15:06:09,248 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2024-06-14 15:06:09,248 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 287 flow [2024-06-14 15:06:09,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:09,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:09,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:09,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:06:09,249 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:06:09,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash 587521615, now seen corresponding path program 1 times [2024-06-14 15:06:09,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:09,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324528319] [2024-06-14 15:06:09,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:09,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:06:16,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:16,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324528319] [2024-06-14 15:06:16,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324528319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:16,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:16,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:06:16,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535109397] [2024-06-14 15:06:16,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:16,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:06:16,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:16,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:06:16,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:06:16,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:06:16,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 287 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:16,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:16,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:06:16,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:16,948 INFO L124 PetriNetUnfolderBase]: 260/473 cut-off events. [2024-06-14 15:06:16,948 INFO L125 PetriNetUnfolderBase]: For 3882/3882 co-relation queries the response was YES. [2024-06-14 15:06:16,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1977 conditions, 473 events. 260/473 cut-off events. For 3882/3882 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1727 event pairs, 63 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 1947. Up to 418 conditions per place. [2024-06-14 15:06:16,951 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 45 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2024-06-14 15:06:16,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 66 transitions, 477 flow [2024-06-14 15:06:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:06:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:06:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-14 15:06:16,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39915966386554624 [2024-06-14 15:06:16,952 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 287 flow. Second operand 7 states and 95 transitions. [2024-06-14 15:06:16,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 66 transitions, 477 flow [2024-06-14 15:06:16,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 456 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 15:06:16,955 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 325 flow [2024-06-14 15:06:16,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=325, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-06-14 15:06:16,956 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places. [2024-06-14 15:06:16,956 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 325 flow [2024-06-14 15:06:16,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:16,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:16,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:16,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:06:16,957 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:06:16,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash 587521367, now seen corresponding path program 2 times [2024-06-14 15:06:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:16,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054342885] [2024-06-14 15:06:16,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:16,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:06:24,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:24,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054342885] [2024-06-14 15:06:24,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054342885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:24,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:24,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:06:24,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758230313] [2024-06-14 15:06:24,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:24,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:06:24,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:24,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:06:24,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:06:24,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:06:24,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 325 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:24,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:24,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:06:24,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:24,797 INFO L124 PetriNetUnfolderBase]: 261/476 cut-off events. [2024-06-14 15:06:24,797 INFO L125 PetriNetUnfolderBase]: For 4694/4694 co-relation queries the response was YES. [2024-06-14 15:06:24,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2105 conditions, 476 events. 261/476 cut-off events. For 4694/4694 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1748 event pairs, 60 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 2073. Up to 405 conditions per place. [2024-06-14 15:06:24,801 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 45 selfloop transitions, 17 changer transitions 0/68 dead transitions. [2024-06-14 15:06:24,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 513 flow [2024-06-14 15:06:24,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:06:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:06:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-14 15:06:24,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39915966386554624 [2024-06-14 15:06:24,802 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 325 flow. Second operand 7 states and 95 transitions. [2024-06-14 15:06:24,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 513 flow [2024-06-14 15:06:24,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 497 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-14 15:06:24,806 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 360 flow [2024-06-14 15:06:24,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=360, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2024-06-14 15:06:24,807 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 37 predicate places. [2024-06-14 15:06:24,807 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 360 flow [2024-06-14 15:06:24,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:24,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:24,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:24,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:06:24,808 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:06:24,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash -872308357, now seen corresponding path program 3 times [2024-06-14 15:06:24,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:24,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162079968] [2024-06-14 15:06:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:24,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:06:31,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:31,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162079968] [2024-06-14 15:06:31,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162079968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:31,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:31,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:06:31,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967278250] [2024-06-14 15:06:31,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:31,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:06:31,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:31,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:06:31,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:06:32,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:06:32,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 360 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:32,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:32,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:06:32,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:32,504 INFO L124 PetriNetUnfolderBase]: 259/473 cut-off events. [2024-06-14 15:06:32,504 INFO L125 PetriNetUnfolderBase]: For 5312/5312 co-relation queries the response was YES. [2024-06-14 15:06:32,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2165 conditions, 473 events. 259/473 cut-off events. For 5312/5312 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1733 event pairs, 59 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 2131. Up to 430 conditions per place. [2024-06-14 15:06:32,507 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 48 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2024-06-14 15:06:32,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 64 transitions, 492 flow [2024-06-14 15:06:32,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:06:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:06:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-14 15:06:32,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36554621848739494 [2024-06-14 15:06:32,509 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 360 flow. Second operand 7 states and 87 transitions. [2024-06-14 15:06:32,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 64 transitions, 492 flow [2024-06-14 15:06:32,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 463 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:06:32,512 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 356 flow [2024-06-14 15:06:32,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2024-06-14 15:06:32,513 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2024-06-14 15:06:32,513 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 356 flow [2024-06-14 15:06:32,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:32,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:32,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:32,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:06:32,514 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:06:32,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash -891961799, now seen corresponding path program 2 times [2024-06-14 15:06:32,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:32,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050748691] [2024-06-14 15:06:32,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:32,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:06:39,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:39,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050748691] [2024-06-14 15:06:39,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050748691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:39,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:39,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:06:39,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774920102] [2024-06-14 15:06:39,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:39,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:06:39,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:39,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:06:39,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:06:39,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:06:39,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 356 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:39,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:39,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:06:39,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:40,104 INFO L124 PetriNetUnfolderBase]: 264/480 cut-off events. [2024-06-14 15:06:40,104 INFO L125 PetriNetUnfolderBase]: For 5908/5908 co-relation queries the response was YES. [2024-06-14 15:06:40,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 480 events. 264/480 cut-off events. For 5908/5908 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1762 event pairs, 61 based on Foata normal form. 1/481 useless extension candidates. Maximal degree in co-relation 2186. Up to 445 conditions per place. [2024-06-14 15:06:40,107 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 49 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2024-06-14 15:06:40,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 504 flow [2024-06-14 15:06:40,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:06:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:06:40,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-14 15:06:40,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36554621848739494 [2024-06-14 15:06:40,109 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 356 flow. Second operand 7 states and 87 transitions. [2024-06-14 15:06:40,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 504 flow [2024-06-14 15:06:40,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 468 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 15:06:40,113 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 363 flow [2024-06-14 15:06:40,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2024-06-14 15:06:40,113 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2024-06-14 15:06:40,113 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 363 flow [2024-06-14 15:06:40,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:40,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:40,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:40,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:06:40,114 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:06:40,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:40,115 INFO L85 PathProgramCache]: Analyzing trace with hash -891970169, now seen corresponding path program 3 times [2024-06-14 15:06:40,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:40,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105361750] [2024-06-14 15:06:40,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:40,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:06:47,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:47,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105361750] [2024-06-14 15:06:47,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105361750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:47,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:47,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:06:47,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932194560] [2024-06-14 15:06:47,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:47,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:06:47,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:47,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:06:47,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:06:47,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:06:47,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 363 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:47,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:47,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:06:47,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:47,829 INFO L124 PetriNetUnfolderBase]: 262/477 cut-off events. [2024-06-14 15:06:47,829 INFO L125 PetriNetUnfolderBase]: For 6550/6550 co-relation queries the response was YES. [2024-06-14 15:06:47,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 477 events. 262/477 cut-off events. For 6550/6550 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1755 event pairs, 61 based on Foata normal form. 1/478 useless extension candidates. Maximal degree in co-relation 2200. Up to 436 conditions per place. [2024-06-14 15:06:47,832 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 46 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2024-06-14 15:06:47,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 497 flow [2024-06-14 15:06:47,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:06:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:06:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-14 15:06:47,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3739495798319328 [2024-06-14 15:06:47,834 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 363 flow. Second operand 7 states and 89 transitions. [2024-06-14 15:06:47,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 497 flow [2024-06-14 15:06:47,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 66 transitions, 472 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 15:06:47,838 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 369 flow [2024-06-14 15:06:47,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2024-06-14 15:06:47,839 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 42 predicate places. [2024-06-14 15:06:47,839 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 369 flow [2024-06-14 15:06:47,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:47,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:47,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:47,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:06:47,839 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:06:47,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:47,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1350389632, now seen corresponding path program 1 times [2024-06-14 15:06:47,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:47,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303020578] [2024-06-14 15:06:47,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:47,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:06:55,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:55,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303020578] [2024-06-14 15:06:55,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303020578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:55,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:55,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:06:55,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783305106] [2024-06-14 15:06:55,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:55,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:06:55,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:55,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:06:55,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:06:55,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-14 15:06:55,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 369 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:55,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:55,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-14 15:06:55,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:55,530 INFO L124 PetriNetUnfolderBase]: 263/480 cut-off events. [2024-06-14 15:06:55,531 INFO L125 PetriNetUnfolderBase]: For 7521/7521 co-relation queries the response was YES. [2024-06-14 15:06:55,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2310 conditions, 480 events. 263/480 cut-off events. For 7521/7521 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1773 event pairs, 59 based on Foata normal form. 1/481 useless extension candidates. Maximal degree in co-relation 2273. Up to 389 conditions per place. [2024-06-14 15:06:55,534 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 51 selfloop transitions, 23 changer transitions 0/81 dead transitions. [2024-06-14 15:06:55,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 619 flow [2024-06-14 15:06:55,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:06:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:06:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-14 15:06:55,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-14 15:06:55,535 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 369 flow. Second operand 8 states and 119 transitions. [2024-06-14 15:06:55,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 619 flow [2024-06-14 15:06:55,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 81 transitions, 578 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:06:55,540 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 407 flow [2024-06-14 15:06:55,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=407, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2024-06-14 15:06:55,541 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places. [2024-06-14 15:06:55,541 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 407 flow [2024-06-14 15:06:55,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:55,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:55,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:55,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:06:55,541 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:06:55,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1350539579, now seen corresponding path program 1 times [2024-06-14 15:06:55,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:55,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676656153] [2024-06-14 15:06:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:55,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:07:03,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:03,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676656153] [2024-06-14 15:07:03,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676656153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:03,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:03,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:07:03,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433276840] [2024-06-14 15:07:03,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:03,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:07:03,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:03,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:07:03,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:07:03,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:07:03,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 407 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:03,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:03,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:07:03,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:03,600 INFO L124 PetriNetUnfolderBase]: 284/503 cut-off events. [2024-06-14 15:07:03,600 INFO L125 PetriNetUnfolderBase]: For 8311/8311 co-relation queries the response was YES. [2024-06-14 15:07:03,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2499 conditions, 503 events. 284/503 cut-off events. For 8311/8311 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1825 event pairs, 61 based on Foata normal form. 1/504 useless extension candidates. Maximal degree in co-relation 2461. Up to 431 conditions per place. [2024-06-14 15:07:03,603 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 55 selfloop transitions, 25 changer transitions 0/82 dead transitions. [2024-06-14 15:07:03,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 663 flow [2024-06-14 15:07:03,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:07:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:07:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 15:07:03,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786764705882353 [2024-06-14 15:07:03,604 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 407 flow. Second operand 8 states and 103 transitions. [2024-06-14 15:07:03,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 663 flow [2024-06-14 15:07:03,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 82 transitions, 626 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 15:07:03,610 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 453 flow [2024-06-14 15:07:03,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=453, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2024-06-14 15:07:03,610 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 48 predicate places. [2024-06-14 15:07:03,610 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 453 flow [2024-06-14 15:07:03,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:03,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:03,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:03,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:07:03,611 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:07:03,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:03,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1350539362, now seen corresponding path program 2 times [2024-06-14 15:07:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:03,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536458686] [2024-06-14 15:07:03,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:03,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:07:10,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:10,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536458686] [2024-06-14 15:07:10,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536458686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:10,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:10,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:07:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060302616] [2024-06-14 15:07:10,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:10,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:07:10,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:10,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:07:10,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:07:10,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-14 15:07:10,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 453 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:10,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:10,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-14 15:07:10,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:11,072 INFO L124 PetriNetUnfolderBase]: 271/492 cut-off events. [2024-06-14 15:07:11,072 INFO L125 PetriNetUnfolderBase]: For 9387/9387 co-relation queries the response was YES. [2024-06-14 15:07:11,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2544 conditions, 492 events. 271/492 cut-off events. For 9387/9387 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1818 event pairs, 58 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 2504. Up to 398 conditions per place. [2024-06-14 15:07:11,075 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 52 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2024-06-14 15:07:11,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 84 transitions, 689 flow [2024-06-14 15:07:11,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:07:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:07:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2024-06-14 15:07:11,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43014705882352944 [2024-06-14 15:07:11,076 INFO L175 Difference]: Start difference. First operand has 81 places, 67 transitions, 453 flow. Second operand 8 states and 117 transitions. [2024-06-14 15:07:11,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 84 transitions, 689 flow [2024-06-14 15:07:11,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 84 transitions, 657 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-14 15:07:11,081 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 484 flow [2024-06-14 15:07:11,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=484, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2024-06-14 15:07:11,082 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 52 predicate places. [2024-06-14 15:07:11,082 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 484 flow [2024-06-14 15:07:11,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:11,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:11,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:11,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:07:11,083 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:07:11,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:11,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1033294013, now seen corresponding path program 2 times [2024-06-14 15:07:11,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:11,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62478131] [2024-06-14 15:07:11,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:11,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:07:18,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:18,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62478131] [2024-06-14 15:07:18,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62478131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:18,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:18,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:07:18,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199996181] [2024-06-14 15:07:18,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:18,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:07:18,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:18,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:07:18,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:07:18,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:07:18,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 484 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:18,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:18,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:07:18,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:19,002 INFO L124 PetriNetUnfolderBase]: 295/521 cut-off events. [2024-06-14 15:07:19,002 INFO L125 PetriNetUnfolderBase]: For 10423/10423 co-relation queries the response was YES. [2024-06-14 15:07:19,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 521 events. 295/521 cut-off events. For 10423/10423 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1900 event pairs, 61 based on Foata normal form. 1/522 useless extension candidates. Maximal degree in co-relation 2724. Up to 446 conditions per place. [2024-06-14 15:07:19,006 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 58 selfloop transitions, 26 changer transitions 0/86 dead transitions. [2024-06-14 15:07:19,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 790 flow [2024-06-14 15:07:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:07:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:07:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 15:07:19,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786764705882353 [2024-06-14 15:07:19,007 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 484 flow. Second operand 8 states and 103 transitions. [2024-06-14 15:07:19,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 790 flow [2024-06-14 15:07:19,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 86 transitions, 753 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 15:07:19,013 INFO L231 Difference]: Finished difference. Result has 88 places, 73 transitions, 532 flow [2024-06-14 15:07:19,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=532, PETRI_PLACES=88, PETRI_TRANSITIONS=73} [2024-06-14 15:07:19,013 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 55 predicate places. [2024-06-14 15:07:19,014 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 73 transitions, 532 flow [2024-06-14 15:07:19,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:19,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:19,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:19,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:07:19,014 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:07:19,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1033293796, now seen corresponding path program 3 times [2024-06-14 15:07:19,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:19,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577629882] [2024-06-14 15:07:19,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:19,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:07:27,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:27,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577629882] [2024-06-14 15:07:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577629882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:27,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:27,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:07:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407437616] [2024-06-14 15:07:27,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:27,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:07:27,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:27,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:07:27,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:07:27,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:07:27,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 73 transitions, 532 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:27,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:27,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:07:27,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:27,768 INFO L124 PetriNetUnfolderBase]: 282/510 cut-off events. [2024-06-14 15:07:27,768 INFO L125 PetriNetUnfolderBase]: For 11640/11640 co-relation queries the response was YES. [2024-06-14 15:07:27,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 510 events. 282/510 cut-off events. For 11640/11640 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1899 event pairs, 58 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 2736. Up to 410 conditions per place. [2024-06-14 15:07:27,772 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 52 selfloop transitions, 24 changer transitions 0/87 dead transitions. [2024-06-14 15:07:27,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 87 transitions, 768 flow [2024-06-14 15:07:27,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:07:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:07:27,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-14 15:07:27,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39338235294117646 [2024-06-14 15:07:27,773 INFO L175 Difference]: Start difference. First operand has 88 places, 73 transitions, 532 flow. Second operand 8 states and 107 transitions. [2024-06-14 15:07:27,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 87 transitions, 768 flow [2024-06-14 15:07:27,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 87 transitions, 730 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:07:27,779 INFO L231 Difference]: Finished difference. Result has 92 places, 75 transitions, 561 flow [2024-06-14 15:07:27,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=561, PETRI_PLACES=92, PETRI_TRANSITIONS=75} [2024-06-14 15:07:27,779 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 59 predicate places. [2024-06-14 15:07:27,779 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 561 flow [2024-06-14 15:07:27,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:27,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:27,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:27,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:07:27,780 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:07:27,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:27,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1033301732, now seen corresponding path program 1 times [2024-06-14 15:07:27,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:27,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212132939] [2024-06-14 15:07:27,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:27,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:07:35,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:35,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212132939] [2024-06-14 15:07:35,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212132939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:35,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:35,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:07:35,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723784837] [2024-06-14 15:07:35,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:35,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:07:35,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:35,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:07:35,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:07:35,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:07:35,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 561 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:35,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:35,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:07:35,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:35,895 INFO L124 PetriNetUnfolderBase]: 300/540 cut-off events. [2024-06-14 15:07:35,895 INFO L125 PetriNetUnfolderBase]: For 13637/13637 co-relation queries the response was YES. [2024-06-14 15:07:35,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 540 events. 300/540 cut-off events. For 13637/13637 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2049 event pairs, 64 based on Foata normal form. 3/543 useless extension candidates. Maximal degree in co-relation 2918. Up to 445 conditions per place. [2024-06-14 15:07:35,900 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 66 selfloop transitions, 20 changer transitions 0/97 dead transitions. [2024-06-14 15:07:35,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 97 transitions, 843 flow [2024-06-14 15:07:35,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:07:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:07:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-06-14 15:07:35,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40808823529411764 [2024-06-14 15:07:35,901 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 561 flow. Second operand 8 states and 111 transitions. [2024-06-14 15:07:35,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 97 transitions, 843 flow [2024-06-14 15:07:35,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 97 transitions, 804 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 15:07:35,910 INFO L231 Difference]: Finished difference. Result has 96 places, 81 transitions, 611 flow [2024-06-14 15:07:35,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=611, PETRI_PLACES=96, PETRI_TRANSITIONS=81} [2024-06-14 15:07:35,910 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 63 predicate places. [2024-06-14 15:07:35,911 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 81 transitions, 611 flow [2024-06-14 15:07:35,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:35,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:35,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:35,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:07:35,911 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:07:35,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:35,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1033301453, now seen corresponding path program 3 times [2024-06-14 15:07:35,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:35,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799325926] [2024-06-14 15:07:35,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:35,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:43,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 15:07:43,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:43,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799325926] [2024-06-14 15:07:43,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799325926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:43,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:43,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:07:43,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501861586] [2024-06-14 15:07:43,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:43,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:07:43,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:43,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:07:43,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:07:43,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:07:43,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 81 transitions, 611 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:43,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:43,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:07:43,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:43,812 INFO L124 PetriNetUnfolderBase]: 315/554 cut-off events. [2024-06-14 15:07:43,813 INFO L125 PetriNetUnfolderBase]: For 14079/14079 co-relation queries the response was YES. [2024-06-14 15:07:43,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3161 conditions, 554 events. 315/554 cut-off events. For 14079/14079 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2052 event pairs, 63 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 3115. Up to 480 conditions per place. [2024-06-14 15:07:43,817 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 64 selfloop transitions, 27 changer transitions 0/93 dead transitions. [2024-06-14 15:07:43,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 93 transitions, 867 flow [2024-06-14 15:07:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:07:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:07:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-14 15:07:43,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3713235294117647 [2024-06-14 15:07:43,819 INFO L175 Difference]: Start difference. First operand has 96 places, 81 transitions, 611 flow. Second operand 8 states and 101 transitions. [2024-06-14 15:07:43,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 93 transitions, 867 flow [2024-06-14 15:07:43,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 93 transitions, 847 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-14 15:07:43,829 INFO L231 Difference]: Finished difference. Result has 101 places, 81 transitions, 650 flow [2024-06-14 15:07:43,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=650, PETRI_PLACES=101, PETRI_TRANSITIONS=81} [2024-06-14 15:07:43,830 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 68 predicate places. [2024-06-14 15:07:43,830 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 81 transitions, 650 flow [2024-06-14 15:07:43,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:43,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:43,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:43,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:07:43,830 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:07:43,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:43,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2023699770, now seen corresponding path program 2 times [2024-06-14 15:07:43,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:43,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050508207] [2024-06-14 15:07:43,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:43,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:07:51,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:51,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050508207] [2024-06-14 15:07:51,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050508207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:51,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:51,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:07:51,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544008732] [2024-06-14 15:07:51,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:51,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:07:51,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:51,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:07:51,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:07:51,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:07:51,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 81 transitions, 650 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:51,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:51,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:07:51,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:52,198 INFO L124 PetriNetUnfolderBase]: 307/552 cut-off events. [2024-06-14 15:07:52,198 INFO L125 PetriNetUnfolderBase]: For 15996/15996 co-relation queries the response was YES. [2024-06-14 15:07:52,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3217 conditions, 552 events. 307/552 cut-off events. For 15996/15996 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2082 event pairs, 61 based on Foata normal form. 3/555 useless extension candidates. Maximal degree in co-relation 3168. Up to 500 conditions per place. [2024-06-14 15:07:52,202 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 70 selfloop transitions, 12 changer transitions 0/93 dead transitions. [2024-06-14 15:07:52,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 93 transitions, 854 flow [2024-06-14 15:07:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:07:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:07:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 15:07:52,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3639705882352941 [2024-06-14 15:07:52,205 INFO L175 Difference]: Start difference. First operand has 101 places, 81 transitions, 650 flow. Second operand 8 states and 99 transitions. [2024-06-14 15:07:52,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 93 transitions, 854 flow [2024-06-14 15:07:52,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 93 transitions, 795 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 15:07:52,214 INFO L231 Difference]: Finished difference. Result has 102 places, 83 transitions, 640 flow [2024-06-14 15:07:52,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=640, PETRI_PLACES=102, PETRI_TRANSITIONS=83} [2024-06-14 15:07:52,215 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 69 predicate places. [2024-06-14 15:07:52,215 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 83 transitions, 640 flow [2024-06-14 15:07:52,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:52,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:52,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:52,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:07:52,216 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:07:52,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:52,216 INFO L85 PathProgramCache]: Analyzing trace with hash 546365914, now seen corresponding path program 4 times [2024-06-14 15:07:52,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:52,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122704238] [2024-06-14 15:07:52,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:52,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:07:59,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:59,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122704238] [2024-06-14 15:07:59,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122704238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:59,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:59,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:07:59,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131222786] [2024-06-14 15:07:59,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:59,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:07:59,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:59,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:07:59,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:08:00,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:08:00,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 83 transitions, 640 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:00,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:00,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:08:00,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:00,415 INFO L124 PetriNetUnfolderBase]: 305/549 cut-off events. [2024-06-14 15:08:00,415 INFO L125 PetriNetUnfolderBase]: For 16531/16531 co-relation queries the response was YES. [2024-06-14 15:08:00,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3237 conditions, 549 events. 305/549 cut-off events. For 16531/16531 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2072 event pairs, 59 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 3187. Up to 496 conditions per place. [2024-06-14 15:08:00,419 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 68 selfloop transitions, 12 changer transitions 0/91 dead transitions. [2024-06-14 15:08:00,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 91 transitions, 818 flow [2024-06-14 15:08:00,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:08:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:08:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 15:08:00,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35661764705882354 [2024-06-14 15:08:00,420 INFO L175 Difference]: Start difference. First operand has 102 places, 83 transitions, 640 flow. Second operand 8 states and 97 transitions. [2024-06-14 15:08:00,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 91 transitions, 818 flow [2024-06-14 15:08:00,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 91 transitions, 784 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 15:08:00,429 INFO L231 Difference]: Finished difference. Result has 104 places, 83 transitions, 635 flow [2024-06-14 15:08:00,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=635, PETRI_PLACES=104, PETRI_TRANSITIONS=83} [2024-06-14 15:08:00,430 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 71 predicate places. [2024-06-14 15:08:00,430 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 83 transitions, 635 flow [2024-06-14 15:08:00,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:00,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:00,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:00,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:08:00,430 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:00,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:00,431 INFO L85 PathProgramCache]: Analyzing trace with hash 546366131, now seen corresponding path program 4 times [2024-06-14 15:08:00,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:00,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537184763] [2024-06-14 15:08:00,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:00,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:08:07,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:07,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537184763] [2024-06-14 15:08:07,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537184763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:07,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:07,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:08:07,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553186384] [2024-06-14 15:08:07,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:07,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:08:07,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:07,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:08:07,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:08:08,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:08:08,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 83 transitions, 635 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:08,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:08,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:08:08,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:08,447 INFO L124 PetriNetUnfolderBase]: 325/571 cut-off events. [2024-06-14 15:08:08,448 INFO L125 PetriNetUnfolderBase]: For 17510/17510 co-relation queries the response was YES. [2024-06-14 15:08:08,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3360 conditions, 571 events. 325/571 cut-off events. For 17510/17510 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2109 event pairs, 61 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 3310. Up to 535 conditions per place. [2024-06-14 15:08:08,451 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 74 selfloop transitions, 18 changer transitions 0/94 dead transitions. [2024-06-14 15:08:08,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 94 transitions, 907 flow [2024-06-14 15:08:08,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:08:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:08:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-14 15:08:08,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2024-06-14 15:08:08,452 INFO L175 Difference]: Start difference. First operand has 104 places, 83 transitions, 635 flow. Second operand 8 states and 94 transitions. [2024-06-14 15:08:08,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 94 transitions, 907 flow [2024-06-14 15:08:08,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 94 transitions, 847 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-14 15:08:08,462 INFO L231 Difference]: Finished difference. Result has 102 places, 85 transitions, 632 flow [2024-06-14 15:08:08,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=632, PETRI_PLACES=102, PETRI_TRANSITIONS=85} [2024-06-14 15:08:08,462 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 69 predicate places. [2024-06-14 15:08:08,463 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 85 transitions, 632 flow [2024-06-14 15:08:08,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:08,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:08,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:08,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:08:08,463 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:08,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:08,463 INFO L85 PathProgramCache]: Analyzing trace with hash -235196979, now seen corresponding path program 5 times [2024-06-14 15:08:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:08,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002742724] [2024-06-14 15:08:08,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:08,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:08:15,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:15,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002742724] [2024-06-14 15:08:15,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002742724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:15,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:15,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:08:15,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159944819] [2024-06-14 15:08:15,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:15,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:08:15,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:15,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:08:15,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:08:16,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:08:16,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 85 transitions, 632 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:16,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:16,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:08:16,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:16,521 INFO L124 PetriNetUnfolderBase]: 328/576 cut-off events. [2024-06-14 15:08:16,522 INFO L125 PetriNetUnfolderBase]: For 18818/18818 co-relation queries the response was YES. [2024-06-14 15:08:16,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3417 conditions, 576 events. 328/576 cut-off events. For 18818/18818 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2152 event pairs, 61 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 3367. Up to 539 conditions per place. [2024-06-14 15:08:16,525 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 75 selfloop transitions, 19 changer transitions 0/96 dead transitions. [2024-06-14 15:08:16,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 96 transitions, 914 flow [2024-06-14 15:08:16,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:08:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:08:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-14 15:08:16,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3492647058823529 [2024-06-14 15:08:16,528 INFO L175 Difference]: Start difference. First operand has 102 places, 85 transitions, 632 flow. Second operand 8 states and 95 transitions. [2024-06-14 15:08:16,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 96 transitions, 914 flow [2024-06-14 15:08:16,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 96 transitions, 845 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 15:08:16,541 INFO L231 Difference]: Finished difference. Result has 103 places, 87 transitions, 626 flow [2024-06-14 15:08:16,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=626, PETRI_PLACES=103, PETRI_TRANSITIONS=87} [2024-06-14 15:08:16,541 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 70 predicate places. [2024-06-14 15:08:16,541 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 87 transitions, 626 flow [2024-06-14 15:08:16,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:16,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:16,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:16,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:08:16,542 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:16,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:16,542 INFO L85 PathProgramCache]: Analyzing trace with hash 555570620, now seen corresponding path program 3 times [2024-06-14 15:08:16,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:16,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784664368] [2024-06-14 15:08:16,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:16,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:08:23,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:23,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784664368] [2024-06-14 15:08:23,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784664368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:23,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:23,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:08:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097637177] [2024-06-14 15:08:23,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:23,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:08:23,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:23,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:08:23,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:08:24,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:08:24,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 87 transitions, 626 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:24,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:24,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:08:24,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:24,412 INFO L124 PetriNetUnfolderBase]: 320/574 cut-off events. [2024-06-14 15:08:24,412 INFO L125 PetriNetUnfolderBase]: For 20996/20996 co-relation queries the response was YES. [2024-06-14 15:08:24,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3420 conditions, 574 events. 320/574 cut-off events. For 20996/20996 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2196 event pairs, 61 based on Foata normal form. 3/577 useless extension candidates. Maximal degree in co-relation 3369. Up to 506 conditions per place. [2024-06-14 15:08:24,415 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 73 selfloop transitions, 15 changer transitions 0/101 dead transitions. [2024-06-14 15:08:24,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 101 transitions, 852 flow [2024-06-14 15:08:24,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:08:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:08:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-14 15:08:24,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786764705882353 [2024-06-14 15:08:24,416 INFO L175 Difference]: Start difference. First operand has 103 places, 87 transitions, 626 flow. Second operand 8 states and 103 transitions. [2024-06-14 15:08:24,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 101 transitions, 852 flow [2024-06-14 15:08:24,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 101 transitions, 819 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:08:24,429 INFO L231 Difference]: Finished difference. Result has 106 places, 89 transitions, 652 flow [2024-06-14 15:08:24,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=652, PETRI_PLACES=106, PETRI_TRANSITIONS=89} [2024-06-14 15:08:24,430 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 73 predicate places. [2024-06-14 15:08:24,430 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 89 transitions, 652 flow [2024-06-14 15:08:24,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:24,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:24,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:24,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:08:24,431 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:24,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:24,431 INFO L85 PathProgramCache]: Analyzing trace with hash 546373850, now seen corresponding path program 4 times [2024-06-14 15:08:24,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:24,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817294669] [2024-06-14 15:08:24,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:24,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:08:31,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:31,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817294669] [2024-06-14 15:08:31,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817294669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:31,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:31,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:08:31,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740489001] [2024-06-14 15:08:31,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:31,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:08:31,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:31,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:08:31,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:08:32,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:08:32,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 89 transitions, 652 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:32,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:32,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:08:32,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:32,441 INFO L124 PetriNetUnfolderBase]: 314/565 cut-off events. [2024-06-14 15:08:32,441 INFO L125 PetriNetUnfolderBase]: For 21262/21262 co-relation queries the response was YES. [2024-06-14 15:08:32,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3360 conditions, 565 events. 314/565 cut-off events. For 21262/21262 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2155 event pairs, 59 based on Foata normal form. 3/568 useless extension candidates. Maximal degree in co-relation 3308. Up to 482 conditions per place. [2024-06-14 15:08:32,445 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 69 selfloop transitions, 19 changer transitions 0/101 dead transitions. [2024-06-14 15:08:32,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 101 transitions, 858 flow [2024-06-14 15:08:32,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:08:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:08:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:08:32,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3860294117647059 [2024-06-14 15:08:32,446 INFO L175 Difference]: Start difference. First operand has 106 places, 89 transitions, 652 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:08:32,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 101 transitions, 858 flow [2024-06-14 15:08:32,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 817 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:08:32,461 INFO L231 Difference]: Finished difference. Result has 108 places, 89 transitions, 654 flow [2024-06-14 15:08:32,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=654, PETRI_PLACES=108, PETRI_TRANSITIONS=89} [2024-06-14 15:08:32,461 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 75 predicate places. [2024-06-14 15:08:32,461 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 89 transitions, 654 flow [2024-06-14 15:08:32,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:32,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:32,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:32,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:08:32,462 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:32,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:32,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1881011421, now seen corresponding path program 6 times [2024-06-14 15:08:32,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:32,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270993257] [2024-06-14 15:08:32,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:32,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:08:39,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:39,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270993257] [2024-06-14 15:08:39,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270993257] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:39,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:39,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:08:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63374849] [2024-06-14 15:08:39,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:39,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:08:39,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:39,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:08:39,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:08:39,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:08:39,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 89 transitions, 654 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:39,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:39,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:08:39,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:39,999 INFO L124 PetriNetUnfolderBase]: 329/582 cut-off events. [2024-06-14 15:08:39,999 INFO L125 PetriNetUnfolderBase]: For 21382/21382 co-relation queries the response was YES. [2024-06-14 15:08:40,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3456 conditions, 582 events. 329/582 cut-off events. For 21382/21382 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2198 event pairs, 131 based on Foata normal form. 1/583 useless extension candidates. Maximal degree in co-relation 3403. Up to 558 conditions per place. [2024-06-14 15:08:40,004 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 82 selfloop transitions, 14 changer transitions 0/98 dead transitions. [2024-06-14 15:08:40,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 98 transitions, 874 flow [2024-06-14 15:08:40,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:08:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:08:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 15:08:40,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31699346405228757 [2024-06-14 15:08:40,005 INFO L175 Difference]: Start difference. First operand has 108 places, 89 transitions, 654 flow. Second operand 9 states and 97 transitions. [2024-06-14 15:08:40,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 98 transitions, 874 flow [2024-06-14 15:08:40,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 98 transitions, 803 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 15:08:40,018 INFO L231 Difference]: Finished difference. Result has 111 places, 91 transitions, 633 flow [2024-06-14 15:08:40,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=633, PETRI_PLACES=111, PETRI_TRANSITIONS=91} [2024-06-14 15:08:40,019 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 78 predicate places. [2024-06-14 15:08:40,019 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 91 transitions, 633 flow [2024-06-14 15:08:40,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:40,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:40,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:40,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:08:40,019 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:40,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash 476405116, now seen corresponding path program 1 times [2024-06-14 15:08:40,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:40,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975661115] [2024-06-14 15:08:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:40,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:08:50,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:50,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975661115] [2024-06-14 15:08:50,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975661115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:50,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:50,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:08:50,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411940864] [2024-06-14 15:08:50,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:50,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:08:50,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:50,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:08:50,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:08:50,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:08:50,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 91 transitions, 633 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:50,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:50,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:08:50,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:51,166 INFO L124 PetriNetUnfolderBase]: 337/610 cut-off events. [2024-06-14 15:08:51,166 INFO L125 PetriNetUnfolderBase]: For 22774/22776 co-relation queries the response was YES. [2024-06-14 15:08:51,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 610 events. 337/610 cut-off events. For 22774/22776 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2434 event pairs, 57 based on Foata normal form. 3/613 useless extension candidates. Maximal degree in co-relation 3484. Up to 501 conditions per place. [2024-06-14 15:08:51,171 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 84 selfloop transitions, 24 changer transitions 0/121 dead transitions. [2024-06-14 15:08:51,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 975 flow [2024-06-14 15:08:51,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:08:51,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:08:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-14 15:08:51,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3954248366013072 [2024-06-14 15:08:51,172 INFO L175 Difference]: Start difference. First operand has 111 places, 91 transitions, 633 flow. Second operand 9 states and 121 transitions. [2024-06-14 15:08:51,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 975 flow [2024-06-14 15:08:51,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 121 transitions, 933 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 15:08:51,184 INFO L231 Difference]: Finished difference. Result has 114 places, 104 transitions, 745 flow [2024-06-14 15:08:51,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=745, PETRI_PLACES=114, PETRI_TRANSITIONS=104} [2024-06-14 15:08:51,184 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 81 predicate places. [2024-06-14 15:08:51,185 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 104 transitions, 745 flow [2024-06-14 15:08:51,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:51,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:51,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:51,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:08:51,185 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:08:51,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:51,185 INFO L85 PathProgramCache]: Analyzing trace with hash 176463930, now seen corresponding path program 2 times [2024-06-14 15:08:51,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:51,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134890450] [2024-06-14 15:08:51,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:51,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:02,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:02,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134890450] [2024-06-14 15:09:02,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134890450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:02,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:02,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:09:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991758635] [2024-06-14 15:09:02,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:02,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:09:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:02,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:09:02,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:09:02,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:09:02,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 104 transitions, 745 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:02,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:02,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:09:02,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:02,840 INFO L124 PetriNetUnfolderBase]: 356/645 cut-off events. [2024-06-14 15:09:02,840 INFO L125 PetriNetUnfolderBase]: For 24318/24318 co-relation queries the response was YES. [2024-06-14 15:09:02,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3856 conditions, 645 events. 356/645 cut-off events. For 24318/24318 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2616 event pairs, 109 based on Foata normal form. 1/646 useless extension candidates. Maximal degree in co-relation 3798. Up to 566 conditions per place. [2024-06-14 15:09:02,844 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 99 selfloop transitions, 18 changer transitions 0/130 dead transitions. [2024-06-14 15:09:02,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 130 transitions, 1114 flow [2024-06-14 15:09:02,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:09:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:09:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:09:02,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36470588235294116 [2024-06-14 15:09:02,849 INFO L175 Difference]: Start difference. First operand has 114 places, 104 transitions, 745 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:09:02,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 130 transitions, 1114 flow [2024-06-14 15:09:02,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 130 transitions, 1071 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-14 15:09:02,869 INFO L231 Difference]: Finished difference. Result has 124 places, 115 transitions, 868 flow [2024-06-14 15:09:02,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=868, PETRI_PLACES=124, PETRI_TRANSITIONS=115} [2024-06-14 15:09:02,869 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 91 predicate places. [2024-06-14 15:09:02,869 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 115 transitions, 868 flow [2024-06-14 15:09:02,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:02,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:02,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:02,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:09:02,870 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:02,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:02,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1778204934, now seen corresponding path program 3 times [2024-06-14 15:09:02,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:02,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19457450] [2024-06-14 15:09:02,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:02,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:12,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19457450] [2024-06-14 15:09:12,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19457450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:12,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:12,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:09:12,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115360832] [2024-06-14 15:09:12,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:12,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:09:12,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:12,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:09:12,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:09:12,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:09:12,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 868 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:12,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:12,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:09:12,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:13,186 INFO L124 PetriNetUnfolderBase]: 364/655 cut-off events. [2024-06-14 15:09:13,187 INFO L125 PetriNetUnfolderBase]: For 27887/27889 co-relation queries the response was YES. [2024-06-14 15:09:13,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4087 conditions, 655 events. 364/655 cut-off events. For 27887/27889 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2716 event pairs, 90 based on Foata normal form. 1/654 useless extension candidates. Maximal degree in co-relation 4024. Up to 531 conditions per place. [2024-06-14 15:09:13,191 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 91 selfloop transitions, 32 changer transitions 0/136 dead transitions. [2024-06-14 15:09:13,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 136 transitions, 1203 flow [2024-06-14 15:09:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:09:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:09:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-14 15:09:13,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2024-06-14 15:09:13,194 INFO L175 Difference]: Start difference. First operand has 124 places, 115 transitions, 868 flow. Second operand 9 states and 120 transitions. [2024-06-14 15:09:13,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 136 transitions, 1203 flow [2024-06-14 15:09:13,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 136 transitions, 1161 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-14 15:09:13,217 INFO L231 Difference]: Finished difference. Result has 130 places, 120 transitions, 963 flow [2024-06-14 15:09:13,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=963, PETRI_PLACES=130, PETRI_TRANSITIONS=120} [2024-06-14 15:09:13,218 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 97 predicate places. [2024-06-14 15:09:13,218 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 120 transitions, 963 flow [2024-06-14 15:09:13,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:13,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:13,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:13,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:09:13,219 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:13,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:13,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1298493426, now seen corresponding path program 4 times [2024-06-14 15:09:13,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:13,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348729926] [2024-06-14 15:09:13,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:13,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:22,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:22,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348729926] [2024-06-14 15:09:22,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348729926] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:22,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:22,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:09:22,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624826972] [2024-06-14 15:09:22,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:22,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:09:22,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:22,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:09:22,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:09:22,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:09:22,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 120 transitions, 963 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:22,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:22,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:09:22,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:23,263 INFO L124 PetriNetUnfolderBase]: 373/673 cut-off events. [2024-06-14 15:09:23,263 INFO L125 PetriNetUnfolderBase]: For 28556/28557 co-relation queries the response was YES. [2024-06-14 15:09:23,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4304 conditions, 673 events. 373/673 cut-off events. For 28556/28557 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2827 event pairs, 93 based on Foata normal form. 1/673 useless extension candidates. Maximal degree in co-relation 4239. Up to 521 conditions per place. [2024-06-14 15:09:23,268 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 90 selfloop transitions, 44 changer transitions 0/147 dead transitions. [2024-06-14 15:09:23,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 147 transitions, 1370 flow [2024-06-14 15:09:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:09:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:09:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2024-06-14 15:09:23,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-14 15:09:23,285 INFO L175 Difference]: Start difference. First operand has 130 places, 120 transitions, 963 flow. Second operand 12 states and 152 transitions. [2024-06-14 15:09:23,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 147 transitions, 1370 flow [2024-06-14 15:09:23,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 147 transitions, 1290 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-14 15:09:23,315 INFO L231 Difference]: Finished difference. Result has 140 places, 128 transitions, 1104 flow [2024-06-14 15:09:23,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1104, PETRI_PLACES=140, PETRI_TRANSITIONS=128} [2024-06-14 15:09:23,316 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 107 predicate places. [2024-06-14 15:09:23,316 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 1104 flow [2024-06-14 15:09:23,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:23,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:23,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:23,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:09:23,316 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:23,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:23,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1358895648, now seen corresponding path program 1 times [2024-06-14 15:09:23,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:23,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413160180] [2024-06-14 15:09:23,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:23,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:32,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:32,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413160180] [2024-06-14 15:09:32,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413160180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:32,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:32,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:09:32,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951735191] [2024-06-14 15:09:32,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:32,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:09:32,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:32,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:09:32,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:09:32,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:09:32,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 128 transitions, 1104 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:32,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:32,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:09:32,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:32,940 INFO L124 PetriNetUnfolderBase]: 393/695 cut-off events. [2024-06-14 15:09:32,940 INFO L125 PetriNetUnfolderBase]: For 29077/29077 co-relation queries the response was YES. [2024-06-14 15:09:32,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4507 conditions, 695 events. 393/695 cut-off events. For 29077/29077 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2845 event pairs, 97 based on Foata normal form. 1/696 useless extension candidates. Maximal degree in co-relation 4438. Up to 531 conditions per place. [2024-06-14 15:09:32,945 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 96 selfloop transitions, 51 changer transitions 0/149 dead transitions. [2024-06-14 15:09:32,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 149 transitions, 1536 flow [2024-06-14 15:09:32,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:09:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:09:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:09:32,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-14 15:09:32,955 INFO L175 Difference]: Start difference. First operand has 140 places, 128 transitions, 1104 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:09:32,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 149 transitions, 1536 flow [2024-06-14 15:09:32,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 149 transitions, 1452 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-14 15:09:32,986 INFO L231 Difference]: Finished difference. Result has 145 places, 132 transitions, 1155 flow [2024-06-14 15:09:32,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1155, PETRI_PLACES=145, PETRI_TRANSITIONS=132} [2024-06-14 15:09:32,987 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 112 predicate places. [2024-06-14 15:09:32,987 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 132 transitions, 1155 flow [2024-06-14 15:09:32,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:32,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:32,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:32,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:09:32,987 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:32,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:32,988 INFO L85 PathProgramCache]: Analyzing trace with hash 875132374, now seen corresponding path program 2 times [2024-06-14 15:09:32,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:32,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214828619] [2024-06-14 15:09:32,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:32,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:43,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:43,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214828619] [2024-06-14 15:09:43,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214828619] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:43,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:43,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:09:43,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950151326] [2024-06-14 15:09:43,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:43,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:09:43,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:43,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:09:43,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:09:43,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:09:43,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 132 transitions, 1155 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:43,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:43,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:09:43,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:44,167 INFO L124 PetriNetUnfolderBase]: 410/723 cut-off events. [2024-06-14 15:09:44,167 INFO L125 PetriNetUnfolderBase]: For 31421/31421 co-relation queries the response was YES. [2024-06-14 15:09:44,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4763 conditions, 723 events. 410/723 cut-off events. For 31421/31421 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 99 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 4693. Up to 545 conditions per place. [2024-06-14 15:09:44,173 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 108 selfloop transitions, 50 changer transitions 0/160 dead transitions. [2024-06-14 15:09:44,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 160 transitions, 1752 flow [2024-06-14 15:09:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:09:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:09:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-14 15:09:44,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-14 15:09:44,182 INFO L175 Difference]: Start difference. First operand has 145 places, 132 transitions, 1155 flow. Second operand 10 states and 130 transitions. [2024-06-14 15:09:44,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 160 transitions, 1752 flow [2024-06-14 15:09:44,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 160 transitions, 1676 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 15:09:44,220 INFO L231 Difference]: Finished difference. Result has 150 places, 141 transitions, 1276 flow [2024-06-14 15:09:44,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1276, PETRI_PLACES=150, PETRI_TRANSITIONS=141} [2024-06-14 15:09:44,220 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 117 predicate places. [2024-06-14 15:09:44,220 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 141 transitions, 1276 flow [2024-06-14 15:09:44,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:44,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:44,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:44,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:09:44,221 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:44,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:44,222 INFO L85 PathProgramCache]: Analyzing trace with hash 875132188, now seen corresponding path program 5 times [2024-06-14 15:09:44,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:44,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287971212] [2024-06-14 15:09:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:09:54,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:54,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287971212] [2024-06-14 15:09:54,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287971212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:54,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:54,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:09:54,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984973587] [2024-06-14 15:09:54,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:54,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:09:54,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:54,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:09:54,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:09:54,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:09:54,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 141 transitions, 1276 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:54,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:54,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:09:54,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:54,758 INFO L124 PetriNetUnfolderBase]: 402/720 cut-off events. [2024-06-14 15:09:54,759 INFO L125 PetriNetUnfolderBase]: For 34201/34201 co-relation queries the response was YES. [2024-06-14 15:09:54,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4934 conditions, 720 events. 402/720 cut-off events. For 34201/34201 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3050 event pairs, 89 based on Foata normal form. 1/721 useless extension candidates. Maximal degree in co-relation 4861. Up to 539 conditions per place. [2024-06-14 15:09:54,764 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 98 selfloop transitions, 52 changer transitions 0/168 dead transitions. [2024-06-14 15:09:54,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 168 transitions, 1781 flow [2024-06-14 15:09:54,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:09:54,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:09:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 167 transitions. [2024-06-14 15:09:54,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778280542986425 [2024-06-14 15:09:54,765 INFO L175 Difference]: Start difference. First operand has 150 places, 141 transitions, 1276 flow. Second operand 13 states and 167 transitions. [2024-06-14 15:09:54,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 168 transitions, 1781 flow [2024-06-14 15:09:54,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 168 transitions, 1722 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:09:54,810 INFO L231 Difference]: Finished difference. Result has 159 places, 147 transitions, 1405 flow [2024-06-14 15:09:54,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1405, PETRI_PLACES=159, PETRI_TRANSITIONS=147} [2024-06-14 15:09:54,811 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 126 predicate places. [2024-06-14 15:09:54,811 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 147 transitions, 1405 flow [2024-06-14 15:09:54,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:54,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:54,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:54,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:09:54,811 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:09:54,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:54,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1481260804, now seen corresponding path program 3 times [2024-06-14 15:09:54,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:54,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42590447] [2024-06-14 15:09:54,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:54,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:10:05,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:05,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42590447] [2024-06-14 15:10:05,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42590447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:05,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:05,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:10:05,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505469327] [2024-06-14 15:10:05,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:05,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:10:05,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:05,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:10:05,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:10:05,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:10:05,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 147 transitions, 1405 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:05,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:05,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:10:05,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:05,866 INFO L124 PetriNetUnfolderBase]: 421/742 cut-off events. [2024-06-14 15:10:05,867 INFO L125 PetriNetUnfolderBase]: For 36063/36063 co-relation queries the response was YES. [2024-06-14 15:10:05,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5154 conditions, 742 events. 421/742 cut-off events. For 36063/36063 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3104 event pairs, 97 based on Foata normal form. 1/743 useless extension candidates. Maximal degree in co-relation 5080. Up to 562 conditions per place. [2024-06-14 15:10:05,872 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 108 selfloop transitions, 55 changer transitions 0/165 dead transitions. [2024-06-14 15:10:05,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 165 transitions, 1937 flow [2024-06-14 15:10:05,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:10:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:10:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:10:05,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-14 15:10:05,875 INFO L175 Difference]: Start difference. First operand has 159 places, 147 transitions, 1405 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:10:05,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 165 transitions, 1937 flow [2024-06-14 15:10:05,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 165 transitions, 1867 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-14 15:10:05,918 INFO L231 Difference]: Finished difference. Result has 163 places, 149 transitions, 1464 flow [2024-06-14 15:10:05,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1464, PETRI_PLACES=163, PETRI_TRANSITIONS=149} [2024-06-14 15:10:05,918 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 130 predicate places. [2024-06-14 15:10:05,918 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 149 transitions, 1464 flow [2024-06-14 15:10:05,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:05,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:05,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:05,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:10:05,919 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:10:05,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:05,919 INFO L85 PathProgramCache]: Analyzing trace with hash 879780762, now seen corresponding path program 1 times [2024-06-14 15:10:05,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:05,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744576491] [2024-06-14 15:10:05,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:05,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:10:16,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:16,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744576491] [2024-06-14 15:10:16,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744576491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:16,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:16,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:10:16,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379949778] [2024-06-14 15:10:16,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:16,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:10:16,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:16,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:10:16,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:10:16,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:10:16,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 149 transitions, 1464 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:16,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:16,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:10:16,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:16,954 INFO L124 PetriNetUnfolderBase]: 430/757 cut-off events. [2024-06-14 15:10:16,954 INFO L125 PetriNetUnfolderBase]: For 39664/39664 co-relation queries the response was YES. [2024-06-14 15:10:16,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5321 conditions, 757 events. 430/757 cut-off events. For 39664/39664 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3186 event pairs, 106 based on Foata normal form. 3/760 useless extension candidates. Maximal degree in co-relation 5245. Up to 610 conditions per place. [2024-06-14 15:10:16,960 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 131 selfloop transitions, 42 changer transitions 0/175 dead transitions. [2024-06-14 15:10:16,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 175 transitions, 1982 flow [2024-06-14 15:10:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:10:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:10:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:10:16,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-14 15:10:16,961 INFO L175 Difference]: Start difference. First operand has 163 places, 149 transitions, 1464 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:10:16,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 175 transitions, 1982 flow [2024-06-14 15:10:16,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 175 transitions, 1898 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:10:17,001 INFO L231 Difference]: Finished difference. Result has 170 places, 158 transitions, 1577 flow [2024-06-14 15:10:17,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1577, PETRI_PLACES=170, PETRI_TRANSITIONS=158} [2024-06-14 15:10:17,001 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 137 predicate places. [2024-06-14 15:10:17,001 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 158 transitions, 1577 flow [2024-06-14 15:10:17,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:17,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:17,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:17,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:10:17,002 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:10:17,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:17,002 INFO L85 PathProgramCache]: Analyzing trace with hash 879773818, now seen corresponding path program 6 times [2024-06-14 15:10:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744560921] [2024-06-14 15:10:17,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:17,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:10:26,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:26,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744560921] [2024-06-14 15:10:26,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744560921] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:26,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:26,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:10:26,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162836358] [2024-06-14 15:10:26,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:26,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:10:26,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:26,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:10:26,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:10:26,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:10:26,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 158 transitions, 1577 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:26,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:26,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:10:26,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:27,477 INFO L124 PetriNetUnfolderBase]: 411/737 cut-off events. [2024-06-14 15:10:27,477 INFO L125 PetriNetUnfolderBase]: For 39514/39514 co-relation queries the response was YES. [2024-06-14 15:10:27,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5370 conditions, 737 events. 411/737 cut-off events. For 39514/39514 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3151 event pairs, 88 based on Foata normal form. 1/738 useless extension candidates. Maximal degree in co-relation 5291. Up to 554 conditions per place. [2024-06-14 15:10:27,483 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 102 selfloop transitions, 54 changer transitions 0/175 dead transitions. [2024-06-14 15:10:27,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 175 transitions, 1933 flow [2024-06-14 15:10:27,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:10:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:10:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 151 transitions. [2024-06-14 15:10:27,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3700980392156863 [2024-06-14 15:10:27,485 INFO L175 Difference]: Start difference. First operand has 170 places, 158 transitions, 1577 flow. Second operand 12 states and 151 transitions. [2024-06-14 15:10:27,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 175 transitions, 1933 flow [2024-06-14 15:10:27,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 175 transitions, 1822 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-14 15:10:27,532 INFO L231 Difference]: Finished difference. Result has 174 places, 158 transitions, 1579 flow [2024-06-14 15:10:27,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1579, PETRI_PLACES=174, PETRI_TRANSITIONS=158} [2024-06-14 15:10:27,533 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 141 predicate places. [2024-06-14 15:10:27,533 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 158 transitions, 1579 flow [2024-06-14 15:10:27,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:27,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:27,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:27,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:10:27,533 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:10:27,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:27,534 INFO L85 PathProgramCache]: Analyzing trace with hash -757798452, now seen corresponding path program 4 times [2024-06-14 15:10:27,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:27,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478231737] [2024-06-14 15:10:27,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:27,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:10:37,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:37,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478231737] [2024-06-14 15:10:37,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478231737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:37,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:37,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:10:37,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743846853] [2024-06-14 15:10:37,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:37,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:10:37,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:37,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:10:37,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:10:37,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:10:37,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 158 transitions, 1579 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:37,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:37,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:10:37,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:38,282 INFO L124 PetriNetUnfolderBase]: 426/751 cut-off events. [2024-06-14 15:10:38,282 INFO L125 PetriNetUnfolderBase]: For 40089/40089 co-relation queries the response was YES. [2024-06-14 15:10:38,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5450 conditions, 751 events. 426/751 cut-off events. For 40089/40089 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3138 event pairs, 96 based on Foata normal form. 1/752 useless extension candidates. Maximal degree in co-relation 5372. Up to 572 conditions per place. [2024-06-14 15:10:38,288 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 118 selfloop transitions, 53 changer transitions 0/173 dead transitions. [2024-06-14 15:10:38,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 173 transitions, 2041 flow [2024-06-14 15:10:38,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:10:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:10:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:10:38,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-14 15:10:38,290 INFO L175 Difference]: Start difference. First operand has 174 places, 158 transitions, 1579 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:10:38,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 173 transitions, 2041 flow [2024-06-14 15:10:38,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 173 transitions, 1931 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:10:38,348 INFO L231 Difference]: Finished difference. Result has 175 places, 158 transitions, 1580 flow [2024-06-14 15:10:38,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1580, PETRI_PLACES=175, PETRI_TRANSITIONS=158} [2024-06-14 15:10:38,348 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 142 predicate places. [2024-06-14 15:10:38,348 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 158 transitions, 1580 flow [2024-06-14 15:10:38,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:38,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:38,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:38,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:10:38,349 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:10:38,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:38,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1460988370, now seen corresponding path program 5 times [2024-06-14 15:10:38,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:38,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683998917] [2024-06-14 15:10:38,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:38,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:10:49,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:49,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683998917] [2024-06-14 15:10:49,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683998917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:49,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:49,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:10:49,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974870254] [2024-06-14 15:10:49,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:49,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:10:49,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:49,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:10:49,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:10:49,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:10:49,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 158 transitions, 1580 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:49,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:49,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:10:49,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:49,676 INFO L124 PetriNetUnfolderBase]: 464/814 cut-off events. [2024-06-14 15:10:49,676 INFO L125 PetriNetUnfolderBase]: For 43216/43216 co-relation queries the response was YES. [2024-06-14 15:10:49,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5922 conditions, 814 events. 464/814 cut-off events. For 43216/43216 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3499 event pairs, 124 based on Foata normal form. 1/815 useless extension candidates. Maximal degree in co-relation 5843. Up to 711 conditions per place. [2024-06-14 15:10:49,681 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 155 selfloop transitions, 40 changer transitions 0/197 dead transitions. [2024-06-14 15:10:49,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 197 transitions, 2354 flow [2024-06-14 15:10:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:10:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:10:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:10:49,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2024-06-14 15:10:49,682 INFO L175 Difference]: Start difference. First operand has 175 places, 158 transitions, 1580 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:10:49,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 197 transitions, 2354 flow [2024-06-14 15:10:49,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 197 transitions, 2203 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-14 15:10:49,736 INFO L231 Difference]: Finished difference. Result has 178 places, 177 transitions, 1781 flow [2024-06-14 15:10:49,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1781, PETRI_PLACES=178, PETRI_TRANSITIONS=177} [2024-06-14 15:10:49,736 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 145 predicate places. [2024-06-14 15:10:49,736 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 177 transitions, 1781 flow [2024-06-14 15:10:49,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:49,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:49,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:49,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:10:49,737 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:10:49,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1460988556, now seen corresponding path program 7 times [2024-06-14 15:10:49,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:49,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711916247] [2024-06-14 15:10:49,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:49,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:11:00,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:00,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711916247] [2024-06-14 15:11:00,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711916247] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:00,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:00,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:00,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516919423] [2024-06-14 15:11:00,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:00,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:00,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:00,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:00,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:11:00,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 177 transitions, 1781 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:00,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:00,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:11:00,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:00,887 INFO L124 PetriNetUnfolderBase]: 455/810 cut-off events. [2024-06-14 15:11:00,887 INFO L125 PetriNetUnfolderBase]: For 46501/46501 co-relation queries the response was YES. [2024-06-14 15:11:00,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6012 conditions, 810 events. 455/810 cut-off events. For 46501/46501 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3536 event pairs, 114 based on Foata normal form. 1/811 useless extension candidates. Maximal degree in co-relation 5929. Up to 671 conditions per place. [2024-06-14 15:11:00,892 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 143 selfloop transitions, 33 changer transitions 0/201 dead transitions. [2024-06-14 15:11:00,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 201 transitions, 2375 flow [2024-06-14 15:11:00,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:11:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:11:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-14 15:11:00,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38529411764705884 [2024-06-14 15:11:00,894 INFO L175 Difference]: Start difference. First operand has 178 places, 177 transitions, 1781 flow. Second operand 10 states and 131 transitions. [2024-06-14 15:11:00,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 201 transitions, 2375 flow [2024-06-14 15:11:00,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 201 transitions, 2363 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 15:11:00,954 INFO L231 Difference]: Finished difference. Result has 188 places, 186 transitions, 1985 flow [2024-06-14 15:11:00,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1985, PETRI_PLACES=188, PETRI_TRANSITIONS=186} [2024-06-14 15:11:00,955 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 155 predicate places. [2024-06-14 15:11:00,955 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 186 transitions, 1985 flow [2024-06-14 15:11:00,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:00,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:00,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:00,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:11:00,956 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:11:00,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash 181232226, now seen corresponding path program 6 times [2024-06-14 15:11:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:00,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050062334] [2024-06-14 15:11:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:11,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 15:11:11,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:11,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050062334] [2024-06-14 15:11:11,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050062334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:11,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:11,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:11,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416350226] [2024-06-14 15:11:11,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:11,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:11,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:11,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:11,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:11,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:11:11,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 186 transitions, 1985 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:11,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:11,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:11:11,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:12,072 INFO L124 PetriNetUnfolderBase]: 480/840 cut-off events. [2024-06-14 15:11:12,073 INFO L125 PetriNetUnfolderBase]: For 49702/49702 co-relation queries the response was YES. [2024-06-14 15:11:12,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6418 conditions, 840 events. 480/840 cut-off events. For 49702/49702 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3639 event pairs, 124 based on Foata normal form. 1/841 useless extension candidates. Maximal degree in co-relation 6331. Up to 734 conditions per place. [2024-06-14 15:11:12,079 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 161 selfloop transitions, 42 changer transitions 0/205 dead transitions. [2024-06-14 15:11:12,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 205 transitions, 2645 flow [2024-06-14 15:11:12,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:11:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:11:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:11:12,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37058823529411766 [2024-06-14 15:11:12,081 INFO L175 Difference]: Start difference. First operand has 188 places, 186 transitions, 1985 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:11:12,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 205 transitions, 2645 flow [2024-06-14 15:11:12,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 205 transitions, 2598 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-14 15:11:12,144 INFO L231 Difference]: Finished difference. Result has 195 places, 190 transitions, 2067 flow [2024-06-14 15:11:12,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2067, PETRI_PLACES=195, PETRI_TRANSITIONS=190} [2024-06-14 15:11:12,145 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 162 predicate places. [2024-06-14 15:11:12,145 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 190 transitions, 2067 flow [2024-06-14 15:11:12,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:12,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:12,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:12,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:11:12,145 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:11:12,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:12,146 INFO L85 PathProgramCache]: Analyzing trace with hash 347466254, now seen corresponding path program 2 times [2024-06-14 15:11:12,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:12,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28224776] [2024-06-14 15:11:12,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:12,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:11:22,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:22,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28224776] [2024-06-14 15:11:22,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28224776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:22,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:22,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:22,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754518527] [2024-06-14 15:11:22,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:22,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:22,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:22,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:22,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:22,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:11:22,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 190 transitions, 2067 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:22,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:22,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:11:22,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:23,457 INFO L124 PetriNetUnfolderBase]: 513/894 cut-off events. [2024-06-14 15:11:23,457 INFO L125 PetriNetUnfolderBase]: For 57191/57191 co-relation queries the response was YES. [2024-06-14 15:11:23,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6882 conditions, 894 events. 513/894 cut-off events. For 57191/57191 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3938 event pairs, 130 based on Foata normal form. 3/897 useless extension candidates. Maximal degree in co-relation 6793. Up to 765 conditions per place. [2024-06-14 15:11:23,463 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 176 selfloop transitions, 41 changer transitions 0/219 dead transitions. [2024-06-14 15:11:23,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 219 transitions, 2727 flow [2024-06-14 15:11:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:11:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:11:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-14 15:11:23,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2024-06-14 15:11:23,464 INFO L175 Difference]: Start difference. First operand has 195 places, 190 transitions, 2067 flow. Second operand 10 states and 132 transitions. [2024-06-14 15:11:23,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 219 transitions, 2727 flow [2024-06-14 15:11:23,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 219 transitions, 2667 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:11:23,538 INFO L231 Difference]: Finished difference. Result has 202 places, 200 transitions, 2215 flow [2024-06-14 15:11:23,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2007, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2215, PETRI_PLACES=202, PETRI_TRANSITIONS=200} [2024-06-14 15:11:23,538 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 169 predicate places. [2024-06-14 15:11:23,538 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 200 transitions, 2215 flow [2024-06-14 15:11:23,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:23,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:23,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:23,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:11:23,539 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:11:23,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:23,539 INFO L85 PathProgramCache]: Analyzing trace with hash 181225530, now seen corresponding path program 8 times [2024-06-14 15:11:23,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:23,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883168135] [2024-06-14 15:11:23,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:23,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:11:34,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:34,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883168135] [2024-06-14 15:11:34,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883168135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:34,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:34,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:34,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534528753] [2024-06-14 15:11:34,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:34,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:34,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:34,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:34,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:34,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:11:34,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 200 transitions, 2215 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:34,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:34,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:11:34,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:34,842 INFO L124 PetriNetUnfolderBase]: 496/879 cut-off events. [2024-06-14 15:11:34,842 INFO L125 PetriNetUnfolderBase]: For 58205/58205 co-relation queries the response was YES. [2024-06-14 15:11:34,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6982 conditions, 879 events. 496/879 cut-off events. For 58205/58205 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3939 event pairs, 116 based on Foata normal form. 1/880 useless extension candidates. Maximal degree in co-relation 6890. Up to 734 conditions per place. [2024-06-14 15:11:34,848 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 155 selfloop transitions, 34 changer transitions 0/216 dead transitions. [2024-06-14 15:11:34,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 216 transitions, 2757 flow [2024-06-14 15:11:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:11:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:11:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-14 15:11:34,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38529411764705884 [2024-06-14 15:11:34,853 INFO L175 Difference]: Start difference. First operand has 202 places, 200 transitions, 2215 flow. Second operand 10 states and 131 transitions. [2024-06-14 15:11:34,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 216 transitions, 2757 flow [2024-06-14 15:11:34,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 216 transitions, 2728 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-14 15:11:34,949 INFO L231 Difference]: Finished difference. Result has 210 places, 202 transitions, 2295 flow [2024-06-14 15:11:34,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2295, PETRI_PLACES=210, PETRI_TRANSITIONS=202} [2024-06-14 15:11:34,950 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 177 predicate places. [2024-06-14 15:11:34,950 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 202 transitions, 2295 flow [2024-06-14 15:11:34,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:34,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:34,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:34,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:11:34,950 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:11:34,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:34,951 INFO L85 PathProgramCache]: Analyzing trace with hash 181225716, now seen corresponding path program 7 times [2024-06-14 15:11:34,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:34,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363747162] [2024-06-14 15:11:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:34,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:11:45,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:45,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363747162] [2024-06-14 15:11:45,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363747162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:45,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:45,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:45,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837995252] [2024-06-14 15:11:45,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:45,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:45,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:45,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:45,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:45,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:11:45,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 202 transitions, 2295 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:45,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:45,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:11:45,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:46,119 INFO L124 PetriNetUnfolderBase]: 514/896 cut-off events. [2024-06-14 15:11:46,120 INFO L125 PetriNetUnfolderBase]: For 59162/59162 co-relation queries the response was YES. [2024-06-14 15:11:46,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7142 conditions, 896 events. 514/896 cut-off events. For 59162/59162 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3954 event pairs, 126 based on Foata normal form. 1/897 useless extension candidates. Maximal degree in co-relation 7048. Up to 791 conditions per place. [2024-06-14 15:11:46,129 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 173 selfloop transitions, 41 changer transitions 0/216 dead transitions. [2024-06-14 15:11:46,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 216 transitions, 2853 flow [2024-06-14 15:11:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:11:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:11:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:11:46,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37058823529411766 [2024-06-14 15:11:46,132 INFO L175 Difference]: Start difference. First operand has 210 places, 202 transitions, 2295 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:11:46,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 216 transitions, 2853 flow [2024-06-14 15:11:46,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 216 transitions, 2766 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 15:11:46,241 INFO L231 Difference]: Finished difference. Result has 213 places, 202 transitions, 2295 flow [2024-06-14 15:11:46,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2208, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2295, PETRI_PLACES=213, PETRI_TRANSITIONS=202} [2024-06-14 15:11:46,242 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 180 predicate places. [2024-06-14 15:11:46,242 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 202 transitions, 2295 flow [2024-06-14 15:11:46,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:46,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:46,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:46,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:11:46,242 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:11:46,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:46,243 INFO L85 PathProgramCache]: Analyzing trace with hash 182169714, now seen corresponding path program 3 times [2024-06-14 15:11:46,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:46,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651071975] [2024-06-14 15:11:46,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:46,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:56,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 15:11:56,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:56,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651071975] [2024-06-14 15:11:56,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651071975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:56,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:56,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:11:56,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489350655] [2024-06-14 15:11:56,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:56,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:11:56,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:56,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:11:56,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:11:56,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:11:56,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 202 transitions, 2295 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:56,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:56,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:11:56,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:57,554 INFO L124 PetriNetUnfolderBase]: 523/911 cut-off events. [2024-06-14 15:11:57,554 INFO L125 PetriNetUnfolderBase]: For 64034/64034 co-relation queries the response was YES. [2024-06-14 15:11:57,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7260 conditions, 911 events. 523/911 cut-off events. For 64034/64034 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4035 event pairs, 125 based on Foata normal form. 3/914 useless extension candidates. Maximal degree in co-relation 7165. Up to 775 conditions per place. [2024-06-14 15:11:57,562 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 181 selfloop transitions, 45 changer transitions 0/228 dead transitions. [2024-06-14 15:11:57,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 228 transitions, 2939 flow [2024-06-14 15:11:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:11:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:11:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2024-06-14 15:11:57,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-14 15:11:57,563 INFO L175 Difference]: Start difference. First operand has 213 places, 202 transitions, 2295 flow. Second operand 12 states and 152 transitions. [2024-06-14 15:11:57,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 228 transitions, 2939 flow [2024-06-14 15:11:57,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 228 transitions, 2851 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-14 15:11:57,674 INFO L231 Difference]: Finished difference. Result has 216 places, 205 transitions, 2336 flow [2024-06-14 15:11:57,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2207, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2336, PETRI_PLACES=216, PETRI_TRANSITIONS=205} [2024-06-14 15:11:57,674 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 183 predicate places. [2024-06-14 15:11:57,674 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 205 transitions, 2336 flow [2024-06-14 15:11:57,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:57,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:57,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:57,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:11:57,675 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:11:57,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:57,675 INFO L85 PathProgramCache]: Analyzing trace with hash -427354394, now seen corresponding path program 8 times [2024-06-14 15:11:57,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:57,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247910815] [2024-06-14 15:11:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:57,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:12:07,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:07,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247910815] [2024-06-14 15:12:07,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247910815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:07,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:07,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:07,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610523860] [2024-06-14 15:12:07,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:07,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:07,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:07,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:07,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:07,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:12:07,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 205 transitions, 2336 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:07,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:07,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:12:07,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:08,380 INFO L124 PetriNetUnfolderBase]: 531/924 cut-off events. [2024-06-14 15:12:08,380 INFO L125 PetriNetUnfolderBase]: For 65460/65460 co-relation queries the response was YES. [2024-06-14 15:12:08,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7454 conditions, 924 events. 531/924 cut-off events. For 65460/65460 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4101 event pairs, 124 based on Foata normal form. 1/925 useless extension candidates. Maximal degree in co-relation 7358. Up to 816 conditions per place. [2024-06-14 15:12:08,388 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 178 selfloop transitions, 46 changer transitions 0/226 dead transitions. [2024-06-14 15:12:08,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 226 transitions, 3066 flow [2024-06-14 15:12:08,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:12:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:12:08,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2024-06-14 15:12:08,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2024-06-14 15:12:08,391 INFO L175 Difference]: Start difference. First operand has 216 places, 205 transitions, 2336 flow. Second operand 12 states and 144 transitions. [2024-06-14 15:12:08,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 226 transitions, 3066 flow [2024-06-14 15:12:08,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 226 transitions, 2963 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 15:12:08,498 INFO L231 Difference]: Finished difference. Result has 220 places, 209 transitions, 2374 flow [2024-06-14 15:12:08,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2233, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2374, PETRI_PLACES=220, PETRI_TRANSITIONS=209} [2024-06-14 15:12:08,499 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 187 predicate places. [2024-06-14 15:12:08,499 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 209 transitions, 2374 flow [2024-06-14 15:12:08,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:08,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:08,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:08,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:12:08,499 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:08,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash -427360904, now seen corresponding path program 9 times [2024-06-14 15:12:08,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:08,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225550193] [2024-06-14 15:12:08,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:12:19,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:19,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225550193] [2024-06-14 15:12:19,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225550193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:19,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:19,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:19,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120102051] [2024-06-14 15:12:19,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:19,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:19,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:19,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:19,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:19,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:12:19,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 209 transitions, 2374 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:19,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:19,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:12:19,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:19,831 INFO L124 PetriNetUnfolderBase]: 529/921 cut-off events. [2024-06-14 15:12:19,831 INFO L125 PetriNetUnfolderBase]: For 66628/66628 co-relation queries the response was YES. [2024-06-14 15:12:19,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7413 conditions, 921 events. 529/921 cut-off events. For 66628/66628 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4082 event pairs, 124 based on Foata normal form. 1/922 useless extension candidates. Maximal degree in co-relation 7316. Up to 814 conditions per place. [2024-06-14 15:12:19,838 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 176 selfloop transitions, 47 changer transitions 0/225 dead transitions. [2024-06-14 15:12:19,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 225 transitions, 2960 flow [2024-06-14 15:12:19,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:12:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:12:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2024-06-14 15:12:19,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3480392156862745 [2024-06-14 15:12:19,840 INFO L175 Difference]: Start difference. First operand has 220 places, 209 transitions, 2374 flow. Second operand 12 states and 142 transitions. [2024-06-14 15:12:19,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 225 transitions, 2960 flow [2024-06-14 15:12:19,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 225 transitions, 2861 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:12:19,984 INFO L231 Difference]: Finished difference. Result has 223 places, 209 transitions, 2374 flow [2024-06-14 15:12:19,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2275, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2374, PETRI_PLACES=223, PETRI_TRANSITIONS=209} [2024-06-14 15:12:19,984 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 190 predicate places. [2024-06-14 15:12:19,984 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 209 transitions, 2374 flow [2024-06-14 15:12:19,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:19,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:19,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:19,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:12:19,985 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:19,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:19,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1210211366, now seen corresponding path program 9 times [2024-06-14 15:12:19,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:19,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957708966] [2024-06-14 15:12:19,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:19,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:12:30,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:30,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957708966] [2024-06-14 15:12:30,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957708966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:30,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:30,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:30,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496942683] [2024-06-14 15:12:30,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:30,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:30,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:30,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:30,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:30,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:12:30,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 209 transitions, 2374 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:30,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:30,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:12:30,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:31,417 INFO L124 PetriNetUnfolderBase]: 507/898 cut-off events. [2024-06-14 15:12:31,417 INFO L125 PetriNetUnfolderBase]: For 68019/68019 co-relation queries the response was YES. [2024-06-14 15:12:31,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7270 conditions, 898 events. 507/898 cut-off events. For 68019/68019 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4051 event pairs, 116 based on Foata normal form. 1/899 useless extension candidates. Maximal degree in co-relation 7172. Up to 751 conditions per place. [2024-06-14 15:12:31,423 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 160 selfloop transitions, 35 changer transitions 0/224 dead transitions. [2024-06-14 15:12:31,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 224 transitions, 2802 flow [2024-06-14 15:12:31,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:12:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:12:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2024-06-14 15:12:31,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3627450980392157 [2024-06-14 15:12:31,424 INFO L175 Difference]: Start difference. First operand has 223 places, 209 transitions, 2374 flow. Second operand 12 states and 148 transitions. [2024-06-14 15:12:31,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 224 transitions, 2802 flow [2024-06-14 15:12:31,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 224 transitions, 2668 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-14 15:12:31,551 INFO L231 Difference]: Finished difference. Result has 223 places, 209 transitions, 2315 flow [2024-06-14 15:12:31,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2315, PETRI_PLACES=223, PETRI_TRANSITIONS=209} [2024-06-14 15:12:31,552 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 190 predicate places. [2024-06-14 15:12:31,552 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 209 transitions, 2315 flow [2024-06-14 15:12:31,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:31,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:31,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:31,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:12:31,552 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:31,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1210457320, now seen corresponding path program 4 times [2024-06-14 15:12:31,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:31,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632315206] [2024-06-14 15:12:31,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:31,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:12:42,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:42,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632315206] [2024-06-14 15:12:42,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632315206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:42,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:42,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096486463] [2024-06-14 15:12:42,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:42,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:42,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:42,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:42,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:42,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:12:42,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 209 transitions, 2315 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:42,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:42,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:12:42,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:43,339 INFO L124 PetriNetUnfolderBase]: 536/933 cut-off events. [2024-06-14 15:12:43,339 INFO L125 PetriNetUnfolderBase]: For 72790/72790 co-relation queries the response was YES. [2024-06-14 15:12:43,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7461 conditions, 933 events. 536/933 cut-off events. For 72790/72790 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4174 event pairs, 125 based on Foata normal form. 3/936 useless extension candidates. Maximal degree in co-relation 7362. Up to 790 conditions per place. [2024-06-14 15:12:43,348 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 180 selfloop transitions, 53 changer transitions 0/235 dead transitions. [2024-06-14 15:12:43,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 235 transitions, 2978 flow [2024-06-14 15:12:43,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-14 15:12:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-14 15:12:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 162 transitions. [2024-06-14 15:12:43,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3403361344537815 [2024-06-14 15:12:43,349 INFO L175 Difference]: Start difference. First operand has 223 places, 209 transitions, 2315 flow. Second operand 14 states and 162 transitions. [2024-06-14 15:12:43,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 235 transitions, 2978 flow [2024-06-14 15:12:43,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 235 transitions, 2879 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-14 15:12:43,487 INFO L231 Difference]: Finished difference. Result has 226 places, 212 transitions, 2362 flow [2024-06-14 15:12:43,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2216, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2362, PETRI_PLACES=226, PETRI_TRANSITIONS=212} [2024-06-14 15:12:43,487 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 193 predicate places. [2024-06-14 15:12:43,488 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 212 transitions, 2362 flow [2024-06-14 15:12:43,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:43,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:43,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:43,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:12:43,488 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:43,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:43,489 INFO L85 PathProgramCache]: Analyzing trace with hash -427123754, now seen corresponding path program 10 times [2024-06-14 15:12:43,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:43,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273393651] [2024-06-14 15:12:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:43,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:12:54,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:54,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273393651] [2024-06-14 15:12:54,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273393651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:54,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:54,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:12:54,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795647722] [2024-06-14 15:12:54,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:54,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:12:54,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:54,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:12:54,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:12:54,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:12:54,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 212 transitions, 2362 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:54,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:54,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:12:54,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:55,066 INFO L124 PetriNetUnfolderBase]: 534/930 cut-off events. [2024-06-14 15:12:55,066 INFO L125 PetriNetUnfolderBase]: For 71406/71406 co-relation queries the response was YES. [2024-06-14 15:12:55,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7490 conditions, 930 events. 534/930 cut-off events. For 71406/71406 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4156 event pairs, 124 based on Foata normal form. 1/931 useless extension candidates. Maximal degree in co-relation 7390. Up to 824 conditions per place. [2024-06-14 15:12:55,075 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 176 selfloop transitions, 50 changer transitions 0/228 dead transitions. [2024-06-14 15:12:55,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 228 transitions, 2854 flow [2024-06-14 15:12:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:12:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:12:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2024-06-14 15:12:55,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.332579185520362 [2024-06-14 15:12:55,076 INFO L175 Difference]: Start difference. First operand has 226 places, 212 transitions, 2362 flow. Second operand 13 states and 147 transitions. [2024-06-14 15:12:55,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 228 transitions, 2854 flow [2024-06-14 15:12:55,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 228 transitions, 2745 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-14 15:12:55,213 INFO L231 Difference]: Finished difference. Result has 229 places, 212 transitions, 2358 flow [2024-06-14 15:12:55,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2253, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2358, PETRI_PLACES=229, PETRI_TRANSITIONS=212} [2024-06-14 15:12:55,214 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 196 predicate places. [2024-06-14 15:12:55,214 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 212 transitions, 2358 flow [2024-06-14 15:12:55,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:12:55,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:55,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:55,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:12:55,214 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:12:55,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1210448950, now seen corresponding path program 5 times [2024-06-14 15:12:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:55,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748613417] [2024-06-14 15:12:55,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:55,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:13:05,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:05,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748613417] [2024-06-14 15:13:05,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748613417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:05,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:05,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:13:05,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250335471] [2024-06-14 15:13:05,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:05,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:13:05,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:05,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:13:05,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:13:05,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:13:05,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 212 transitions, 2358 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:05,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:05,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:13:05,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:06,198 INFO L124 PetriNetUnfolderBase]: 528/921 cut-off events. [2024-06-14 15:13:06,198 INFO L125 PetriNetUnfolderBase]: For 72376/72376 co-relation queries the response was YES. [2024-06-14 15:13:06,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7298 conditions, 921 events. 528/921 cut-off events. For 72376/72376 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4092 event pairs, 123 based on Foata normal form. 3/924 useless extension candidates. Maximal degree in co-relation 7197. Up to 783 conditions per place. [2024-06-14 15:13:06,206 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 183 selfloop transitions, 50 changer transitions 0/235 dead transitions. [2024-06-14 15:13:06,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 235 transitions, 2887 flow [2024-06-14 15:13:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:13:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:13:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2024-06-14 15:13:06,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3552036199095023 [2024-06-14 15:13:06,207 INFO L175 Difference]: Start difference. First operand has 229 places, 212 transitions, 2358 flow. Second operand 13 states and 157 transitions. [2024-06-14 15:13:06,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 235 transitions, 2887 flow [2024-06-14 15:13:06,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 235 transitions, 2750 flow, removed 5 selfloop flow, removed 14 redundant places. [2024-06-14 15:13:06,330 INFO L231 Difference]: Finished difference. Result has 228 places, 212 transitions, 2327 flow [2024-06-14 15:13:06,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2327, PETRI_PLACES=228, PETRI_TRANSITIONS=212} [2024-06-14 15:13:06,330 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 195 predicate places. [2024-06-14 15:13:06,330 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 212 transitions, 2327 flow [2024-06-14 15:13:06,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:06,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:06,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:06,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:13:06,331 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:06,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:06,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1956790796, now seen corresponding path program 10 times [2024-06-14 15:13:06,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:06,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637476896] [2024-06-14 15:13:06,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:06,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:13:14,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:14,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637476896] [2024-06-14 15:13:14,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637476896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:14,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:14,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:13:14,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615270758] [2024-06-14 15:13:14,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:14,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:13:14,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:14,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:13:14,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:13:15,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:13:15,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 212 transitions, 2327 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:15,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:15,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:13:15,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:15,602 INFO L124 PetriNetUnfolderBase]: 511/906 cut-off events. [2024-06-14 15:13:15,602 INFO L125 PetriNetUnfolderBase]: For 75185/75186 co-relation queries the response was YES. [2024-06-14 15:13:15,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7318 conditions, 906 events. 511/906 cut-off events. For 75185/75186 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4135 event pairs, 101 based on Foata normal form. 1/906 useless extension candidates. Maximal degree in co-relation 7216. Up to 737 conditions per place. [2024-06-14 15:13:15,610 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 158 selfloop transitions, 43 changer transitions 0/230 dead transitions. [2024-06-14 15:13:15,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 230 transitions, 2809 flow [2024-06-14 15:13:15,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:13:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:13:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 15:13:15,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 15:13:15,613 INFO L175 Difference]: Start difference. First operand has 228 places, 212 transitions, 2327 flow. Second operand 9 states and 119 transitions. [2024-06-14 15:13:15,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 230 transitions, 2809 flow [2024-06-14 15:13:15,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 230 transitions, 2688 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-06-14 15:13:15,731 INFO L231 Difference]: Finished difference. Result has 224 places, 214 transitions, 2351 flow [2024-06-14 15:13:15,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2206, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2351, PETRI_PLACES=224, PETRI_TRANSITIONS=214} [2024-06-14 15:13:15,731 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 191 predicate places. [2024-06-14 15:13:15,731 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 214 transitions, 2351 flow [2024-06-14 15:13:15,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:15,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:15,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:15,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:13:15,732 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:15,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:15,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1956670640, now seen corresponding path program 11 times [2024-06-14 15:13:15,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:15,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711798950] [2024-06-14 15:13:15,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:15,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:23,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 15:13:23,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:23,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711798950] [2024-06-14 15:13:23,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711798950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:23,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:23,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:13:23,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727465170] [2024-06-14 15:13:23,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:23,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:13:23,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:23,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:13:23,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:13:23,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:13:23,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 214 transitions, 2351 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:23,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:23,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:13:23,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:24,403 INFO L124 PetriNetUnfolderBase]: 534/930 cut-off events. [2024-06-14 15:13:24,404 INFO L125 PetriNetUnfolderBase]: For 74224/74224 co-relation queries the response was YES. [2024-06-14 15:13:24,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7478 conditions, 930 events. 534/930 cut-off events. For 74224/74224 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4174 event pairs, 96 based on Foata normal form. 1/931 useless extension candidates. Maximal degree in co-relation 7375. Up to 709 conditions per place. [2024-06-14 15:13:24,412 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 134 selfloop transitions, 95 changer transitions 0/231 dead transitions. [2024-06-14 15:13:24,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 231 transitions, 2977 flow [2024-06-14 15:13:24,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:13:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:13:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 15:13:24,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-14 15:13:24,413 INFO L175 Difference]: Start difference. First operand has 224 places, 214 transitions, 2351 flow. Second operand 9 states and 117 transitions. [2024-06-14 15:13:24,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 231 transitions, 2977 flow [2024-06-14 15:13:24,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 231 transitions, 2882 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-14 15:13:24,562 INFO L231 Difference]: Finished difference. Result has 226 places, 216 transitions, 2480 flow [2024-06-14 15:13:24,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2480, PETRI_PLACES=226, PETRI_TRANSITIONS=216} [2024-06-14 15:13:24,562 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 193 predicate places. [2024-06-14 15:13:24,562 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 216 transitions, 2480 flow [2024-06-14 15:13:24,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:24,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:24,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:24,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:13:24,562 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:24,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:24,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1956670826, now seen corresponding path program 11 times [2024-06-14 15:13:24,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:24,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010498722] [2024-06-14 15:13:24,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:24,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:13:32,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:32,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010498722] [2024-06-14 15:13:32,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010498722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:32,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:32,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:13:32,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037277038] [2024-06-14 15:13:32,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:32,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:13:32,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:32,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:13:32,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:13:33,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:13:33,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 216 transitions, 2480 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:33,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:33,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:13:33,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:33,454 INFO L124 PetriNetUnfolderBase]: 519/919 cut-off events. [2024-06-14 15:13:33,455 INFO L125 PetriNetUnfolderBase]: For 80856/80858 co-relation queries the response was YES. [2024-06-14 15:13:33,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7596 conditions, 919 events. 519/919 cut-off events. For 80856/80858 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4220 event pairs, 91 based on Foata normal form. 1/917 useless extension candidates. Maximal degree in co-relation 7492. Up to 659 conditions per place. [2024-06-14 15:13:33,463 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 122 selfloop transitions, 83 changer transitions 0/235 dead transitions. [2024-06-14 15:13:33,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 235 transitions, 3116 flow [2024-06-14 15:13:33,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:13:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:13:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-14 15:13:33,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2024-06-14 15:13:33,464 INFO L175 Difference]: Start difference. First operand has 226 places, 216 transitions, 2480 flow. Second operand 9 states and 123 transitions. [2024-06-14 15:13:33,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 235 transitions, 3116 flow [2024-06-14 15:13:33,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 235 transitions, 2955 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-14 15:13:33,610 INFO L231 Difference]: Finished difference. Result has 225 places, 220 transitions, 2585 flow [2024-06-14 15:13:33,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2325, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2585, PETRI_PLACES=225, PETRI_TRANSITIONS=220} [2024-06-14 15:13:33,611 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 192 predicate places. [2024-06-14 15:13:33,611 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 220 transitions, 2585 flow [2024-06-14 15:13:33,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:33,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:33,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:33,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:13:33,611 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:33,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:33,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1359300669, now seen corresponding path program 1 times [2024-06-14 15:13:33,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:33,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757869318] [2024-06-14 15:13:33,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:33,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:13:44,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:44,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757869318] [2024-06-14 15:13:44,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757869318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:44,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:44,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:13:44,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54379625] [2024-06-14 15:13:44,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:44,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:13:44,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:44,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:13:44,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:13:44,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:13:44,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 220 transitions, 2585 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:44,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:44,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:13:44,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:45,494 INFO L124 PetriNetUnfolderBase]: 576/998 cut-off events. [2024-06-14 15:13:45,494 INFO L125 PetriNetUnfolderBase]: For 81656/81656 co-relation queries the response was YES. [2024-06-14 15:13:45,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8107 conditions, 998 events. 576/998 cut-off events. For 81656/81656 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4551 event pairs, 105 based on Foata normal form. 3/1001 useless extension candidates. Maximal degree in co-relation 8006. Up to 641 conditions per place. [2024-06-14 15:13:45,503 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 182 selfloop transitions, 69 changer transitions 0/253 dead transitions. [2024-06-14 15:13:45,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 253 transitions, 3551 flow [2024-06-14 15:13:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:13:45,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:13:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-14 15:13:45,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4037433155080214 [2024-06-14 15:13:45,504 INFO L175 Difference]: Start difference. First operand has 225 places, 220 transitions, 2585 flow. Second operand 11 states and 151 transitions. [2024-06-14 15:13:45,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 253 transitions, 3551 flow [2024-06-14 15:13:45,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 253 transitions, 3430 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-14 15:13:45,624 INFO L231 Difference]: Finished difference. Result has 230 places, 228 transitions, 2723 flow [2024-06-14 15:13:45,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2476, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2723, PETRI_PLACES=230, PETRI_TRANSITIONS=228} [2024-06-14 15:13:45,625 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 197 predicate places. [2024-06-14 15:13:45,625 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 228 transitions, 2723 flow [2024-06-14 15:13:45,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:45,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:45,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:45,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:13:45,625 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:45,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1082945408, now seen corresponding path program 12 times [2024-06-14 15:13:45,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:45,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811067121] [2024-06-14 15:13:45,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:13:52,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:52,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811067121] [2024-06-14 15:13:52,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811067121] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:52,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:52,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:13:52,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013539102] [2024-06-14 15:13:52,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:52,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:13:52,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:52,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:13:52,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:13:53,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:13:53,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 228 transitions, 2723 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:53,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:53,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:13:53,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:53,426 INFO L124 PetriNetUnfolderBase]: 584/1012 cut-off events. [2024-06-14 15:13:53,427 INFO L125 PetriNetUnfolderBase]: For 77550/77550 co-relation queries the response was YES. [2024-06-14 15:13:53,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8355 conditions, 1012 events. 584/1012 cut-off events. For 77550/77550 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4596 event pairs, 102 based on Foata normal form. 1/1013 useless extension candidates. Maximal degree in co-relation 8253. Up to 787 conditions per place. [2024-06-14 15:13:53,434 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 152 selfloop transitions, 92 changer transitions 0/246 dead transitions. [2024-06-14 15:13:53,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 246 transitions, 3503 flow [2024-06-14 15:13:53,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:13:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:13:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-14 15:13:53,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4084967320261438 [2024-06-14 15:13:53,435 INFO L175 Difference]: Start difference. First operand has 230 places, 228 transitions, 2723 flow. Second operand 9 states and 125 transitions. [2024-06-14 15:13:53,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 246 transitions, 3503 flow [2024-06-14 15:13:53,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 246 transitions, 3441 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-14 15:13:53,563 INFO L231 Difference]: Finished difference. Result has 234 places, 232 transitions, 2902 flow [2024-06-14 15:13:53,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2902, PETRI_PLACES=234, PETRI_TRANSITIONS=232} [2024-06-14 15:13:53,564 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 201 predicate places. [2024-06-14 15:13:53,564 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 232 transitions, 2902 flow [2024-06-14 15:13:53,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:53,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:53,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 15:13:53,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:13:53,565 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:13:53,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:53,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1082945160, now seen corresponding path program 6 times [2024-06-14 15:13:53,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:53,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881494149] [2024-06-14 15:13:53,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:53,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:00,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 15:14:00,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:00,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881494149] [2024-06-14 15:14:00,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881494149] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:00,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:00,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:14:00,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822665209] [2024-06-14 15:14:00,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:00,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:14:00,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:00,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:14:00,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:14:01,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:14:01,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 232 transitions, 2902 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:01,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:01,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:14:01,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:01,556 INFO L124 PetriNetUnfolderBase]: 603/1043 cut-off events. [2024-06-14 15:14:01,556 INFO L125 PetriNetUnfolderBase]: For 86615/86615 co-relation queries the response was YES. [2024-06-14 15:14:01,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8806 conditions, 1043 events. 603/1043 cut-off events. For 86615/86615 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4788 event pairs, 184 based on Foata normal form. 3/1046 useless extension candidates. Maximal degree in co-relation 8702. Up to 875 conditions per place. [2024-06-14 15:14:01,565 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 207 selfloop transitions, 46 changer transitions 0/255 dead transitions. [2024-06-14 15:14:01,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 255 transitions, 3675 flow [2024-06-14 15:14:01,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:14:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:14:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:14:01,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36470588235294116 [2024-06-14 15:14:01,566 INFO L175 Difference]: Start difference. First operand has 234 places, 232 transitions, 2902 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:14:01,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 255 transitions, 3675 flow [2024-06-14 15:14:01,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 255 transitions, 3547 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:14:01,712 INFO L231 Difference]: Finished difference. Result has 239 places, 239 transitions, 3041 flow [2024-06-14 15:14:01,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2779, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3041, PETRI_PLACES=239, PETRI_TRANSITIONS=239} [2024-06-14 15:14:01,713 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 206 predicate places. [2024-06-14 15:14:01,713 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 239 transitions, 3041 flow [2024-06-14 15:14:01,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:01,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:01,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:01,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:14:01,713 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:01,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:01,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1952029010, now seen corresponding path program 13 times [2024-06-14 15:14:01,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:01,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235784931] [2024-06-14 15:14:01,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:01,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:14:09,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:09,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235784931] [2024-06-14 15:14:09,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235784931] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:09,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:09,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:14:09,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793025] [2024-06-14 15:14:09,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:09,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:14:09,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:09,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:14:09,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:14:09,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:14:09,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 239 transitions, 3041 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:09,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:09,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:14:09,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:10,260 INFO L124 PetriNetUnfolderBase]: 601/1040 cut-off events. [2024-06-14 15:14:10,260 INFO L125 PetriNetUnfolderBase]: For 79605/79605 co-relation queries the response was YES. [2024-06-14 15:14:10,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8752 conditions, 1040 events. 601/1040 cut-off events. For 79605/79605 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4757 event pairs, 105 based on Foata normal form. 1/1041 useless extension candidates. Maximal degree in co-relation 8647. Up to 816 conditions per place. [2024-06-14 15:14:10,270 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 161 selfloop transitions, 89 changer transitions 0/252 dead transitions. [2024-06-14 15:14:10,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 252 transitions, 3679 flow [2024-06-14 15:14:10,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:14:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:14:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 15:14:10,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790849673202614 [2024-06-14 15:14:10,273 INFO L175 Difference]: Start difference. First operand has 239 places, 239 transitions, 3041 flow. Second operand 9 states and 116 transitions. [2024-06-14 15:14:10,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 252 transitions, 3679 flow [2024-06-14 15:14:10,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 252 transitions, 3593 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-14 15:14:10,424 INFO L231 Difference]: Finished difference. Result has 242 places, 239 transitions, 3144 flow [2024-06-14 15:14:10,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2955, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3144, PETRI_PLACES=242, PETRI_TRANSITIONS=239} [2024-06-14 15:14:10,425 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 209 predicate places. [2024-06-14 15:14:10,425 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 239 transitions, 3144 flow [2024-06-14 15:14:10,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:10,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:10,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:10,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:14:10,425 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:10,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:10,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1794847348, now seen corresponding path program 12 times [2024-06-14 15:14:10,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:10,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449102774] [2024-06-14 15:14:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:10,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:14:18,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:18,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449102774] [2024-06-14 15:14:18,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449102774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:18,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:18,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:14:18,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836927174] [2024-06-14 15:14:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:18,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:14:18,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:18,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:14:18,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:14:18,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:14:18,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 239 transitions, 3144 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:18,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:18,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:14:18,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:19,356 INFO L124 PetriNetUnfolderBase]: 580/1019 cut-off events. [2024-06-14 15:14:19,356 INFO L125 PetriNetUnfolderBase]: For 83151/83151 co-relation queries the response was YES. [2024-06-14 15:14:19,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8816 conditions, 1019 events. 580/1019 cut-off events. For 83151/83151 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4722 event pairs, 74 based on Foata normal form. 1/1020 useless extension candidates. Maximal degree in co-relation 8710. Up to 755 conditions per place. [2024-06-14 15:14:19,366 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 140 selfloop transitions, 82 changer transitions 0/254 dead transitions. [2024-06-14 15:14:19,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 254 transitions, 3766 flow [2024-06-14 15:14:19,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:14:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:14:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-14 15:14:19,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3954248366013072 [2024-06-14 15:14:19,367 INFO L175 Difference]: Start difference. First operand has 242 places, 239 transitions, 3144 flow. Second operand 9 states and 121 transitions. [2024-06-14 15:14:19,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 254 transitions, 3766 flow [2024-06-14 15:14:19,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 254 transitions, 3553 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-14 15:14:19,512 INFO L231 Difference]: Finished difference. Result has 241 places, 241 transitions, 3148 flow [2024-06-14 15:14:19,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2935, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3148, PETRI_PLACES=241, PETRI_TRANSITIONS=241} [2024-06-14 15:14:19,513 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 208 predicate places. [2024-06-14 15:14:19,513 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 241 transitions, 3148 flow [2024-06-14 15:14:19,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:19,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:19,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:19,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:14:19,514 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:19,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:19,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1967583192, now seen corresponding path program 7 times [2024-06-14 15:14:19,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:19,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933574855] [2024-06-14 15:14:19,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:19,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:14:27,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:27,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933574855] [2024-06-14 15:14:27,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933574855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:27,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:27,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:14:27,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221961767] [2024-06-14 15:14:27,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:27,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:14:27,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:27,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:14:27,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:14:27,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:14:27,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 241 transitions, 3148 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:27,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:27,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:14:27,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:27,955 INFO L124 PetriNetUnfolderBase]: 628/1084 cut-off events. [2024-06-14 15:14:27,955 INFO L125 PetriNetUnfolderBase]: For 86870/86870 co-relation queries the response was YES. [2024-06-14 15:14:27,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9251 conditions, 1084 events. 628/1084 cut-off events. For 86870/86870 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5006 event pairs, 118 based on Foata normal form. 3/1087 useless extension candidates. Maximal degree in co-relation 9146. Up to 795 conditions per place. [2024-06-14 15:14:27,966 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 180 selfloop transitions, 84 changer transitions 0/266 dead transitions. [2024-06-14 15:14:27,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 266 transitions, 4031 flow [2024-06-14 15:14:27,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:14:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:14:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-14 15:14:27,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2024-06-14 15:14:27,967 INFO L175 Difference]: Start difference. First operand has 241 places, 241 transitions, 3148 flow. Second operand 9 states and 120 transitions. [2024-06-14 15:14:27,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 266 transitions, 4031 flow [2024-06-14 15:14:28,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 266 transitions, 3869 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 15:14:28,134 INFO L231 Difference]: Finished difference. Result has 242 places, 247 transitions, 3250 flow [2024-06-14 15:14:28,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2994, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3250, PETRI_PLACES=242, PETRI_TRANSITIONS=247} [2024-06-14 15:14:28,135 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 209 predicate places. [2024-06-14 15:14:28,135 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 247 transitions, 3250 flow [2024-06-14 15:14:28,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:28,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:28,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 15:14:28,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:14:28,135 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:28,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:28,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1967343934, now seen corresponding path program 14 times [2024-06-14 15:14:28,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:28,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667442205] [2024-06-14 15:14:28,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:28,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:14:35,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:35,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667442205] [2024-06-14 15:14:35,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667442205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:35,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:35,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:14:35,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302227549] [2024-06-14 15:14:35,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:35,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:14:35,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:14:35,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:14:36,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:14:36,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 247 transitions, 3250 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:36,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:36,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:14:36,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:36,588 INFO L124 PetriNetUnfolderBase]: 641/1103 cut-off events. [2024-06-14 15:14:36,589 INFO L125 PetriNetUnfolderBase]: For 84475/84475 co-relation queries the response was YES. [2024-06-14 15:14:36,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9436 conditions, 1103 events. 641/1103 cut-off events. For 84475/84475 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5089 event pairs, 84 based on Foata normal form. 1/1104 useless extension candidates. Maximal degree in co-relation 9332. Up to 876 conditions per place. [2024-06-14 15:14:36,600 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 176 selfloop transitions, 88 changer transitions 0/266 dead transitions. [2024-06-14 15:14:36,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 266 transitions, 4195 flow [2024-06-14 15:14:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:14:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:14:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 15:14:36,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-14 15:14:36,603 INFO L175 Difference]: Start difference. First operand has 242 places, 247 transitions, 3250 flow. Second operand 9 states and 117 transitions. [2024-06-14 15:14:36,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 266 transitions, 4195 flow [2024-06-14 15:14:36,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 266 transitions, 4056 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-14 15:14:36,776 INFO L231 Difference]: Finished difference. Result has 245 places, 253 transitions, 3376 flow [2024-06-14 15:14:36,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3117, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3376, PETRI_PLACES=245, PETRI_TRANSITIONS=253} [2024-06-14 15:14:36,777 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 212 predicate places. [2024-06-14 15:14:36,777 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 253 transitions, 3376 flow [2024-06-14 15:14:36,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:36,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:36,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:36,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:14:36,778 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:36,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:36,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1779301970, now seen corresponding path program 15 times [2024-06-14 15:14:36,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:36,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705431623] [2024-06-14 15:14:36,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:36,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:14:44,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:44,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705431623] [2024-06-14 15:14:44,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705431623] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:44,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:44,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:14:44,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019554697] [2024-06-14 15:14:44,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:44,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:14:44,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:44,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:14:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:14:44,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:14:44,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 253 transitions, 3376 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:44,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:44,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:14:44,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:45,256 INFO L124 PetriNetUnfolderBase]: 639/1100 cut-off events. [2024-06-14 15:14:45,256 INFO L125 PetriNetUnfolderBase]: For 83421/83421 co-relation queries the response was YES. [2024-06-14 15:14:45,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9354 conditions, 1100 events. 639/1100 cut-off events. For 83421/83421 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5073 event pairs, 78 based on Foata normal form. 1/1101 useless extension candidates. Maximal degree in co-relation 9250. Up to 874 conditions per place. [2024-06-14 15:14:45,267 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 165 selfloop transitions, 98 changer transitions 0/265 dead transitions. [2024-06-14 15:14:45,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 265 transitions, 4138 flow [2024-06-14 15:14:45,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:14:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:14:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:14:45,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-14 15:14:45,269 INFO L175 Difference]: Start difference. First operand has 245 places, 253 transitions, 3376 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:14:45,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 265 transitions, 4138 flow [2024-06-14 15:14:45,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 265 transitions, 4004 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 15:14:45,415 INFO L231 Difference]: Finished difference. Result has 249 places, 253 transitions, 3450 flow [2024-06-14 15:14:45,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3246, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3450, PETRI_PLACES=249, PETRI_TRANSITIONS=253} [2024-06-14 15:14:45,415 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 216 predicate places. [2024-06-14 15:14:45,415 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 253 transitions, 3450 flow [2024-06-14 15:14:45,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:45,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:45,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:45,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:14:45,416 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:45,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:45,416 INFO L85 PathProgramCache]: Analyzing trace with hash -910224630, now seen corresponding path program 8 times [2024-06-14 15:14:45,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:45,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495663302] [2024-06-14 15:14:45,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:45,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:14:52,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:52,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495663302] [2024-06-14 15:14:52,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495663302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:52,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:52,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:14:52,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883478374] [2024-06-14 15:14:52,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:52,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:14:52,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:52,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:14:52,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:14:52,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:14:52,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 253 transitions, 3450 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:52,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:52,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:14:52,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:53,452 INFO L124 PetriNetUnfolderBase]: 648/1117 cut-off events. [2024-06-14 15:14:53,452 INFO L125 PetriNetUnfolderBase]: For 86670/86670 co-relation queries the response was YES. [2024-06-14 15:14:53,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9474 conditions, 1117 events. 648/1117 cut-off events. For 86670/86670 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5219 event pairs, 186 based on Foata normal form. 3/1120 useless extension candidates. Maximal degree in co-relation 9370. Up to 923 conditions per place. [2024-06-14 15:14:53,463 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 227 selfloop transitions, 47 changer transitions 0/276 dead transitions. [2024-06-14 15:14:53,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 276 transitions, 4314 flow [2024-06-14 15:14:53,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:14:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:14:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 15:14:53,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3764705882352941 [2024-06-14 15:14:53,464 INFO L175 Difference]: Start difference. First operand has 249 places, 253 transitions, 3450 flow. Second operand 10 states and 128 transitions. [2024-06-14 15:14:53,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 276 transitions, 4314 flow [2024-06-14 15:14:53,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 276 transitions, 4097 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:14:53,633 INFO L231 Difference]: Finished difference. Result has 250 places, 256 transitions, 3370 flow [2024-06-14 15:14:53,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3237, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3370, PETRI_PLACES=250, PETRI_TRANSITIONS=256} [2024-06-14 15:14:53,633 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 217 predicate places. [2024-06-14 15:14:53,634 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 256 transitions, 3370 flow [2024-06-14 15:14:53,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:14:53,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:53,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:53,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:14:53,634 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:14:53,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:53,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1967337424, now seen corresponding path program 16 times [2024-06-14 15:14:53,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:53,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862911140] [2024-06-14 15:14:53,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:53,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:15:01,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:01,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862911140] [2024-06-14 15:15:01,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862911140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:01,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:01,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:15:01,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435842094] [2024-06-14 15:15:01,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:01,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:15:01,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:01,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:15:01,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:15:01,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:15:01,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 256 transitions, 3370 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:01,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:01,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:15:01,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:02,501 INFO L124 PetriNetUnfolderBase]: 646/1112 cut-off events. [2024-06-14 15:15:02,501 INFO L125 PetriNetUnfolderBase]: For 82094/82094 co-relation queries the response was YES. [2024-06-14 15:15:02,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9313 conditions, 1112 events. 646/1112 cut-off events. For 82094/82094 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5138 event pairs, 80 based on Foata normal form. 1/1113 useless extension candidates. Maximal degree in co-relation 9209. Up to 887 conditions per place. [2024-06-14 15:15:02,512 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 175 selfloop transitions, 90 changer transitions 0/267 dead transitions. [2024-06-14 15:15:02,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 267 transitions, 4030 flow [2024-06-14 15:15:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:15:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:15:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:15:02,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-14 15:15:02,515 INFO L175 Difference]: Start difference. First operand has 250 places, 256 transitions, 3370 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:15:02,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 267 transitions, 4030 flow [2024-06-14 15:15:02,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 267 transitions, 3938 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-14 15:15:02,664 INFO L231 Difference]: Finished difference. Result has 253 places, 256 transitions, 3466 flow [2024-06-14 15:15:02,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3278, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3466, PETRI_PLACES=253, PETRI_TRANSITIONS=256} [2024-06-14 15:15:02,665 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 220 predicate places. [2024-06-14 15:15:02,665 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 256 transitions, 3466 flow [2024-06-14 15:15:02,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:02,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:02,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:02,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:15:02,666 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:02,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:02,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1779532362, now seen corresponding path program 9 times [2024-06-14 15:15:02,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:02,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160646143] [2024-06-14 15:15:02,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:02,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:15:10,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:10,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160646143] [2024-06-14 15:15:10,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160646143] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:10,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:10,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:15:10,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673761621] [2024-06-14 15:15:10,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:10,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:15:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:10,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:15:10,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:15:10,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:15:10,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 256 transitions, 3466 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:10,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:10,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:15:10,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:11,321 INFO L124 PetriNetUnfolderBase]: 640/1106 cut-off events. [2024-06-14 15:15:11,321 INFO L125 PetriNetUnfolderBase]: For 83681/83681 co-relation queries the response was YES. [2024-06-14 15:15:11,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9242 conditions, 1106 events. 640/1106 cut-off events. For 83681/83681 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5137 event pairs, 116 based on Foata normal form. 3/1109 useless extension candidates. Maximal degree in co-relation 9138. Up to 814 conditions per place. [2024-06-14 15:15:11,332 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 195 selfloop transitions, 79 changer transitions 0/276 dead transitions. [2024-06-14 15:15:11,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 276 transitions, 4195 flow [2024-06-14 15:15:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:15:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:15:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-14 15:15:11,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2024-06-14 15:15:11,333 INFO L175 Difference]: Start difference. First operand has 253 places, 256 transitions, 3466 flow. Second operand 9 states and 123 transitions. [2024-06-14 15:15:11,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 276 transitions, 4195 flow [2024-06-14 15:15:11,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 276 transitions, 3994 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-14 15:15:11,491 INFO L231 Difference]: Finished difference. Result has 253 places, 256 transitions, 3435 flow [2024-06-14 15:15:11,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3267, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3435, PETRI_PLACES=253, PETRI_TRANSITIONS=256} [2024-06-14 15:15:11,491 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 220 predicate places. [2024-06-14 15:15:11,491 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 256 transitions, 3435 flow [2024-06-14 15:15:11,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:11,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:11,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:11,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:15:11,492 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:11,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:11,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1779539306, now seen corresponding path program 13 times [2024-06-14 15:15:11,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:11,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752514910] [2024-06-14 15:15:11,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:11,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:15:19,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:19,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752514910] [2024-06-14 15:15:19,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752514910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:19,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:19,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:15:19,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545975730] [2024-06-14 15:15:19,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:19,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:15:19,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:19,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:15:19,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:15:19,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:15:19,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 256 transitions, 3435 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:19,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:19,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:15:19,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:20,169 INFO L124 PetriNetUnfolderBase]: 617/1082 cut-off events. [2024-06-14 15:15:20,169 INFO L125 PetriNetUnfolderBase]: For 81572/81572 co-relation queries the response was YES. [2024-06-14 15:15:20,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9141 conditions, 1082 events. 617/1082 cut-off events. For 81572/81572 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5111 event pairs, 79 based on Foata normal form. 1/1083 useless extension candidates. Maximal degree in co-relation 9037. Up to 811 conditions per place. [2024-06-14 15:15:20,179 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 154 selfloop transitions, 80 changer transitions 0/269 dead transitions. [2024-06-14 15:15:20,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 269 transitions, 4075 flow [2024-06-14 15:15:20,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:15:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:15:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 15:15:20,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 15:15:20,181 INFO L175 Difference]: Start difference. First operand has 253 places, 256 transitions, 3435 flow. Second operand 9 states and 119 transitions. [2024-06-14 15:15:20,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 269 transitions, 4075 flow [2024-06-14 15:15:20,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 269 transitions, 3882 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:15:20,325 INFO L231 Difference]: Finished difference. Result has 253 places, 258 transitions, 3452 flow [2024-06-14 15:15:20,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3244, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3452, PETRI_PLACES=253, PETRI_TRANSITIONS=258} [2024-06-14 15:15:20,325 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 220 predicate places. [2024-06-14 15:15:20,325 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 258 transitions, 3452 flow [2024-06-14 15:15:20,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:20,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:20,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:20,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 15:15:20,326 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:20,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:20,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1690173642, now seen corresponding path program 1 times [2024-06-14 15:15:20,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:20,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579943058] [2024-06-14 15:15:20,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:20,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:15:27,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:27,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579943058] [2024-06-14 15:15:27,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579943058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:27,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:27,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:15:27,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751301278] [2024-06-14 15:15:27,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:27,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:15:27,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:27,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:15:27,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:15:27,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:15:27,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 258 transitions, 3452 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:27,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:27,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:15:27,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:28,540 INFO L124 PetriNetUnfolderBase]: 598/1059 cut-off events. [2024-06-14 15:15:28,541 INFO L125 PetriNetUnfolderBase]: For 80925/80930 co-relation queries the response was YES. [2024-06-14 15:15:28,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8777 conditions, 1059 events. 598/1059 cut-off events. For 80925/80930 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5098 event pairs, 165 based on Foata normal form. 7/1060 useless extension candidates. Maximal degree in co-relation 8673. Up to 926 conditions per place. [2024-06-14 15:15:28,551 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 213 selfloop transitions, 15 changer transitions 0/270 dead transitions. [2024-06-14 15:15:28,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 270 transitions, 3954 flow [2024-06-14 15:15:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:15:28,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:15:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-14 15:15:28,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3562091503267974 [2024-06-14 15:15:28,552 INFO L175 Difference]: Start difference. First operand has 253 places, 258 transitions, 3452 flow. Second operand 9 states and 109 transitions. [2024-06-14 15:15:28,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 270 transitions, 3954 flow [2024-06-14 15:15:28,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 270 transitions, 3796 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-14 15:15:28,694 INFO L231 Difference]: Finished difference. Result has 255 places, 260 transitions, 3357 flow [2024-06-14 15:15:28,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3294, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3357, PETRI_PLACES=255, PETRI_TRANSITIONS=260} [2024-06-14 15:15:28,694 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 222 predicate places. [2024-06-14 15:15:28,694 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 260 transitions, 3357 flow [2024-06-14 15:15:28,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:28,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:28,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:28,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 15:15:28,695 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:28,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:28,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1810153744, now seen corresponding path program 10 times [2024-06-14 15:15:28,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:28,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504125122] [2024-06-14 15:15:28,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:28,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:36,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 15:15:36,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:36,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504125122] [2024-06-14 15:15:36,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504125122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:36,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:36,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:15:36,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363643079] [2024-06-14 15:15:36,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:36,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:15:36,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:36,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:15:36,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:15:36,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:15:36,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 260 transitions, 3357 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:36,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:36,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:15:36,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:36,771 INFO L124 PetriNetUnfolderBase]: 663/1143 cut-off events. [2024-06-14 15:15:36,771 INFO L125 PetriNetUnfolderBase]: For 84906/84906 co-relation queries the response was YES. [2024-06-14 15:15:36,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9371 conditions, 1143 events. 663/1143 cut-off events. For 84906/84906 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5375 event pairs, 183 based on Foata normal form. 3/1146 useless extension candidates. Maximal degree in co-relation 9267. Up to 1015 conditions per place. [2024-06-14 15:15:36,781 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 250 selfloop transitions, 32 changer transitions 0/284 dead transitions. [2024-06-14 15:15:36,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 284 transitions, 4285 flow [2024-06-14 15:15:36,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:15:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:15:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:15:36,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-14 15:15:36,783 INFO L175 Difference]: Start difference. First operand has 255 places, 260 transitions, 3357 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:15:36,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 284 transitions, 4285 flow [2024-06-14 15:15:36,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 284 transitions, 4235 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 15:15:36,946 INFO L231 Difference]: Finished difference. Result has 257 places, 266 transitions, 3460 flow [2024-06-14 15:15:36,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3307, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3460, PETRI_PLACES=257, PETRI_TRANSITIONS=266} [2024-06-14 15:15:36,947 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 224 predicate places. [2024-06-14 15:15:36,947 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 266 transitions, 3460 flow [2024-06-14 15:15:36,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:36,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:36,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:36,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 15:15:36,947 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:36,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:36,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1594056664, now seen corresponding path program 11 times [2024-06-14 15:15:36,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:36,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565026966] [2024-06-14 15:15:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:36,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:15:44,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:44,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565026966] [2024-06-14 15:15:44,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565026966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:44,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:44,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:15:44,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713695535] [2024-06-14 15:15:44,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:44,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:15:44,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:44,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:15:44,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:15:44,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:15:44,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 266 transitions, 3460 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:44,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:44,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:15:44,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:45,232 INFO L124 PetriNetUnfolderBase]: 672/1158 cut-off events. [2024-06-14 15:15:45,232 INFO L125 PetriNetUnfolderBase]: For 88482/88482 co-relation queries the response was YES. [2024-06-14 15:15:45,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9546 conditions, 1158 events. 672/1158 cut-off events. For 88482/88482 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5459 event pairs, 184 based on Foata normal form. 3/1161 useless extension candidates. Maximal degree in co-relation 9441. Up to 1111 conditions per place. [2024-06-14 15:15:45,241 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 262 selfloop transitions, 17 changer transitions 0/281 dead transitions. [2024-06-14 15:15:45,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 281 transitions, 4104 flow [2024-06-14 15:15:45,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:15:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:15:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-14 15:15:45,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3366013071895425 [2024-06-14 15:15:45,242 INFO L175 Difference]: Start difference. First operand has 257 places, 266 transitions, 3460 flow. Second operand 9 states and 103 transitions. [2024-06-14 15:15:45,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 281 transitions, 4104 flow [2024-06-14 15:15:45,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 281 transitions, 4039 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-14 15:15:45,389 INFO L231 Difference]: Finished difference. Result has 261 places, 269 transitions, 3489 flow [2024-06-14 15:15:45,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3398, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3489, PETRI_PLACES=261, PETRI_TRANSITIONS=269} [2024-06-14 15:15:45,389 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 228 predicate places. [2024-06-14 15:15:45,389 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 269 transitions, 3489 flow [2024-06-14 15:15:45,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:45,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:45,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:45,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 15:15:45,390 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:45,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:45,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1583928964, now seen corresponding path program 12 times [2024-06-14 15:15:45,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:45,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889298256] [2024-06-14 15:15:45,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:45,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:15:53,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:53,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889298256] [2024-06-14 15:15:53,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889298256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:53,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:53,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:15:53,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309284261] [2024-06-14 15:15:53,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:53,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:15:53,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:53,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:15:53,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:15:53,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:15:53,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 269 transitions, 3489 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:53,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:53,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:15:53,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:53,907 INFO L124 PetriNetUnfolderBase]: 681/1173 cut-off events. [2024-06-14 15:15:53,907 INFO L125 PetriNetUnfolderBase]: For 91690/91690 co-relation queries the response was YES. [2024-06-14 15:15:53,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9643 conditions, 1173 events. 681/1173 cut-off events. For 91690/91690 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5549 event pairs, 182 based on Foata normal form. 3/1176 useless extension candidates. Maximal degree in co-relation 9537. Up to 1084 conditions per place. [2024-06-14 15:15:53,917 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 257 selfloop transitions, 28 changer transitions 0/287 dead transitions. [2024-06-14 15:15:53,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 287 transitions, 4270 flow [2024-06-14 15:15:53,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:15:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:15:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-14 15:15:53,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3562091503267974 [2024-06-14 15:15:53,918 INFO L175 Difference]: Start difference. First operand has 261 places, 269 transitions, 3489 flow. Second operand 9 states and 109 transitions. [2024-06-14 15:15:53,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 287 transitions, 4270 flow [2024-06-14 15:15:54,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 287 transitions, 4225 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:15:54,088 INFO L231 Difference]: Finished difference. Result has 263 places, 272 transitions, 3556 flow [2024-06-14 15:15:54,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3444, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3556, PETRI_PLACES=263, PETRI_TRANSITIONS=272} [2024-06-14 15:15:54,088 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 230 predicate places. [2024-06-14 15:15:54,089 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 272 transitions, 3556 flow [2024-06-14 15:15:54,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:54,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:54,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:54,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 15:15:54,089 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:15:54,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:54,089 INFO L85 PathProgramCache]: Analyzing trace with hash -242525216, now seen corresponding path program 14 times [2024-06-14 15:15:54,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:54,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452998132] [2024-06-14 15:15:54,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:54,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:16:02,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:02,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452998132] [2024-06-14 15:16:02,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452998132] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:02,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:02,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:16:02,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797584616] [2024-06-14 15:16:02,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:02,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:16:02,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:02,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:16:02,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:16:02,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:16:02,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 272 transitions, 3556 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:16:02,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:02,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:16:02,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:02,671 INFO L124 PetriNetUnfolderBase]: 651/1142 cut-off events. [2024-06-14 15:16:02,672 INFO L125 PetriNetUnfolderBase]: For 90728/90728 co-relation queries the response was YES. [2024-06-14 15:16:02,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9496 conditions, 1142 events. 651/1142 cut-off events. For 90728/90728 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5510 event pairs, 172 based on Foata normal form. 1/1143 useless extension candidates. Maximal degree in co-relation 9389. Up to 1034 conditions per place. [2024-06-14 15:16:02,681 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 230 selfloop transitions, 15 changer transitions 0/280 dead transitions. [2024-06-14 15:16:02,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 280 transitions, 4064 flow [2024-06-14 15:16:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:16:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:16:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-14 15:16:02,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34967320261437906 [2024-06-14 15:16:02,684 INFO L175 Difference]: Start difference. First operand has 263 places, 272 transitions, 3556 flow. Second operand 9 states and 107 transitions. [2024-06-14 15:16:02,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 280 transitions, 4064 flow [2024-06-14 15:16:02,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 280 transitions, 3963 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-14 15:16:02,858 INFO L231 Difference]: Finished difference. Result has 265 places, 272 transitions, 3490 flow [2024-06-14 15:16:02,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3455, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3490, PETRI_PLACES=265, PETRI_TRANSITIONS=272} [2024-06-14 15:16:02,858 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 232 predicate places. [2024-06-14 15:16:02,858 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 272 transitions, 3490 flow [2024-06-14 15:16:02,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:16:02,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:02,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:02,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 15:16:02,859 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:02,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:02,859 INFO L85 PathProgramCache]: Analyzing trace with hash 42811990, now seen corresponding path program 17 times [2024-06-14 15:16:02,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:02,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292909843] [2024-06-14 15:16:02,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:02,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:16:10,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:10,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292909843] [2024-06-14 15:16:10,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292909843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:10,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:10,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:16:10,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699895262] [2024-06-14 15:16:10,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:10,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:16:10,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:10,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:16:10,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:16:10,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:16:10,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 272 transitions, 3490 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:16:10,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:10,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:16:10,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:11,257 INFO L124 PetriNetUnfolderBase]: 682/1175 cut-off events. [2024-06-14 15:16:11,257 INFO L125 PetriNetUnfolderBase]: For 92585/92585 co-relation queries the response was YES. [2024-06-14 15:16:11,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9640 conditions, 1175 events. 682/1175 cut-off events. For 92585/92585 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5576 event pairs, 187 based on Foata normal form. 1/1176 useless extension candidates. Maximal degree in co-relation 9532. Up to 1144 conditions per place. [2024-06-14 15:16:11,266 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 265 selfloop transitions, 15 changer transitions 0/282 dead transitions. [2024-06-14 15:16:11,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 282 transitions, 4095 flow [2024-06-14 15:16:11,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:16:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:16:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-14 15:16:11,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3235294117647059 [2024-06-14 15:16:11,267 INFO L175 Difference]: Start difference. First operand has 265 places, 272 transitions, 3490 flow. Second operand 9 states and 99 transitions. [2024-06-14 15:16:11,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 282 transitions, 4095 flow [2024-06-14 15:16:11,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 282 transitions, 3952 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:16:11,450 INFO L231 Difference]: Finished difference. Result has 264 places, 274 transitions, 3413 flow [2024-06-14 15:16:11,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3347, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3413, PETRI_PLACES=264, PETRI_TRANSITIONS=274} [2024-06-14 15:16:11,451 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 231 predicate places. [2024-06-14 15:16:11,451 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 274 transitions, 3413 flow [2024-06-14 15:16:11,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:16:11,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:11,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:11,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 15:16:11,451 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:11,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:11,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1298829094, now seen corresponding path program 13 times [2024-06-14 15:16:11,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:11,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028355333] [2024-06-14 15:16:11,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:11,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:16:19,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:19,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028355333] [2024-06-14 15:16:19,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028355333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:19,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:19,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:16:19,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059755189] [2024-06-14 15:16:19,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:19,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:16:19,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:19,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:16:19,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:16:19,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:16:19,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 274 transitions, 3413 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:16:19,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:19,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:16:19,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:19,931 INFO L124 PetriNetUnfolderBase]: 691/1190 cut-off events. [2024-06-14 15:16:19,931 INFO L125 PetriNetUnfolderBase]: For 98443/98443 co-relation queries the response was YES. [2024-06-14 15:16:19,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9724 conditions, 1190 events. 691/1190 cut-off events. For 98443/98443 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5644 event pairs, 185 based on Foata normal form. 3/1193 useless extension candidates. Maximal degree in co-relation 9615. Up to 1041 conditions per place. [2024-06-14 15:16:19,941 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 255 selfloop transitions, 40 changer transitions 0/297 dead transitions. [2024-06-14 15:16:19,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 297 transitions, 4351 flow [2024-06-14 15:16:19,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:16:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:16:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 15:16:19,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-14 15:16:19,942 INFO L175 Difference]: Start difference. First operand has 264 places, 274 transitions, 3413 flow. Second operand 9 states and 117 transitions. [2024-06-14 15:16:19,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 297 transitions, 4351 flow [2024-06-14 15:16:20,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 297 transitions, 4316 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:16:20,124 INFO L231 Difference]: Finished difference. Result has 266 places, 277 transitions, 3500 flow [2024-06-14 15:16:20,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3378, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3500, PETRI_PLACES=266, PETRI_TRANSITIONS=277} [2024-06-14 15:16:20,124 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 233 predicate places. [2024-06-14 15:16:20,124 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 277 transitions, 3500 flow [2024-06-14 15:16:20,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:16:20,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:20,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:20,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 15:16:20,125 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:20,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:20,125 INFO L85 PathProgramCache]: Analyzing trace with hash -242518520, now seen corresponding path program 18 times [2024-06-14 15:16:20,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:20,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765267657] [2024-06-14 15:16:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:20,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:16:27,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:27,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765267657] [2024-06-14 15:16:27,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765267657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:27,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:27,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:16:27,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155550487] [2024-06-14 15:16:27,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:27,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:16:27,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:27,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:16:27,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:16:28,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:16:28,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 277 transitions, 3500 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:16:28,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:28,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:16:28,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:28,626 INFO L124 PetriNetUnfolderBase]: 699/1203 cut-off events. [2024-06-14 15:16:28,626 INFO L125 PetriNetUnfolderBase]: For 100411/100411 co-relation queries the response was YES. [2024-06-14 15:16:28,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9987 conditions, 1203 events. 699/1203 cut-off events. For 100411/100411 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5743 event pairs, 187 based on Foata normal form. 1/1204 useless extension candidates. Maximal degree in co-relation 9877. Up to 1143 conditions per place. [2024-06-14 15:16:28,636 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 261 selfloop transitions, 28 changer transitions 0/291 dead transitions. [2024-06-14 15:16:28,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 291 transitions, 4398 flow [2024-06-14 15:16:28,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:16:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:16:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 15:16:28,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3464052287581699 [2024-06-14 15:16:28,638 INFO L175 Difference]: Start difference. First operand has 266 places, 277 transitions, 3500 flow. Second operand 9 states and 106 transitions. [2024-06-14 15:16:28,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 291 transitions, 4398 flow [2024-06-14 15:16:28,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 291 transitions, 4324 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:16:28,792 INFO L231 Difference]: Finished difference. Result has 269 places, 281 transitions, 3549 flow [2024-06-14 15:16:28,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3549, PETRI_PLACES=269, PETRI_TRANSITIONS=281} [2024-06-14 15:16:28,793 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 236 predicate places. [2024-06-14 15:16:28,793 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 281 transitions, 3549 flow [2024-06-14 15:16:28,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:16:28,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:28,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:28,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 15:16:28,794 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:28,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1583937334, now seen corresponding path program 14 times [2024-06-14 15:16:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:28,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463284857] [2024-06-14 15:16:28,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:28,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:16:36,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:36,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463284857] [2024-06-14 15:16:36,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463284857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:36,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:36,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:16:36,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590299036] [2024-06-14 15:16:36,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:36,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:16:36,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:36,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:16:36,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:16:36,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:16:36,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 281 transitions, 3549 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:16:36,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:36,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:16:36,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:37,084 INFO L124 PetriNetUnfolderBase]: 693/1194 cut-off events. [2024-06-14 15:16:37,084 INFO L125 PetriNetUnfolderBase]: For 101816/101816 co-relation queries the response was YES. [2024-06-14 15:16:37,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9773 conditions, 1194 events. 693/1194 cut-off events. For 101816/101816 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5693 event pairs, 182 based on Foata normal form. 3/1197 useless extension candidates. Maximal degree in co-relation 9662. Up to 1110 conditions per place. [2024-06-14 15:16:37,094 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 269 selfloop transitions, 26 changer transitions 0/297 dead transitions. [2024-06-14 15:16:37,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 297 transitions, 4205 flow [2024-06-14 15:16:37,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:16:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:16:37,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-14 15:16:37,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3562091503267974 [2024-06-14 15:16:37,095 INFO L175 Difference]: Start difference. First operand has 269 places, 281 transitions, 3549 flow. Second operand 9 states and 109 transitions. [2024-06-14 15:16:37,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 297 transitions, 4205 flow [2024-06-14 15:16:37,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 297 transitions, 4058 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 15:16:37,291 INFO L231 Difference]: Finished difference. Result has 271 places, 281 transitions, 3461 flow [2024-06-14 15:16:37,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3402, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3461, PETRI_PLACES=271, PETRI_TRANSITIONS=281} [2024-06-14 15:16:37,291 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 238 predicate places. [2024-06-14 15:16:37,291 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 281 transitions, 3461 flow [2024-06-14 15:16:37,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:16:37,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:37,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:37,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 15:16:37,292 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:37,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:37,292 INFO L85 PathProgramCache]: Analyzing trace with hash -242518272, now seen corresponding path program 15 times [2024-06-14 15:16:37,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:37,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434914340] [2024-06-14 15:16:37,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:37,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:16:45,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:45,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434914340] [2024-06-14 15:16:45,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434914340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:45,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:45,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:16:45,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217300315] [2024-06-14 15:16:45,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:45,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:16:45,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:45,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:16:45,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:16:45,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:16:45,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 281 transitions, 3461 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:16:45,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:45,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:16:45,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:45,773 INFO L124 PetriNetUnfolderBase]: 687/1185 cut-off events. [2024-06-14 15:16:45,773 INFO L125 PetriNetUnfolderBase]: For 98728/98728 co-relation queries the response was YES. [2024-06-14 15:16:45,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9554 conditions, 1185 events. 687/1185 cut-off events. For 98728/98728 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5628 event pairs, 178 based on Foata normal form. 3/1188 useless extension candidates. Maximal degree in co-relation 9442. Up to 1046 conditions per place. [2024-06-14 15:16:45,783 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 248 selfloop transitions, 45 changer transitions 0/295 dead transitions. [2024-06-14 15:16:45,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 295 transitions, 4096 flow [2024-06-14 15:16:45,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:16:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:16:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 15:16:45,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3627450980392157 [2024-06-14 15:16:45,784 INFO L175 Difference]: Start difference. First operand has 271 places, 281 transitions, 3461 flow. Second operand 9 states and 111 transitions. [2024-06-14 15:16:45,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 295 transitions, 4096 flow [2024-06-14 15:16:45,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 295 transitions, 4018 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:16:45,972 INFO L231 Difference]: Finished difference. Result has 272 places, 281 transitions, 3479 flow [2024-06-14 15:16:45,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3383, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3479, PETRI_PLACES=272, PETRI_TRANSITIONS=281} [2024-06-14 15:16:45,972 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 239 predicate places. [2024-06-14 15:16:45,972 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 281 transitions, 3479 flow [2024-06-14 15:16:45,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:16:45,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:45,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:45,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 15:16:45,973 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:45,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:45,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1809907976, now seen corresponding path program 19 times [2024-06-14 15:16:45,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:45,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104328340] [2024-06-14 15:16:45,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:45,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:16:53,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 15:16:53,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:16:53,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104328340] [2024-06-14 15:16:53,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104328340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:16:53,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:16:53,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:16:53,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167937133] [2024-06-14 15:16:53,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:16:53,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:16:53,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:16:53,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:16:53,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:16:53,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:16:53,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 281 transitions, 3479 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:16:53,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:16:53,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:16:53,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:16:53,728 INFO L124 PetriNetUnfolderBase]: 685/1182 cut-off events. [2024-06-14 15:16:53,728 INFO L125 PetriNetUnfolderBase]: For 96082/96082 co-relation queries the response was YES. [2024-06-14 15:16:53,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9552 conditions, 1182 events. 685/1182 cut-off events. For 96082/96082 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5632 event pairs, 184 based on Foata normal form. 1/1183 useless extension candidates. Maximal degree in co-relation 9439. Up to 1123 conditions per place. [2024-06-14 15:16:53,739 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 258 selfloop transitions, 30 changer transitions 0/290 dead transitions. [2024-06-14 15:16:53,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 290 transitions, 4199 flow [2024-06-14 15:16:53,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:16:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:16:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 15:16:53,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.369281045751634 [2024-06-14 15:16:53,739 INFO L175 Difference]: Start difference. First operand has 272 places, 281 transitions, 3479 flow. Second operand 9 states and 113 transitions. [2024-06-14 15:16:53,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 290 transitions, 4199 flow [2024-06-14 15:16:53,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 290 transitions, 4085 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 15:16:53,944 INFO L231 Difference]: Finished difference. Result has 272 places, 281 transitions, 3430 flow [2024-06-14 15:16:53,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3365, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3430, PETRI_PLACES=272, PETRI_TRANSITIONS=281} [2024-06-14 15:16:53,944 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 239 predicate places. [2024-06-14 15:16:53,944 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 281 transitions, 3430 flow [2024-06-14 15:16:53,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:16:53,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:16:53,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:16:53,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 15:16:53,945 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:16:53,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:16:53,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1810145126, now seen corresponding path program 20 times [2024-06-14 15:16:53,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:16:53,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929680790] [2024-06-14 15:16:53,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:16:53,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:16:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:00,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 15:17:00,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:00,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929680790] [2024-06-14 15:17:00,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929680790] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:00,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:00,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:17:00,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905400117] [2024-06-14 15:17:00,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:00,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:17:00,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:00,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:17:00,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:17:00,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:17:00,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 281 transitions, 3430 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:17:00,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:00,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:17:00,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:01,035 INFO L124 PetriNetUnfolderBase]: 683/1179 cut-off events. [2024-06-14 15:17:01,035 INFO L125 PetriNetUnfolderBase]: For 96693/96693 co-relation queries the response was YES. [2024-06-14 15:17:01,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9465 conditions, 1179 events. 683/1179 cut-off events. For 96693/96693 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5628 event pairs, 184 based on Foata normal form. 1/1180 useless extension candidates. Maximal degree in co-relation 9351. Up to 1121 conditions per place. [2024-06-14 15:17:01,047 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 260 selfloop transitions, 27 changer transitions 0/289 dead transitions. [2024-06-14 15:17:01,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 289 transitions, 4022 flow [2024-06-14 15:17:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:17:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:17:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:17:01,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-14 15:17:01,048 INFO L175 Difference]: Start difference. First operand has 272 places, 281 transitions, 3430 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:17:01,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 289 transitions, 4022 flow [2024-06-14 15:17:01,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 289 transitions, 3903 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 15:17:01,222 INFO L231 Difference]: Finished difference. Result has 273 places, 281 transitions, 3370 flow [2024-06-14 15:17:01,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3311, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3370, PETRI_PLACES=273, PETRI_TRANSITIONS=281} [2024-06-14 15:17:01,223 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 240 predicate places. [2024-06-14 15:17:01,223 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 281 transitions, 3370 flow [2024-06-14 15:17:01,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:17:01,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:01,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:01,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 15:17:01,223 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:01,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:01,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1594426060, now seen corresponding path program 1 times [2024-06-14 15:17:01,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:01,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031375174] [2024-06-14 15:17:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:17:10,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:10,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031375174] [2024-06-14 15:17:10,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031375174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:10,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:10,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:17:10,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670189357] [2024-06-14 15:17:10,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:10,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:17:10,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:10,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:17:10,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:17:10,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:17:10,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 281 transitions, 3370 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:17:10,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:10,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:17:10,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:11,583 INFO L124 PetriNetUnfolderBase]: 630/1120 cut-off events. [2024-06-14 15:17:11,583 INFO L125 PetriNetUnfolderBase]: For 99040/99045 co-relation queries the response was YES. [2024-06-14 15:17:11,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8928 conditions, 1120 events. 630/1120 cut-off events. For 99040/99045 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5518 event pairs, 167 based on Foata normal form. 7/1121 useless extension candidates. Maximal degree in co-relation 8813. Up to 969 conditions per place. [2024-06-14 15:17:11,592 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 225 selfloop transitions, 14 changer transitions 0/291 dead transitions. [2024-06-14 15:17:11,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 291 transitions, 3870 flow [2024-06-14 15:17:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:17:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:17:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-14 15:17:11,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34967320261437906 [2024-06-14 15:17:11,593 INFO L175 Difference]: Start difference. First operand has 273 places, 281 transitions, 3370 flow. Second operand 9 states and 107 transitions. [2024-06-14 15:17:11,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 291 transitions, 3870 flow [2024-06-14 15:17:11,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 291 transitions, 3789 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 15:17:11,762 INFO L231 Difference]: Finished difference. Result has 273 places, 281 transitions, 3321 flow [2024-06-14 15:17:11,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3289, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3321, PETRI_PLACES=273, PETRI_TRANSITIONS=281} [2024-06-14 15:17:11,763 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 240 predicate places. [2024-06-14 15:17:11,763 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 281 transitions, 3321 flow [2024-06-14 15:17:11,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:17:11,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:11,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:11,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 15:17:11,764 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:11,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:11,764 INFO L85 PathProgramCache]: Analyzing trace with hash -668943389, now seen corresponding path program 1 times [2024-06-14 15:17:11,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:11,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152856515] [2024-06-14 15:17:11,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:17:21,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:21,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152856515] [2024-06-14 15:17:21,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152856515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:21,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:21,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:17:21,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959688274] [2024-06-14 15:17:21,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:21,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:17:21,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:21,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:17:21,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:17:21,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:17:21,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 281 transitions, 3321 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 15:17:21,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:21,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:17:21,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:22,178 INFO L124 PetriNetUnfolderBase]: 665/1167 cut-off events. [2024-06-14 15:17:22,179 INFO L125 PetriNetUnfolderBase]: For 108924/108926 co-relation queries the response was YES. [2024-06-14 15:17:22,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9479 conditions, 1167 events. 665/1167 cut-off events. For 108924/108926 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5719 event pairs, 109 based on Foata normal form. 1/1166 useless extension candidates. Maximal degree in co-relation 9363. Up to 942 conditions per place. [2024-06-14 15:17:22,190 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 225 selfloop transitions, 45 changer transitions 0/308 dead transitions. [2024-06-14 15:17:22,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 308 transitions, 4109 flow [2024-06-14 15:17:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:17:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:17:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:17:22,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3877005347593583 [2024-06-14 15:17:22,192 INFO L175 Difference]: Start difference. First operand has 273 places, 281 transitions, 3321 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:17:22,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 308 transitions, 4109 flow [2024-06-14 15:17:22,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 308 transitions, 4075 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:17:22,407 INFO L231 Difference]: Finished difference. Result has 278 places, 288 transitions, 3468 flow [2024-06-14 15:17:22,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3287, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3468, PETRI_PLACES=278, PETRI_TRANSITIONS=288} [2024-06-14 15:17:22,408 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 245 predicate places. [2024-06-14 15:17:22,408 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 288 transitions, 3468 flow [2024-06-14 15:17:22,408 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 15:17:22,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:22,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:22,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 15:17:22,408 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:22,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash -274100732, now seen corresponding path program 1 times [2024-06-14 15:17:22,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:22,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48547390] [2024-06-14 15:17:22,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:22,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:17:31,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:31,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48547390] [2024-06-14 15:17:31,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48547390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:31,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:31,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:17:31,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097134280] [2024-06-14 15:17:31,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:31,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:17:31,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:31,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:17:31,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:17:31,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:17:31,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 288 transitions, 3468 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:17:31,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:31,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:17:31,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:32,628 INFO L124 PetriNetUnfolderBase]: 700/1207 cut-off events. [2024-06-14 15:17:32,628 INFO L125 PetriNetUnfolderBase]: For 105326/105326 co-relation queries the response was YES. [2024-06-14 15:17:32,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9802 conditions, 1207 events. 700/1207 cut-off events. For 105326/105326 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5813 event pairs, 121 based on Foata normal form. 1/1208 useless extension candidates. Maximal degree in co-relation 9684. Up to 1089 conditions per place. [2024-06-14 15:17:32,640 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 265 selfloop transitions, 46 changer transitions 0/313 dead transitions. [2024-06-14 15:17:32,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 313 transitions, 4324 flow [2024-06-14 15:17:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:17:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:17:32,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-14 15:17:32,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2024-06-14 15:17:32,641 INFO L175 Difference]: Start difference. First operand has 278 places, 288 transitions, 3468 flow. Second operand 12 states and 141 transitions. [2024-06-14 15:17:32,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 313 transitions, 4324 flow [2024-06-14 15:17:32,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 313 transitions, 4231 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 15:17:32,889 INFO L231 Difference]: Finished difference. Result has 284 places, 292 transitions, 3524 flow [2024-06-14 15:17:32,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3375, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3524, PETRI_PLACES=284, PETRI_TRANSITIONS=292} [2024-06-14 15:17:32,890 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 251 predicate places. [2024-06-14 15:17:32,890 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 292 transitions, 3524 flow [2024-06-14 15:17:32,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:17:32,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:32,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:32,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 15:17:32,891 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:32,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:32,891 INFO L85 PathProgramCache]: Analyzing trace with hash 705032961, now seen corresponding path program 2 times [2024-06-14 15:17:32,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:32,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588995318] [2024-06-14 15:17:32,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:32,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:43,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:17:43,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:43,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588995318] [2024-06-14 15:17:43,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588995318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:43,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:43,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:17:43,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567806974] [2024-06-14 15:17:43,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:43,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:17:43,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:43,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:17:43,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:17:43,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:17:43,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 292 transitions, 3524 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:17:43,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:43,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:17:43,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:44,118 INFO L124 PetriNetUnfolderBase]: 688/1205 cut-off events. [2024-06-14 15:17:44,118 INFO L125 PetriNetUnfolderBase]: For 115903/115905 co-relation queries the response was YES. [2024-06-14 15:17:44,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9931 conditions, 1205 events. 688/1205 cut-off events. For 115903/115905 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5965 event pairs, 112 based on Foata normal form. 1/1202 useless extension candidates. Maximal degree in co-relation 9812. Up to 1001 conditions per place. [2024-06-14 15:17:44,127 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 231 selfloop transitions, 47 changer transitions 0/318 dead transitions. [2024-06-14 15:17:44,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 318 transitions, 4197 flow [2024-06-14 15:17:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:17:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:17:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-14 15:17:44,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3770053475935829 [2024-06-14 15:17:44,129 INFO L175 Difference]: Start difference. First operand has 284 places, 292 transitions, 3524 flow. Second operand 11 states and 141 transitions. [2024-06-14 15:17:44,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 318 transitions, 4197 flow [2024-06-14 15:17:44,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 318 transitions, 4092 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-06-14 15:17:44,382 INFO L231 Difference]: Finished difference. Result has 286 places, 300 transitions, 3614 flow [2024-06-14 15:17:44,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3419, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3614, PETRI_PLACES=286, PETRI_TRANSITIONS=300} [2024-06-14 15:17:44,383 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 253 predicate places. [2024-06-14 15:17:44,383 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 300 transitions, 3614 flow [2024-06-14 15:17:44,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:17:44,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:44,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:44,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 15:17:44,383 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:44,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:44,383 INFO L85 PathProgramCache]: Analyzing trace with hash 710244104, now seen corresponding path program 2 times [2024-06-14 15:17:44,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:44,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610045679] [2024-06-14 15:17:44,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:17:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:17:54,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:17:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610045679] [2024-06-14 15:17:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610045679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:17:54,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:17:54,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:17:54,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266888909] [2024-06-14 15:17:54,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:17:54,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:17:54,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:17:54,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:17:54,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:17:54,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:17:54,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 300 transitions, 3614 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:17:54,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:17:54,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:17:54,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:17:54,830 INFO L124 PetriNetUnfolderBase]: 717/1237 cut-off events. [2024-06-14 15:17:54,830 INFO L125 PetriNetUnfolderBase]: For 112008/112008 co-relation queries the response was YES. [2024-06-14 15:17:54,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10134 conditions, 1237 events. 717/1237 cut-off events. For 112008/112008 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 6009 event pairs, 122 based on Foata normal form. 1/1238 useless extension candidates. Maximal degree in co-relation 10014. Up to 1128 conditions per place. [2024-06-14 15:17:54,842 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 271 selfloop transitions, 45 changer transitions 0/318 dead transitions. [2024-06-14 15:17:54,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 318 transitions, 4310 flow [2024-06-14 15:17:54,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:17:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:17:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 15:17:54,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588235294117647 [2024-06-14 15:17:54,845 INFO L175 Difference]: Start difference. First operand has 286 places, 300 transitions, 3614 flow. Second operand 10 states and 122 transitions. [2024-06-14 15:17:54,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 318 transitions, 4310 flow [2024-06-14 15:17:55,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 318 transitions, 4210 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:17:55,113 INFO L231 Difference]: Finished difference. Result has 288 places, 302 transitions, 3641 flow [2024-06-14 15:17:55,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3514, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3641, PETRI_PLACES=288, PETRI_TRANSITIONS=302} [2024-06-14 15:17:55,114 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 255 predicate places. [2024-06-14 15:17:55,114 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 302 transitions, 3641 flow [2024-06-14 15:17:55,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:17:55,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:17:55,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:17:55,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 15:17:55,114 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:17:55,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:17:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash 823924316, now seen corresponding path program 3 times [2024-06-14 15:17:55,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:17:55,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354182413] [2024-06-14 15:17:55,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:17:55,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:17:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:05,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 15:18:05,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:05,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354182413] [2024-06-14 15:18:05,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354182413] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:05,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:05,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:18:05,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863545858] [2024-06-14 15:18:05,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:05,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:18:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:05,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:18:05,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:18:05,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:18:05,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 302 transitions, 3641 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:18:05,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:05,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:18:05,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:05,907 INFO L124 PetriNetUnfolderBase]: 725/1250 cut-off events. [2024-06-14 15:18:05,907 INFO L125 PetriNetUnfolderBase]: For 117361/117361 co-relation queries the response was YES. [2024-06-14 15:18:05,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10342 conditions, 1250 events. 725/1250 cut-off events. For 117361/117361 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6098 event pairs, 105 based on Foata normal form. 1/1251 useless extension candidates. Maximal degree in co-relation 10221. Up to 999 conditions per place. [2024-06-14 15:18:05,920 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 206 selfloop transitions, 120 changer transitions 0/328 dead transitions. [2024-06-14 15:18:05,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 328 transitions, 4543 flow [2024-06-14 15:18:05,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-14 15:18:05,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-14 15:18:05,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 164 transitions. [2024-06-14 15:18:05,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3445378151260504 [2024-06-14 15:18:05,922 INFO L175 Difference]: Start difference. First operand has 288 places, 302 transitions, 3641 flow. Second operand 14 states and 164 transitions. [2024-06-14 15:18:05,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 328 transitions, 4543 flow [2024-06-14 15:18:06,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 328 transitions, 4441 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 15:18:06,221 INFO L231 Difference]: Finished difference. Result has 293 places, 306 transitions, 3846 flow [2024-06-14 15:18:06,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3541, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3846, PETRI_PLACES=293, PETRI_TRANSITIONS=306} [2024-06-14 15:18:06,222 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 260 predicate places. [2024-06-14 15:18:06,222 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 306 transitions, 3846 flow [2024-06-14 15:18:06,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:18:06,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:06,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:18:06,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 15:18:06,223 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:06,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:06,223 INFO L85 PathProgramCache]: Analyzing trace with hash 221759546, now seen corresponding path program 4 times [2024-06-14 15:18:06,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:06,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596969781] [2024-06-14 15:18:06,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:06,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:18:16,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:16,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596969781] [2024-06-14 15:18:16,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596969781] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:16,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:16,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:18:16,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388459872] [2024-06-14 15:18:16,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:16,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:18:16,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:16,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:18:16,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:18:16,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:18:16,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 306 transitions, 3846 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:18:16,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:16,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:18:16,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:17,351 INFO L124 PetriNetUnfolderBase]: 723/1247 cut-off events. [2024-06-14 15:18:17,351 INFO L125 PetriNetUnfolderBase]: For 115351/115351 co-relation queries the response was YES. [2024-06-14 15:18:17,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10428 conditions, 1247 events. 723/1247 cut-off events. For 115351/115351 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6069 event pairs, 109 based on Foata normal form. 1/1248 useless extension candidates. Maximal degree in co-relation 10307. Up to 997 conditions per place. [2024-06-14 15:18:17,364 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 206 selfloop transitions, 118 changer transitions 0/326 dead transitions. [2024-06-14 15:18:17,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 326 transitions, 4546 flow [2024-06-14 15:18:17,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:18:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:18:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2024-06-14 15:18:17,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3552036199095023 [2024-06-14 15:18:17,367 INFO L175 Difference]: Start difference. First operand has 293 places, 306 transitions, 3846 flow. Second operand 13 states and 157 transitions. [2024-06-14 15:18:17,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 326 transitions, 4546 flow [2024-06-14 15:18:17,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 326 transitions, 4347 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-06-14 15:18:17,615 INFO L231 Difference]: Finished difference. Result has 296 places, 306 transitions, 3888 flow [2024-06-14 15:18:17,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3647, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3888, PETRI_PLACES=296, PETRI_TRANSITIONS=306} [2024-06-14 15:18:17,615 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 263 predicate places. [2024-06-14 15:18:17,615 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 306 transitions, 3888 flow [2024-06-14 15:18:17,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:18:17,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:17,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:18:17,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 15:18:17,616 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:17,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:17,616 INFO L85 PathProgramCache]: Analyzing trace with hash 803583573, now seen corresponding path program 2 times [2024-06-14 15:18:17,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:17,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722889319] [2024-06-14 15:18:17,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:17,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:18:27,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:27,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722889319] [2024-06-14 15:18:27,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722889319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:27,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:27,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:18:27,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161373510] [2024-06-14 15:18:27,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:27,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:18:27,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:27,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:18:27,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:18:27,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-14 15:18:27,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 306 transitions, 3888 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:18:27,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:27,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-14 15:18:27,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:28,538 INFO L124 PetriNetUnfolderBase]: 717/1238 cut-off events. [2024-06-14 15:18:28,538 INFO L125 PetriNetUnfolderBase]: For 116125/116125 co-relation queries the response was YES. [2024-06-14 15:18:28,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10351 conditions, 1238 events. 717/1238 cut-off events. For 116125/116125 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6017 event pairs, 105 based on Foata normal form. 3/1241 useless extension candidates. Maximal degree in co-relation 10228. Up to 863 conditions per place. [2024-06-14 15:18:28,551 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 222 selfloop transitions, 107 changer transitions 0/331 dead transitions. [2024-06-14 15:18:28,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 331 transitions, 4778 flow [2024-06-14 15:18:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:18:28,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:18:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-14 15:18:28,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37967914438502676 [2024-06-14 15:18:28,552 INFO L175 Difference]: Start difference. First operand has 296 places, 306 transitions, 3888 flow. Second operand 11 states and 142 transitions. [2024-06-14 15:18:28,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 331 transitions, 4778 flow [2024-06-14 15:18:28,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 331 transitions, 4543 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:18:28,832 INFO L231 Difference]: Finished difference. Result has 299 places, 311 transitions, 4042 flow [2024-06-14 15:18:28,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3653, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4042, PETRI_PLACES=299, PETRI_TRANSITIONS=311} [2024-06-14 15:18:28,833 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 266 predicate places. [2024-06-14 15:18:28,833 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 311 transitions, 4042 flow [2024-06-14 15:18:28,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:18:28,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:28,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:18:28,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 15:18:28,833 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:28,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash 803577621, now seen corresponding path program 3 times [2024-06-14 15:18:28,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:28,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764934543] [2024-06-14 15:18:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:18:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:18:38,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:18:38,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764934543] [2024-06-14 15:18:38,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764934543] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:18:38,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:18:38,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:18:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075433202] [2024-06-14 15:18:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:18:38,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:18:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:18:38,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:18:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:18:38,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-14 15:18:38,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 311 transitions, 4042 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:18:38,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:18:38,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-14 15:18:38,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:18:39,167 INFO L124 PetriNetUnfolderBase]: 691/1213 cut-off events. [2024-06-14 15:18:39,168 INFO L125 PetriNetUnfolderBase]: For 116228/116228 co-relation queries the response was YES. [2024-06-14 15:18:39,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10521 conditions, 1213 events. 691/1213 cut-off events. For 116228/116228 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6041 event pairs, 97 based on Foata normal form. 1/1212 useless extension candidates. Maximal degree in co-relation 10395. Up to 984 conditions per place. [2024-06-14 15:18:39,180 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 225 selfloop transitions, 65 changer transitions 0/333 dead transitions. [2024-06-14 15:18:39,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 333 transitions, 4702 flow [2024-06-14 15:18:39,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:18:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:18:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 162 transitions. [2024-06-14 15:18:39,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3665158371040724 [2024-06-14 15:18:39,182 INFO L175 Difference]: Start difference. First operand has 299 places, 311 transitions, 4042 flow. Second operand 13 states and 162 transitions. [2024-06-14 15:18:39,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 333 transitions, 4702 flow [2024-06-14 15:18:39,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 333 transitions, 4538 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 15:18:39,462 INFO L231 Difference]: Finished difference. Result has 303 places, 313 transitions, 4045 flow [2024-06-14 15:18:39,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3878, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4045, PETRI_PLACES=303, PETRI_TRANSITIONS=313} [2024-06-14 15:18:39,462 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 270 predicate places. [2024-06-14 15:18:39,463 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 313 transitions, 4045 flow [2024-06-14 15:18:39,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:18:39,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:18:39,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:18:39,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 15:18:39,463 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:18:39,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:18:39,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2130346853, now seen corresponding path program 4 times [2024-06-14 15:18:39,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:18:39,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121456723] [2024-06-14 15:18:39,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:18:39,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:18:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15