./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.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/rfi001_power.oepc_pso.oepc_rmo.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/rfi001_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi001_power.oepc_pso.oepc_rmo.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:37:38,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:37:39,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:37:39,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:37:39,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:37:39,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:37:39,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:37:39,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:37:39,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:37:39,073 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:37:39,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:37:39,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:37:39,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:37:39,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:37:39,074 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:37:39,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:37:39,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:37:39,075 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:37:39,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:37:39,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:37:39,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:37:39,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:37:39,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:37:39,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:37:39,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:37:39,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:37:39,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:37:39,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:37:39,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:37:39,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:37:39,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:37:39,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:37:39,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:37:39,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:37:39,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:37:39,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:37:39,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:37:39,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:37:39,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:37:39,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:37:39,084 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:37:39,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:37:39,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:37:39,084 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:37:39,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:37:39,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:37:39,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:37:39,335 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:37:39,335 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:37:39,336 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/rfi001_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-14 15:37:39,504 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:37:39,505 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:37:39,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2024-06-14 15:37:40,477 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:37:40,749 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:37:40,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc_pso.oepc_rmo.oepc.i [2024-06-14 15:37:40,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4352961a1/cda9d414d24b45ca95a62706629d93c4/FLAGf6efbe3f4 [2024-06-14 15:37:40,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4352961a1/cda9d414d24b45ca95a62706629d93c4 [2024-06-14 15:37:40,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:37:40,781 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:37:40,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:37:40,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:37:40,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:37:40,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:37:39" (1/2) ... [2024-06-14 15:37:40,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ffe7a2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:37:40, skipping insertion in model container [2024-06-14 15:37:40,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:37:39" (1/2) ... [2024-06-14 15:37:40,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@28e1f689 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:37:40, skipping insertion in model container [2024-06-14 15:37:40,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:37:40" (2/2) ... [2024-06-14 15:37:40,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ffe7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:40, skipping insertion in model container [2024-06-14 15:37:40,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:37:40" (2/2) ... [2024-06-14 15:37:40,792 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:37:40,853 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:37:40,854 INFO L97 edCorrectnessWitness]: Location invariant before [L818-L818] ((((((((((((((((! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )x$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff1) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (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 )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )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 )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$w_buff0) - (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:37:40,855 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] ((((((((((((((((! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )x$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff1) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )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 )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (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 )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )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 )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$w_buff0) - (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (z == 0 || z == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:37:40,855 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:37:40,856 INFO L106 edCorrectnessWitness]: ghost_update [L816-L816] multithreaded = 1; [2024-06-14 15:37:40,892 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:37:41,188 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:37:41,196 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:37:41,495 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:37:41,525 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:37:41,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:41 WrapperNode [2024-06-14 15:37:41,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:37:41,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:37:41,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:37:41,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:37:41,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:41" (1/1) ... [2024-06-14 15:37:41,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:41" (1/1) ... [2024-06-14 15:37:41,623 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 114 [2024-06-14 15:37:41,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:37:41,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:37:41,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:37:41,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:37:41,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:41" (1/1) ... [2024-06-14 15:37:41,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:41" (1/1) ... [2024-06-14 15:37:41,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:41" (1/1) ... [2024-06-14 15:37:41,679 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:37:41,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:41" (1/1) ... [2024-06-14 15:37:41,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:41" (1/1) ... [2024-06-14 15:37:41,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:41" (1/1) ... [2024-06-14 15:37:41,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:41" (1/1) ... [2024-06-14 15:37:41,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:41" (1/1) ... [2024-06-14 15:37:41,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:41" (1/1) ... [2024-06-14 15:37:41,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:37:41,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:37:41,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:37:41,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:37:41,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:41" (1/1) ... [2024-06-14 15:37:41,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:37:41,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:37:41,773 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:37:41,807 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:37:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:37:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:37:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:37:41,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:37:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:37:41,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:37:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:37:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:37:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:37:41,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:37:41,823 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:37:41,938 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:37:41,940 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:37:42,721 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:37:42,722 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:37:42,895 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:37:42,895 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:37:42,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:37:42 BoogieIcfgContainer [2024-06-14 15:37:42,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:37:42,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:37:42,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:37:42,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:37:42,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:37:39" (1/4) ... [2024-06-14 15:37:42,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21253368 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:37:42, skipping insertion in model container [2024-06-14 15:37:42,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:37:40" (2/4) ... [2024-06-14 15:37:42,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21253368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:37:42, skipping insertion in model container [2024-06-14 15:37:42,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:37:41" (3/4) ... [2024-06-14 15:37:42,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21253368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:37:42, skipping insertion in model container [2024-06-14 15:37:42,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:37:42" (4/4) ... [2024-06-14 15:37:42,909 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc_pso.oepc_rmo.oepc.i [2024-06-14 15:37:42,923 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:37:42,923 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:37:42,923 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:37:42,994 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:37:43,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:37:43,058 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-14 15:37:43,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:37:43,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:37:43,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 15:37:43,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-14 15:37:43,074 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:37:43,081 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;@61c4cc4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:37:43,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:37:43,087 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:37:43,087 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:37:43,087 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:37:43,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:43,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:37:43,089 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:37:43,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1710069081, now seen corresponding path program 1 times [2024-06-14 15:37:43,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:43,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529554484] [2024-06-14 15:37:43,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:43,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:47,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:37:47,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:47,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529554484] [2024-06-14 15:37:47,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529554484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:47,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:47,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:37:47,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193279916] [2024-06-14 15:37:47,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:47,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:37:47,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:47,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:37:47,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:37:47,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:37:47,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:47,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:47,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:37:47,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:47,363 INFO L124 PetriNetUnfolderBase]: 189/352 cut-off events. [2024-06-14 15:37:47,364 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-14 15:37:47,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 352 events. 189/352 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1280 event pairs, 115 based on Foata normal form. 1/339 useless extension candidates. Maximal degree in co-relation 696. Up to 333 conditions per place. [2024-06-14 15:37:47,370 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 24 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-14 15:37:47,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 123 flow [2024-06-14 15:37:47,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:37:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:37:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-06-14 15:37:47,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2024-06-14 15:37:47,380 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 53 transitions. [2024-06-14 15:37:47,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 123 flow [2024-06-14 15:37:47,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 15:37:47,383 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-14 15:37:47,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-14 15:37:47,399 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-14 15:37:47,399 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-14 15:37:47,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:47,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:47,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:37:47,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:37:47,401 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:37:47,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1595404566, now seen corresponding path program 1 times [2024-06-14 15:37:47,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:47,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343612061] [2024-06-14 15:37:47,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:47,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:50,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:50,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343612061] [2024-06-14 15:37:50,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343612061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:50,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:50,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:37:50,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598476066] [2024-06-14 15:37:50,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:50,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:37:50,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:50,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:37:50,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:37:50,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:37:50,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:50,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:50,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:37:50,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:50,586 INFO L124 PetriNetUnfolderBase]: 186/349 cut-off events. [2024-06-14 15:37:50,586 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-06-14 15:37:50,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 349 events. 186/349 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1264 event pairs, 94 based on Foata normal form. 2/343 useless extension candidates. Maximal degree in co-relation 778. Up to 319 conditions per place. [2024-06-14 15:37:50,592 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 28 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-14 15:37:50,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 165 flow [2024-06-14 15:37:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:37:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:37:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-14 15:37:50,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2024-06-14 15:37:50,596 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 67 transitions. [2024-06-14 15:37:50,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 165 flow [2024-06-14 15:37:50,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:37:50,599 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-14 15:37:50,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-14 15:37:50,601 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-14 15:37:50,601 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-14 15:37:50,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:50,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:50,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:37:50,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:37:50,602 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:37:50,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:50,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2061510898, now seen corresponding path program 1 times [2024-06-14 15:37:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:50,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56238151] [2024-06-14 15:37:50,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:50,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:53,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:53,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56238151] [2024-06-14 15:37:53,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56238151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:53,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:53,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:37:53,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68003249] [2024-06-14 15:37:53,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:53,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:37:53,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:53,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:37:53,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:37:53,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:37:53,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:53,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:53,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:37:53,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:53,538 INFO L124 PetriNetUnfolderBase]: 187/355 cut-off events. [2024-06-14 15:37:53,539 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-06-14 15:37:53,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 355 events. 187/355 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1295 event pairs, 67 based on Foata normal form. 3/356 useless extension candidates. Maximal degree in co-relation 868. Up to 293 conditions per place. [2024-06-14 15:37:53,542 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2024-06-14 15:37:53,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 257 flow [2024-06-14 15:37:53,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:37:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:37:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-14 15:37:53,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.54375 [2024-06-14 15:37:53,545 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 87 transitions. [2024-06-14 15:37:53,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 257 flow [2024-06-14 15:37:53,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 248 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 15:37:53,548 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 164 flow [2024-06-14 15:37:53,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2024-06-14 15:37:53,549 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-14 15:37:53,549 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 164 flow [2024-06-14 15:37:53,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:53,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:53,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:37:53,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:37:53,550 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:37:53,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:53,551 INFO L85 PathProgramCache]: Analyzing trace with hash -517670889, now seen corresponding path program 1 times [2024-06-14 15:37:53,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:53,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643204237] [2024-06-14 15:37:53,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:53,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:56,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643204237] [2024-06-14 15:37:56,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643204237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:56,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:56,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:37:56,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322080258] [2024-06-14 15:37:56,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:56,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:37:56,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:56,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:37:56,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:37:57,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:37:57,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:57,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:57,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:37:57,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:57,396 INFO L124 PetriNetUnfolderBase]: 188/357 cut-off events. [2024-06-14 15:37:57,397 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES. [2024-06-14 15:37:57,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 357 events. 188/357 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1315 event pairs, 46 based on Foata normal form. 3/358 useless extension candidates. Maximal degree in co-relation 1042. Up to 282 conditions per place. [2024-06-14 15:37:57,400 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 40 selfloop transitions, 14 changer transitions 0/57 dead transitions. [2024-06-14 15:37:57,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 342 flow [2024-06-14 15:37:57,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:37:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:37:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-14 15:37:57,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-06-14 15:37:57,404 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 164 flow. Second operand 6 states and 102 transitions. [2024-06-14 15:37:57,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 342 flow [2024-06-14 15:37:57,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 338 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-14 15:37:57,408 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 216 flow [2024-06-14 15:37:57,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-14 15:37:57,409 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-14 15:37:57,409 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 216 flow [2024-06-14 15:37:57,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:57,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:57,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:37:57,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:37:57,410 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:37:57,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:57,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1132072369, now seen corresponding path program 1 times [2024-06-14 15:37:57,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:57,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149520198] [2024-06-14 15:37:57,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:57,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:00,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:00,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149520198] [2024-06-14 15:38:00,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149520198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:00,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:00,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:38:00,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246512743] [2024-06-14 15:38:00,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:00,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:38:00,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:00,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:38:00,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:38:00,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 15:38:00,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:00,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:00,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 15:38:00,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:00,863 INFO L124 PetriNetUnfolderBase]: 189/360 cut-off events. [2024-06-14 15:38:00,863 INFO L125 PetriNetUnfolderBase]: For 640/640 co-relation queries the response was YES. [2024-06-14 15:38:00,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 360 events. 189/360 cut-off events. For 640/640 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1329 event pairs, 24 based on Foata normal form. 6/364 useless extension candidates. Maximal degree in co-relation 1172. Up to 259 conditions per place. [2024-06-14 15:38:00,866 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 40 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2024-06-14 15:38:00,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 388 flow [2024-06-14 15:38:00,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:38:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:38:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-14 15:38:00,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-14 15:38:00,867 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 216 flow. Second operand 7 states and 112 transitions. [2024-06-14 15:38:00,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 388 flow [2024-06-14 15:38:00,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 356 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 15:38:00,869 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 219 flow [2024-06-14 15:38:00,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-06-14 15:38:00,870 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-14 15:38:00,870 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 219 flow [2024-06-14 15:38:00,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:00,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:00,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:00,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:38:00,871 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:00,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:00,871 INFO L85 PathProgramCache]: Analyzing trace with hash 889308452, now seen corresponding path program 1 times [2024-06-14 15:38:00,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:00,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977557722] [2024-06-14 15:38:00,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:00,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:06,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:06,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977557722] [2024-06-14 15:38:06,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977557722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:06,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:06,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:38:06,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868651553] [2024-06-14 15:38:06,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:06,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:38:06,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:06,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:38:06,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:38:06,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:38:06,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:06,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:06,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:38:06,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:07,130 INFO L124 PetriNetUnfolderBase]: 187/356 cut-off events. [2024-06-14 15:38:07,130 INFO L125 PetriNetUnfolderBase]: For 747/747 co-relation queries the response was YES. [2024-06-14 15:38:07,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 356 events. 187/356 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1301 event pairs, 47 based on Foata normal form. 1/355 useless extension candidates. Maximal degree in co-relation 1217. Up to 329 conditions per place. [2024-06-14 15:38:07,133 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 35 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2024-06-14 15:38:07,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 313 flow [2024-06-14 15:38:07,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:38:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:38:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2024-06-14 15:38:07,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:38:07,134 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 219 flow. Second operand 5 states and 65 transitions. [2024-06-14 15:38:07,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 313 flow [2024-06-14 15:38:07,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 272 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 15:38:07,136 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 195 flow [2024-06-14 15:38:07,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-06-14 15:38:07,137 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-14 15:38:07,137 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 195 flow [2024-06-14 15:38:07,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:07,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:07,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:07,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:38:07,138 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:38:07,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:07,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1770131004, now seen corresponding path program 1 times [2024-06-14 15:38:07,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:07,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692486772] [2024-06-14 15:38:07,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:07,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:13,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:13,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692486772] [2024-06-14 15:38:13,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692486772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:13,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:13,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:38:13,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437571906] [2024-06-14 15:38:13,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:13,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:38:13,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:13,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:38:13,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:38:13,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:38:13,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 195 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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:38:13,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:13,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:38:13,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:14,099 INFO L124 PetriNetUnfolderBase]: 212/383 cut-off events. [2024-06-14 15:38:14,100 INFO L125 PetriNetUnfolderBase]: For 1031/1031 co-relation queries the response was YES. [2024-06-14 15:38:14,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 383 events. 212/383 cut-off events. For 1031/1031 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1348 event pairs, 55 based on Foata normal form. 1/382 useless extension candidates. Maximal degree in co-relation 1300. Up to 368 conditions per place. [2024-06-14 15:38:14,102 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 37 selfloop transitions, 8 changer transitions 0/47 dead transitions. [2024-06-14 15:38:14,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 47 transitions, 307 flow [2024-06-14 15:38:14,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:38:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:38:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-14 15:38:14,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:38:14,104 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 195 flow. Second operand 6 states and 70 transitions. [2024-06-14 15:38:14,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 47 transitions, 307 flow [2024-06-14 15:38:14,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 292 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-14 15:38:14,106 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 213 flow [2024-06-14 15:38:14,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-06-14 15:38:14,106 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 19 predicate places. [2024-06-14 15:38:14,107 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 213 flow [2024-06-14 15:38:14,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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:38:14,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:14,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:14,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:38:14,107 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:38:14,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1361521897, now seen corresponding path program 1 times [2024-06-14 15:38:14,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:14,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080763229] [2024-06-14 15:38:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:14,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:18,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:18,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080763229] [2024-06-14 15:38:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080763229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:18,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:18,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:38:18,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632018192] [2024-06-14 15:38:18,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:18,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:38:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:18,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:38:18,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:38:18,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:38:18,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 213 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:38:18,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:18,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:38:18,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:19,188 INFO L124 PetriNetUnfolderBase]: 197/369 cut-off events. [2024-06-14 15:38:19,188 INFO L125 PetriNetUnfolderBase]: For 1312/1312 co-relation queries the response was YES. [2024-06-14 15:38:19,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 369 events. 197/369 cut-off events. For 1312/1312 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1341 event pairs, 51 based on Foata normal form. 2/369 useless extension candidates. Maximal degree in co-relation 1323. Up to 306 conditions per place. [2024-06-14 15:38:19,191 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 13 changer transitions 0/53 dead transitions. [2024-06-14 15:38:19,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 362 flow [2024-06-14 15:38:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:38:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:38:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-06-14 15:38:19,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4322916666666667 [2024-06-14 15:38:19,192 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 213 flow. Second operand 6 states and 83 transitions. [2024-06-14 15:38:19,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 362 flow [2024-06-14 15:38:19,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 345 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:38:19,194 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 244 flow [2024-06-14 15:38:19,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-06-14 15:38:19,194 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2024-06-14 15:38:19,195 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 244 flow [2024-06-14 15:38:19,195 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:38:19,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:19,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:19,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:38:19,195 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:38:19,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:19,196 INFO L85 PathProgramCache]: Analyzing trace with hash -72326031, now seen corresponding path program 2 times [2024-06-14 15:38:19,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:19,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361217669] [2024-06-14 15:38:19,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:19,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:23,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:23,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361217669] [2024-06-14 15:38:23,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361217669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:23,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:23,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:38:23,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693576484] [2024-06-14 15:38:23,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:23,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:38:23,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:23,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:38:23,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:38:23,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:38:23,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 244 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:38:23,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:23,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:38:23,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:24,220 INFO L124 PetriNetUnfolderBase]: 192/359 cut-off events. [2024-06-14 15:38:24,221 INFO L125 PetriNetUnfolderBase]: For 1557/1557 co-relation queries the response was YES. [2024-06-14 15:38:24,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 359 events. 192/359 cut-off events. For 1557/1557 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1293 event pairs, 50 based on Foata normal form. 1/358 useless extension candidates. Maximal degree in co-relation 1344. Up to 327 conditions per place. [2024-06-14 15:38:24,223 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 37 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2024-06-14 15:38:24,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 49 transitions, 348 flow [2024-06-14 15:38:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:38:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:38:24,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2024-06-14 15:38:24,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:38:24,224 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 244 flow. Second operand 6 states and 75 transitions. [2024-06-14 15:38:24,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 49 transitions, 348 flow [2024-06-14 15:38:24,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 333 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 15:38:24,229 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 250 flow [2024-06-14 15:38:24,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-06-14 15:38:24,230 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2024-06-14 15:38:24,230 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 250 flow [2024-06-14 15:38:24,230 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:38:24,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:24,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:24,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:38:24,230 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:38:24,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:24,231 INFO L85 PathProgramCache]: Analyzing trace with hash -101638205, now seen corresponding path program 1 times [2024-06-14 15:38:24,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:24,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255349054] [2024-06-14 15:38:24,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:24,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:31,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:31,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255349054] [2024-06-14 15:38:31,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255349054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:31,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:31,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:38:31,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059232010] [2024-06-14 15:38:31,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:31,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:38:31,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:31,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:38:31,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:38:31,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:38:31,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 250 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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:38:31,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:31,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:38:31,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:31,850 INFO L124 PetriNetUnfolderBase]: 202/366 cut-off events. [2024-06-14 15:38:31,850 INFO L125 PetriNetUnfolderBase]: For 1803/1803 co-relation queries the response was YES. [2024-06-14 15:38:31,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 366 events. 202/366 cut-off events. For 1803/1803 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1247 event pairs, 50 based on Foata normal form. 3/367 useless extension candidates. Maximal degree in co-relation 1384. Up to 342 conditions per place. [2024-06-14 15:38:31,852 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 42 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-06-14 15:38:31,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 54 transitions, 384 flow [2024-06-14 15:38:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:38:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:38:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2024-06-14 15:38:31,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2024-06-14 15:38:31,855 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 250 flow. Second operand 7 states and 81 transitions. [2024-06-14 15:38:31,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 54 transitions, 384 flow [2024-06-14 15:38:31,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 350 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 15:38:31,863 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 255 flow [2024-06-14 15:38:31,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-06-14 15:38:31,864 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2024-06-14 15:38:31,865 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 255 flow [2024-06-14 15:38:31,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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:38:31,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:31,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:31,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:38:31,865 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:38:31,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:31,866 INFO L85 PathProgramCache]: Analyzing trace with hash 111499709, now seen corresponding path program 1 times [2024-06-14 15:38:31,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:31,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123201605] [2024-06-14 15:38:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:31,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:37,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123201605] [2024-06-14 15:38:37,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123201605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:37,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:37,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:38:37,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572581633] [2024-06-14 15:38:37,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:37,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:38:37,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:37,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:38:37,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:38:37,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:38:37,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 255 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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:38:37,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:37,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:38:37,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:37,488 INFO L124 PetriNetUnfolderBase]: 208/376 cut-off events. [2024-06-14 15:38:37,488 INFO L125 PetriNetUnfolderBase]: For 2064/2064 co-relation queries the response was YES. [2024-06-14 15:38:37,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 376 events. 208/376 cut-off events. For 2064/2064 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1312 event pairs, 49 based on Foata normal form. 2/376 useless extension candidates. Maximal degree in co-relation 1466. Up to 308 conditions per place. [2024-06-14 15:38:37,490 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 43 selfloop transitions, 18 changer transitions 0/63 dead transitions. [2024-06-14 15:38:37,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 453 flow [2024-06-14 15:38:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:38:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:38:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 15:38:37,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2024-06-14 15:38:37,491 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 255 flow. Second operand 8 states and 98 transitions. [2024-06-14 15:38:37,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 453 flow [2024-06-14 15:38:37,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 430 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:38:37,494 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 302 flow [2024-06-14 15:38:37,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=302, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2024-06-14 15:38:37,495 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2024-06-14 15:38:37,495 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 302 flow [2024-06-14 15:38:37,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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:38:37,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:37,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:37,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:38:37,495 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:38:37,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2030518043, now seen corresponding path program 2 times [2024-06-14 15:38:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:37,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728556785] [2024-06-14 15:38:37,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:37,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:42,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:42,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728556785] [2024-06-14 15:38:42,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728556785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:42,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:42,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:38:42,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491699854] [2024-06-14 15:38:42,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:42,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:38:42,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:42,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:38:42,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:38:42,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:38:42,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 302 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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:38:42,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:42,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:38:42,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:42,940 INFO L124 PetriNetUnfolderBase]: 211/381 cut-off events. [2024-06-14 15:38:42,940 INFO L125 PetriNetUnfolderBase]: For 2399/2399 co-relation queries the response was YES. [2024-06-14 15:38:42,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 381 events. 211/381 cut-off events. For 2399/2399 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1328 event pairs, 48 based on Foata normal form. 1/380 useless extension candidates. Maximal degree in co-relation 1581. Up to 356 conditions per place. [2024-06-14 15:38:42,943 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 47 selfloop transitions, 14 changer transitions 0/63 dead transitions. [2024-06-14 15:38:42,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 494 flow [2024-06-14 15:38:42,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:38:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:38:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-14 15:38:42,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515625 [2024-06-14 15:38:42,944 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 302 flow. Second operand 8 states and 90 transitions. [2024-06-14 15:38:42,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 494 flow [2024-06-14 15:38:42,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 63 transitions, 472 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 15:38:42,947 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 345 flow [2024-06-14 15:38:42,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=345, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-06-14 15:38:42,948 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 32 predicate places. [2024-06-14 15:38:42,948 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 345 flow [2024-06-14 15:38:42,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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:38:42,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:42,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:42,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:38:42,949 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:38:42,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash 288868379, now seen corresponding path program 3 times [2024-06-14 15:38:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:42,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875624153] [2024-06-14 15:38:42,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:47,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:47,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:47,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875624153] [2024-06-14 15:38:47,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875624153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:47,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:47,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:38:47,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797251884] [2024-06-14 15:38:47,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:47,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:38:47,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:47,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:38:47,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:38:47,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:38:47,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 345 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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:38:47,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:47,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:38:47,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:48,267 INFO L124 PetriNetUnfolderBase]: 209/378 cut-off events. [2024-06-14 15:38:48,267 INFO L125 PetriNetUnfolderBase]: For 2826/2826 co-relation queries the response was YES. [2024-06-14 15:38:48,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 378 events. 209/378 cut-off events. For 2826/2826 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1311 event pairs, 48 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 1626. Up to 360 conditions per place. [2024-06-14 15:38:48,270 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 49 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2024-06-14 15:38:48,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 479 flow [2024-06-14 15:38:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:38:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:38:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-14 15:38:48,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2024-06-14 15:38:48,271 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 345 flow. Second operand 7 states and 79 transitions. [2024-06-14 15:38:48,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 479 flow [2024-06-14 15:38:48,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 61 transitions, 454 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 15:38:48,274 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 345 flow [2024-06-14 15:38:48,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=345, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-06-14 15:38:48,275 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-14 15:38:48,275 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 345 flow [2024-06-14 15:38:48,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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:38:48,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:48,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:48,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:38:48,276 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:38:48,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:48,277 INFO L85 PathProgramCache]: Analyzing trace with hash 899908152, now seen corresponding path program 1 times [2024-06-14 15:38:48,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:48,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146073007] [2024-06-14 15:38:48,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:48,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:53,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:53,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:53,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146073007] [2024-06-14 15:38:53,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146073007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:53,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:53,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:38:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186757175] [2024-06-14 15:38:53,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:53,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:38:53,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:53,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:38:53,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:38:54,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:38:54,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 345 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:54,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:54,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:38:54,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:54,358 INFO L124 PetriNetUnfolderBase]: 202/373 cut-off events. [2024-06-14 15:38:54,358 INFO L125 PetriNetUnfolderBase]: For 3340/3340 co-relation queries the response was YES. [2024-06-14 15:38:54,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1673 conditions, 373 events. 202/373 cut-off events. For 3340/3340 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1320 event pairs, 46 based on Foata normal form. 1/372 useless extension candidates. Maximal degree in co-relation 1639. Up to 288 conditions per place. [2024-06-14 15:38:54,361 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 47 selfloop transitions, 17 changer transitions 0/72 dead transitions. [2024-06-14 15:38:54,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 72 transitions, 557 flow [2024-06-14 15:38:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:38:54,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:38:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-14 15:38:54,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 15:38:54,362 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 345 flow. Second operand 7 states and 96 transitions. [2024-06-14 15:38:54,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 72 transitions, 557 flow [2024-06-14 15:38:54,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 72 transitions, 532 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-14 15:38:54,366 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 387 flow [2024-06-14 15:38:54,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=387, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2024-06-14 15:38:54,367 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2024-06-14 15:38:54,368 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 387 flow [2024-06-14 15:38:54,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:54,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:54,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:38:54,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:38:54,368 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:38:54,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:54,369 INFO L85 PathProgramCache]: Analyzing trace with hash -842200350, now seen corresponding path program 2 times [2024-06-14 15:38:54,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:54,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888434148] [2024-06-14 15:38:54,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:54,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:00,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:00,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888434148] [2024-06-14 15:39:00,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888434148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:00,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:00,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:39:00,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870892016] [2024-06-14 15:39:00,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:00,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:39:00,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:00,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:39:00,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:39:00,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:39:00,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 387 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:00,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:00,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:39:00,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:00,559 INFO L124 PetriNetUnfolderBase]: 200/370 cut-off events. [2024-06-14 15:39:00,559 INFO L125 PetriNetUnfolderBase]: For 3765/3765 co-relation queries the response was YES. [2024-06-14 15:39:00,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1732 conditions, 370 events. 200/370 cut-off events. For 3765/3765 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1308 event pairs, 46 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 1697. Up to 301 conditions per place. [2024-06-14 15:39:00,561 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 45 selfloop transitions, 15 changer transitions 0/68 dead transitions. [2024-06-14 15:39:00,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 68 transitions, 531 flow [2024-06-14 15:39:00,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:39:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:39:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-14 15:39:00,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-14 15:39:00,563 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 387 flow. Second operand 7 states and 92 transitions. [2024-06-14 15:39:00,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 68 transitions, 531 flow [2024-06-14 15:39:00,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 68 transitions, 506 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-14 15:39:00,567 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 397 flow [2024-06-14 15:39:00,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=397, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2024-06-14 15:39:00,567 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 40 predicate places. [2024-06-14 15:39:00,568 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 397 flow [2024-06-14 15:39:00,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:00,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:00,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:39:00,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:39:00,568 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:39:00,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:00,569 INFO L85 PathProgramCache]: Analyzing trace with hash -838475545, now seen corresponding path program 1 times [2024-06-14 15:39:00,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:00,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909490132] [2024-06-14 15:39:00,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:00,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:06,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:06,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909490132] [2024-06-14 15:39:06,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909490132] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:06,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:06,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:39:06,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792160071] [2024-06-14 15:39:06,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:06,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:39:06,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:06,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:39:06,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:39:06,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:39:06,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 397 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:06,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:06,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:39:06,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:06,383 INFO L124 PetriNetUnfolderBase]: 218/393 cut-off events. [2024-06-14 15:39:06,383 INFO L125 PetriNetUnfolderBase]: For 4323/4323 co-relation queries the response was YES. [2024-06-14 15:39:06,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 393 events. 218/393 cut-off events. For 4323/4323 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1376 event pairs, 48 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 1863. Up to 321 conditions per place. [2024-06-14 15:39:06,386 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 49 selfloop transitions, 24 changer transitions 0/75 dead transitions. [2024-06-14 15:39:06,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 75 transitions, 661 flow [2024-06-14 15:39:06,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:39:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:39:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 15:39:06,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2024-06-14 15:39:06,388 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 397 flow. Second operand 8 states and 98 transitions. [2024-06-14 15:39:06,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 75 transitions, 661 flow [2024-06-14 15:39:06,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 75 transitions, 623 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 15:39:06,393 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 441 flow [2024-06-14 15:39:06,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=441, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2024-06-14 15:39:06,394 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 42 predicate places. [2024-06-14 15:39:06,394 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 441 flow [2024-06-14 15:39:06,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:06,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:06,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:39:06,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:39:06,395 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:39:06,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:06,395 INFO L85 PathProgramCache]: Analyzing trace with hash -838481125, now seen corresponding path program 2 times [2024-06-14 15:39:06,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:06,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756129530] [2024-06-14 15:39:06,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:06,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:11,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:11,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756129530] [2024-06-14 15:39:11,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756129530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:11,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:11,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:39:11,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544344303] [2024-06-14 15:39:11,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:11,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:39:11,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:11,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:39:11,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:39:12,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:39:12,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 441 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:12,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:12,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:39:12,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:12,330 INFO L124 PetriNetUnfolderBase]: 216/390 cut-off events. [2024-06-14 15:39:12,331 INFO L125 PetriNetUnfolderBase]: For 4760/4760 co-relation queries the response was YES. [2024-06-14 15:39:12,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 390 events. 216/390 cut-off events. For 4760/4760 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1366 event pairs, 48 based on Foata normal form. 1/389 useless extension candidates. Maximal degree in co-relation 1885. Up to 319 conditions per place. [2024-06-14 15:39:12,334 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 48 selfloop transitions, 27 changer transitions 0/77 dead transitions. [2024-06-14 15:39:12,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 77 transitions, 659 flow [2024-06-14 15:39:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:39:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:39:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-14 15:39:12,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-14 15:39:12,336 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 441 flow. Second operand 8 states and 101 transitions. [2024-06-14 15:39:12,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 77 transitions, 659 flow [2024-06-14 15:39:12,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 77 transitions, 626 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-14 15:39:12,342 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 467 flow [2024-06-14 15:39:12,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=467, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2024-06-14 15:39:12,342 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 46 predicate places. [2024-06-14 15:39:12,343 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 467 flow [2024-06-14 15:39:12,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:12,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:12,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:39:12,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:39:12,343 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:39:12,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash -838475328, now seen corresponding path program 1 times [2024-06-14 15:39:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:12,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838663397] [2024-06-14 15:39:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:17,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:17,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838663397] [2024-06-14 15:39:17,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838663397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:17,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:17,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:39:17,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585137228] [2024-06-14 15:39:17,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:17,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:39:17,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:17,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:39:17,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:39:17,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:39:17,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 62 transitions, 467 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:39:17,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:17,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:39:17,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:18,020 INFO L124 PetriNetUnfolderBase]: 254/452 cut-off events. [2024-06-14 15:39:18,021 INFO L125 PetriNetUnfolderBase]: For 6629/6629 co-relation queries the response was YES. [2024-06-14 15:39:18,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2253 conditions, 452 events. 254/452 cut-off events. For 6629/6629 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1660 event pairs, 52 based on Foata normal form. 6/456 useless extension candidates. Maximal degree in co-relation 2214. Up to 308 conditions per place. [2024-06-14 15:39:18,023 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 60 selfloop transitions, 25 changer transitions 0/87 dead transitions. [2024-06-14 15:39:18,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 87 transitions, 755 flow [2024-06-14 15:39:18,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:39:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:39:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:39:18,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 15:39:18,025 INFO L175 Difference]: Start difference. First operand has 77 places, 62 transitions, 467 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:39:18,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 87 transitions, 755 flow [2024-06-14 15:39:18,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 87 transitions, 687 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 15:39:18,031 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 505 flow [2024-06-14 15:39:18,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=505, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2024-06-14 15:39:18,031 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-06-14 15:39:18,031 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 505 flow [2024-06-14 15:39:18,032 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:39:18,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:18,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:39:18,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:39:18,032 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:39:18,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash 343535018, now seen corresponding path program 2 times [2024-06-14 15:39:18,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:18,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398255010] [2024-06-14 15:39:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:18,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:22,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:22,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398255010] [2024-06-14 15:39:22,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398255010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:22,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:22,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:39:22,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589440595] [2024-06-14 15:39:22,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:22,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:39:22,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:22,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:39:22,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:39:23,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:39:23,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 505 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:39:23,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:23,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:39:23,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:23,343 INFO L124 PetriNetUnfolderBase]: 263/467 cut-off events. [2024-06-14 15:39:23,344 INFO L125 PetriNetUnfolderBase]: For 7109/7109 co-relation queries the response was YES. [2024-06-14 15:39:23,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2457 conditions, 467 events. 263/467 cut-off events. For 7109/7109 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1720 event pairs, 53 based on Foata normal form. 3/468 useless extension candidates. Maximal degree in co-relation 2416. Up to 440 conditions per place. [2024-06-14 15:39:23,347 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 67 selfloop transitions, 12 changer transitions 0/81 dead transitions. [2024-06-14 15:39:23,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 81 transitions, 705 flow [2024-06-14 15:39:23,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:39:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:39:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-14 15:39:23,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515625 [2024-06-14 15:39:23,349 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 505 flow. Second operand 8 states and 90 transitions. [2024-06-14 15:39:23,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 81 transitions, 705 flow [2024-06-14 15:39:23,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 81 transitions, 676 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 15:39:23,363 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 527 flow [2024-06-14 15:39:23,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=527, PETRI_PLACES=84, PETRI_TRANSITIONS=71} [2024-06-14 15:39:23,363 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2024-06-14 15:39:23,364 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 527 flow [2024-06-14 15:39:23,364 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:39:23,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:23,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:39:23,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:39:23,364 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:39:23,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:23,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1109688644, now seen corresponding path program 3 times [2024-06-14 15:39:23,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:23,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671749980] [2024-06-14 15:39:23,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:23,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:28,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:39:28,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:28,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671749980] [2024-06-14 15:39:28,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671749980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:28,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:28,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:39:28,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31607929] [2024-06-14 15:39:28,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:28,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:39:28,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:28,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:39:28,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:39:28,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:39:28,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 527 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:39:28,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:28,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:39:28,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:28,891 INFO L124 PetriNetUnfolderBase]: 272/482 cut-off events. [2024-06-14 15:39:28,891 INFO L125 PetriNetUnfolderBase]: For 7987/7987 co-relation queries the response was YES. [2024-06-14 15:39:28,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2584 conditions, 482 events. 272/482 cut-off events. For 7987/7987 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1792 event pairs, 53 based on Foata normal form. 3/483 useless extension candidates. Maximal degree in co-relation 2541. Up to 443 conditions per place. [2024-06-14 15:39:28,894 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 68 selfloop transitions, 15 changer transitions 0/85 dead transitions. [2024-06-14 15:39:28,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 745 flow [2024-06-14 15:39:28,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:39:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:39:28,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-14 15:39:28,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 15:39:28,897 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 527 flow. Second operand 8 states and 94 transitions. [2024-06-14 15:39:28,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 745 flow [2024-06-14 15:39:28,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 85 transitions, 711 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:39:28,903 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 554 flow [2024-06-14 15:39:28,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=554, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2024-06-14 15:39:28,904 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 55 predicate places. [2024-06-14 15:39:28,904 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 554 flow [2024-06-14 15:39:28,904 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:39:28,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:28,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:39:28,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:39:28,905 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:39:28,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:28,905 INFO L85 PathProgramCache]: Analyzing trace with hash 364985929, now seen corresponding path program 3 times [2024-06-14 15:39:28,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:28,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110542165] [2024-06-14 15:39:28,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:28,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:33,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:33,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110542165] [2024-06-14 15:39:33,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110542165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:33,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:33,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:39:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409803052] [2024-06-14 15:39:33,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:33,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:39:33,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:33,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:39:33,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:39:33,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:39:33,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 554 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:33,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:33,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:39:33,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:34,158 INFO L124 PetriNetUnfolderBase]: 270/479 cut-off events. [2024-06-14 15:39:34,158 INFO L125 PetriNetUnfolderBase]: For 8171/8171 co-relation queries the response was YES. [2024-06-14 15:39:34,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2606 conditions, 479 events. 270/479 cut-off events. For 8171/8171 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1784 event pairs, 54 based on Foata normal form. 1/478 useless extension candidates. Maximal degree in co-relation 2562. Up to 458 conditions per place. [2024-06-14 15:39:34,162 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 67 selfloop transitions, 11 changer transitions 0/80 dead transitions. [2024-06-14 15:39:34,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 80 transitions, 726 flow [2024-06-14 15:39:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:39:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:39:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-14 15:39:34,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2024-06-14 15:39:34,163 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 554 flow. Second operand 7 states and 80 transitions. [2024-06-14 15:39:34,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 80 transitions, 726 flow [2024-06-14 15:39:34,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 80 transitions, 681 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-14 15:39:34,170 INFO L231 Difference]: Finished difference. Result has 87 places, 73 transitions, 536 flow [2024-06-14 15:39:34,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=536, PETRI_PLACES=87, PETRI_TRANSITIONS=73} [2024-06-14 15:39:34,170 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-14 15:39:34,170 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 73 transitions, 536 flow [2024-06-14 15:39:34,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:34,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:34,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:39:34,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:39:34,171 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:39:34,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:34,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1478449118, now seen corresponding path program 4 times [2024-06-14 15:39:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:34,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841629942] [2024-06-14 15:39:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:34,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:39,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:39,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841629942] [2024-06-14 15:39:39,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841629942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:39,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:39,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:39:39,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856134412] [2024-06-14 15:39:39,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:39,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:39:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:39,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:39:39,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:39:39,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:39:39,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 73 transitions, 536 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:39:39,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:39,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:39:39,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:39,710 INFO L124 PetriNetUnfolderBase]: 264/470 cut-off events. [2024-06-14 15:39:39,711 INFO L125 PetriNetUnfolderBase]: For 8482/8482 co-relation queries the response was YES. [2024-06-14 15:39:39,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2484 conditions, 470 events. 264/470 cut-off events. For 8482/8482 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1737 event pairs, 51 based on Foata normal form. 3/471 useless extension candidates. Maximal degree in co-relation 2439. Up to 416 conditions per place. [2024-06-14 15:39:39,714 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 66 selfloop transitions, 20 changer transitions 0/88 dead transitions. [2024-06-14 15:39:39,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 766 flow [2024-06-14 15:39:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:39:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:39:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-14 15:39:39,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-14 15:39:39,715 INFO L175 Difference]: Start difference. First operand has 87 places, 73 transitions, 536 flow. Second operand 9 states and 104 transitions. [2024-06-14 15:39:39,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 766 flow [2024-06-14 15:39:39,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 88 transitions, 721 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 15:39:39,723 INFO L231 Difference]: Finished difference. Result has 89 places, 75 transitions, 566 flow [2024-06-14 15:39:39,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=566, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2024-06-14 15:39:39,724 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-06-14 15:39:39,724 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 566 flow [2024-06-14 15:39:39,724 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:39:39,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:39,725 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:39:39,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:39:39,725 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:39:39,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash -341263200, now seen corresponding path program 1 times [2024-06-14 15:39:39,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:39,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260031389] [2024-06-14 15:39:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:39,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:45,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:39:45,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:45,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260031389] [2024-06-14 15:39:45,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260031389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:45,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:45,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:39:45,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866553168] [2024-06-14 15:39:45,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:45,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:39:45,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:45,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:39:45,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:39:45,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:39:45,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 566 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:45,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:45,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:39:45,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:45,997 INFO L124 PetriNetUnfolderBase]: 255/465 cut-off events. [2024-06-14 15:39:45,997 INFO L125 PetriNetUnfolderBase]: For 9239/9239 co-relation queries the response was YES. [2024-06-14 15:39:45,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2524 conditions, 465 events. 255/465 cut-off events. For 9239/9239 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1776 event pairs, 30 based on Foata normal form. 2/465 useless extension candidates. Maximal degree in co-relation 2478. Up to 335 conditions per place. [2024-06-14 15:39:46,001 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 63 selfloop transitions, 20 changer transitions 0/93 dead transitions. [2024-06-14 15:39:46,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 93 transitions, 826 flow [2024-06-14 15:39:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:39:46,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:39:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:39:46,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-14 15:39:46,002 INFO L175 Difference]: Start difference. First operand has 89 places, 75 transitions, 566 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:39:46,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 93 transitions, 826 flow [2024-06-14 15:39:46,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 93 transitions, 769 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 15:39:46,011 INFO L231 Difference]: Finished difference. Result has 90 places, 76 transitions, 563 flow [2024-06-14 15:39:46,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=563, PETRI_PLACES=90, PETRI_TRANSITIONS=76} [2024-06-14 15:39:46,011 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 59 predicate places. [2024-06-14 15:39:46,012 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 76 transitions, 563 flow [2024-06-14 15:39:46,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:46,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:46,012 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:39:46,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:39:46,012 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:39:46,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:46,013 INFO L85 PathProgramCache]: Analyzing trace with hash -689629958, now seen corresponding path program 2 times [2024-06-14 15:39:46,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:46,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014913529] [2024-06-14 15:39:46,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:46,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:51,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:51,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014913529] [2024-06-14 15:39:51,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014913529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:51,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:51,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:39:51,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128628694] [2024-06-14 15:39:51,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:51,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:39:51,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:51,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:39:51,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:39:51,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:39:51,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 76 transitions, 563 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:51,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:51,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:39:51,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:51,702 INFO L124 PetriNetUnfolderBase]: 259/473 cut-off events. [2024-06-14 15:39:51,702 INFO L125 PetriNetUnfolderBase]: For 9848/9848 co-relation queries the response was YES. [2024-06-14 15:39:51,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2562 conditions, 473 events. 259/473 cut-off events. For 9848/9848 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1822 event pairs, 48 based on Foata normal form. 2/473 useless extension candidates. Maximal degree in co-relation 2515. Up to 380 conditions per place. [2024-06-14 15:39:51,706 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 64 selfloop transitions, 18 changer transitions 0/92 dead transitions. [2024-06-14 15:39:51,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 92 transitions, 775 flow [2024-06-14 15:39:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:39:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:39:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:39:51,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-14 15:39:51,711 INFO L175 Difference]: Start difference. First operand has 90 places, 76 transitions, 563 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:39:51,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 92 transitions, 775 flow [2024-06-14 15:39:51,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 726 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 15:39:51,720 INFO L231 Difference]: Finished difference. Result has 93 places, 77 transitions, 568 flow [2024-06-14 15:39:51,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=568, PETRI_PLACES=93, PETRI_TRANSITIONS=77} [2024-06-14 15:39:51,721 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 62 predicate places. [2024-06-14 15:39:51,721 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 77 transitions, 568 flow [2024-06-14 15:39:51,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:51,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:51,721 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:39:51,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:39:51,722 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:39:51,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:51,722 INFO L85 PathProgramCache]: Analyzing trace with hash -689629834, now seen corresponding path program 1 times [2024-06-14 15:39:51,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:51,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584126732] [2024-06-14 15:39:51,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:51,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:56,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:56,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584126732] [2024-06-14 15:39:56,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584126732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:56,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:56,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:39:56,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919566102] [2024-06-14 15:39:56,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:56,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:39:56,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:56,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:39:56,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:39:56,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:39:56,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 77 transitions, 568 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:39:56,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:56,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:39:56,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:57,167 INFO L124 PetriNetUnfolderBase]: 275/491 cut-off events. [2024-06-14 15:39:57,167 INFO L125 PetriNetUnfolderBase]: For 10279/10279 co-relation queries the response was YES. [2024-06-14 15:39:57,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2642 conditions, 491 events. 275/491 cut-off events. For 10279/10279 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1869 event pairs, 50 based on Foata normal form. 1/490 useless extension candidates. Maximal degree in co-relation 2594. Up to 386 conditions per place. [2024-06-14 15:39:57,171 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 67 selfloop transitions, 27 changer transitions 0/96 dead transitions. [2024-06-14 15:39:57,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 96 transitions, 864 flow [2024-06-14 15:39:57,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:39:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:39:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-14 15:39:57,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-14 15:39:57,175 INFO L175 Difference]: Start difference. First operand has 93 places, 77 transitions, 568 flow. Second operand 8 states and 102 transitions. [2024-06-14 15:39:57,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 96 transitions, 864 flow [2024-06-14 15:39:57,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 96 transitions, 815 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:39:57,200 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 606 flow [2024-06-14 15:39:57,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=606, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2024-06-14 15:39:57,201 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 63 predicate places. [2024-06-14 15:39:57,201 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 606 flow [2024-06-14 15:39:57,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:39:57,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:57,201 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:39:57,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:39:57,202 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:39:57,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:57,216 INFO L85 PathProgramCache]: Analyzing trace with hash -338401466, now seen corresponding path program 2 times [2024-06-14 15:39:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238944714] [2024-06-14 15:39:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:03,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:03,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238944714] [2024-06-14 15:40:03,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238944714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:03,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:03,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:40:03,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484014019] [2024-06-14 15:40:03,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:03,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:40:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:03,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:40:03,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:40:03,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:40:03,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 81 transitions, 606 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:03,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:03,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:40:03,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:03,734 INFO L124 PetriNetUnfolderBase]: 278/496 cut-off events. [2024-06-14 15:40:03,734 INFO L125 PetriNetUnfolderBase]: For 11075/11075 co-relation queries the response was YES. [2024-06-14 15:40:03,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 496 events. 278/496 cut-off events. For 11075/11075 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1903 event pairs, 53 based on Foata normal form. 1/495 useless extension candidates. Maximal degree in co-relation 2646. Up to 423 conditions per place. [2024-06-14 15:40:03,738 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 67 selfloop transitions, 26 changer transitions 0/95 dead transitions. [2024-06-14 15:40:03,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 95 transitions, 836 flow [2024-06-14 15:40:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:40:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:40:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 15:40:03,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-14 15:40:03,740 INFO L175 Difference]: Start difference. First operand has 94 places, 81 transitions, 606 flow. Second operand 9 states and 106 transitions. [2024-06-14 15:40:03,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 95 transitions, 836 flow [2024-06-14 15:40:03,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 797 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 15:40:03,750 INFO L231 Difference]: Finished difference. Result has 99 places, 83 transitions, 644 flow [2024-06-14 15:40:03,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=644, PETRI_PLACES=99, PETRI_TRANSITIONS=83} [2024-06-14 15:40:03,751 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 68 predicate places. [2024-06-14 15:40:03,751 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 83 transitions, 644 flow [2024-06-14 15:40:03,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:03,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:03,751 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:40:03,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:40:03,752 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:40:03,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:03,752 INFO L85 PathProgramCache]: Analyzing trace with hash -686833324, now seen corresponding path program 3 times [2024-06-14 15:40:03,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:03,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889252874] [2024-06-14 15:40:03,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:03,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:09,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889252874] [2024-06-14 15:40:09,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889252874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:09,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:09,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:40:09,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194666366] [2024-06-14 15:40:09,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:09,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:40:09,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:09,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:40:09,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:40:09,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:40:09,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 83 transitions, 644 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:09,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:09,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:40:09,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:10,298 INFO L124 PetriNetUnfolderBase]: 281/501 cut-off events. [2024-06-14 15:40:10,299 INFO L125 PetriNetUnfolderBase]: For 11920/11920 co-relation queries the response was YES. [2024-06-14 15:40:10,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2784 conditions, 501 events. 281/501 cut-off events. For 11920/11920 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1926 event pairs, 50 based on Foata normal form. 1/500 useless extension candidates. Maximal degree in co-relation 2734. Up to 422 conditions per place. [2024-06-14 15:40:10,305 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 66 selfloop transitions, 28 changer transitions 0/96 dead transitions. [2024-06-14 15:40:10,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 96 transitions, 876 flow [2024-06-14 15:40:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:40:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:40:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 15:40:10,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38671875 [2024-06-14 15:40:10,306 INFO L175 Difference]: Start difference. First operand has 99 places, 83 transitions, 644 flow. Second operand 8 states and 99 transitions. [2024-06-14 15:40:10,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 96 transitions, 876 flow [2024-06-14 15:40:10,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 96 transitions, 821 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 15:40:10,318 INFO L231 Difference]: Finished difference. Result has 100 places, 85 transitions, 672 flow [2024-06-14 15:40:10,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=672, PETRI_PLACES=100, PETRI_TRANSITIONS=85} [2024-06-14 15:40:10,318 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 69 predicate places. [2024-06-14 15:40:10,318 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 85 transitions, 672 flow [2024-06-14 15:40:10,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:10,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:10,319 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:40:10,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:40:10,319 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:40:10,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:10,319 INFO L85 PathProgramCache]: Analyzing trace with hash -227583720, now seen corresponding path program 3 times [2024-06-14 15:40:10,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:10,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012159288] [2024-06-14 15:40:10,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:10,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:16,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:16,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012159288] [2024-06-14 15:40:16,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012159288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:16,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:16,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:40:16,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435670405] [2024-06-14 15:40:16,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:16,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:40:16,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:16,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:40:16,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:40:16,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 15:40:16,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 85 transitions, 672 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:16,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:16,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 15:40:16,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:16,726 INFO L124 PetriNetUnfolderBase]: 268/486 cut-off events. [2024-06-14 15:40:16,726 INFO L125 PetriNetUnfolderBase]: For 12591/12591 co-relation queries the response was YES. [2024-06-14 15:40:16,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 486 events. 268/486 cut-off events. For 12591/12591 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1886 event pairs, 50 based on Foata normal form. 2/486 useless extension candidates. Maximal degree in co-relation 2654. Up to 402 conditions per place. [2024-06-14 15:40:16,730 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 67 selfloop transitions, 16 changer transitions 0/97 dead transitions. [2024-06-14 15:40:16,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 97 transitions, 866 flow [2024-06-14 15:40:16,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:40:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:40:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-14 15:40:16,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-14 15:40:16,731 INFO L175 Difference]: Start difference. First operand has 100 places, 85 transitions, 672 flow. Second operand 8 states and 102 transitions. [2024-06-14 15:40:16,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 97 transitions, 866 flow [2024-06-14 15:40:16,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 97 transitions, 801 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:40:16,743 INFO L231 Difference]: Finished difference. Result has 102 places, 85 transitions, 643 flow [2024-06-14 15:40:16,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=643, PETRI_PLACES=102, PETRI_TRANSITIONS=85} [2024-06-14 15:40:16,744 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 71 predicate places. [2024-06-14 15:40:16,744 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 85 transitions, 643 flow [2024-06-14 15:40:16,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:16,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:16,745 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:40:16,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:40:16,745 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:40:16,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:16,745 INFO L85 PathProgramCache]: Analyzing trace with hash -571542154, now seen corresponding path program 4 times [2024-06-14 15:40:16,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:16,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194628317] [2024-06-14 15:40:16,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:16,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:23,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:23,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194628317] [2024-06-14 15:40:23,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194628317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:23,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:23,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:40:23,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505378289] [2024-06-14 15:40:23,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:23,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:40:23,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:23,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:40:23,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:40:23,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:40:23,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 85 transitions, 643 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:23,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:23,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:40:23,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:23,758 INFO L124 PetriNetUnfolderBase]: 281/501 cut-off events. [2024-06-14 15:40:23,759 INFO L125 PetriNetUnfolderBase]: For 12950/12950 co-relation queries the response was YES. [2024-06-14 15:40:23,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2786 conditions, 501 events. 281/501 cut-off events. For 12950/12950 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1916 event pairs, 49 based on Foata normal form. 1/500 useless extension candidates. Maximal degree in co-relation 2734. Up to 408 conditions per place. [2024-06-14 15:40:23,762 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 71 selfloop transitions, 32 changer transitions 0/105 dead transitions. [2024-06-14 15:40:23,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 105 transitions, 971 flow [2024-06-14 15:40:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:40:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:40:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-14 15:40:23,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2024-06-14 15:40:23,765 INFO L175 Difference]: Start difference. First operand has 102 places, 85 transitions, 643 flow. Second operand 8 states and 107 transitions. [2024-06-14 15:40:23,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 105 transitions, 971 flow [2024-06-14 15:40:23,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 930 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 15:40:23,777 INFO L231 Difference]: Finished difference. Result has 103 places, 87 transitions, 693 flow [2024-06-14 15:40:23,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=693, PETRI_PLACES=103, PETRI_TRANSITIONS=87} [2024-06-14 15:40:23,779 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-14 15:40:23,780 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 87 transitions, 693 flow [2024-06-14 15:40:23,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:23,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:23,780 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:40:23,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:40:23,780 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:40:23,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:23,781 INFO L85 PathProgramCache]: Analyzing trace with hash -223110296, now seen corresponding path program 5 times [2024-06-14 15:40:23,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:23,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271529774] [2024-06-14 15:40:23,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:23,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:29,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:29,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271529774] [2024-06-14 15:40:29,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271529774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:29,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:29,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:40:29,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230571095] [2024-06-14 15:40:29,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:29,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:40:29,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:29,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:40:29,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:40:29,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:40:29,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 87 transitions, 693 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:29,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:29,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:40:29,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:29,990 INFO L124 PetriNetUnfolderBase]: 284/506 cut-off events. [2024-06-14 15:40:29,990 INFO L125 PetriNetUnfolderBase]: For 13853/13853 co-relation queries the response was YES. [2024-06-14 15:40:29,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 506 events. 284/506 cut-off events. For 13853/13853 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1936 event pairs, 48 based on Foata normal form. 1/505 useless extension candidates. Maximal degree in co-relation 2824. Up to 433 conditions per place. [2024-06-14 15:40:29,993 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 73 selfloop transitions, 29 changer transitions 0/104 dead transitions. [2024-06-14 15:40:29,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 104 transitions, 959 flow [2024-06-14 15:40:29,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:40:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:40:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-14 15:40:29,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3784722222222222 [2024-06-14 15:40:29,994 INFO L175 Difference]: Start difference. First operand has 103 places, 87 transitions, 693 flow. Second operand 9 states and 109 transitions. [2024-06-14 15:40:29,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 104 transitions, 959 flow [2024-06-14 15:40:30,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 104 transitions, 872 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:40:30,007 INFO L231 Difference]: Finished difference. Result has 106 places, 89 transitions, 699 flow [2024-06-14 15:40:30,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=699, PETRI_PLACES=106, PETRI_TRANSITIONS=89} [2024-06-14 15:40:30,007 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 75 predicate places. [2024-06-14 15:40:30,007 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 89 transitions, 699 flow [2024-06-14 15:40:30,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:30,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:30,008 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:40:30,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:40:30,008 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:40:30,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:30,008 INFO L85 PathProgramCache]: Analyzing trace with hash -222937316, now seen corresponding path program 6 times [2024-06-14 15:40:30,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:30,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110002416] [2024-06-14 15:40:30,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:30,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:35,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:35,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110002416] [2024-06-14 15:40:35,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110002416] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:35,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:35,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:40:35,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018388231] [2024-06-14 15:40:35,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:35,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:40:35,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:35,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:40:35,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:40:35,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:40:35,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 89 transitions, 699 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:35,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:35,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:40:35,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:36,263 INFO L124 PetriNetUnfolderBase]: 287/511 cut-off events. [2024-06-14 15:40:36,263 INFO L125 PetriNetUnfolderBase]: For 14810/14810 co-relation queries the response was YES. [2024-06-14 15:40:36,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2918 conditions, 511 events. 287/511 cut-off events. For 14810/14810 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1980 event pairs, 48 based on Foata normal form. 1/510 useless extension candidates. Maximal degree in co-relation 2864. Up to 438 conditions per place. [2024-06-14 15:40:36,266 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 75 selfloop transitions, 26 changer transitions 0/103 dead transitions. [2024-06-14 15:40:36,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 103 transitions, 955 flow [2024-06-14 15:40:36,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:40:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:40:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-14 15:40:36,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 15:40:36,267 INFO L175 Difference]: Start difference. First operand has 106 places, 89 transitions, 699 flow. Second operand 9 states and 105 transitions. [2024-06-14 15:40:36,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 103 transitions, 955 flow [2024-06-14 15:40:36,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 103 transitions, 886 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:40:36,280 INFO L231 Difference]: Finished difference. Result has 108 places, 91 transitions, 717 flow [2024-06-14 15:40:36,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=717, PETRI_PLACES=108, PETRI_TRANSITIONS=91} [2024-06-14 15:40:36,280 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 77 predicate places. [2024-06-14 15:40:36,280 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 91 transitions, 717 flow [2024-06-14 15:40:36,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:36,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:36,281 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:40:36,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:40:36,281 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:40:36,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:36,281 INFO L85 PathProgramCache]: Analyzing trace with hash -223110110, now seen corresponding path program 1 times [2024-06-14 15:40:36,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:36,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571905118] [2024-06-14 15:40:36,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:36,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:41,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:41,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571905118] [2024-06-14 15:40:41,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571905118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:41,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:41,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:40:41,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544014298] [2024-06-14 15:40:41,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:41,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:40:41,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:41,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:40:41,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:40:41,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:40:41,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 91 transitions, 717 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:41,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:41,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:40:41,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:42,056 INFO L124 PetriNetUnfolderBase]: 296/526 cut-off events. [2024-06-14 15:40:42,056 INFO L125 PetriNetUnfolderBase]: For 16811/16811 co-relation queries the response was YES. [2024-06-14 15:40:42,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2995 conditions, 526 events. 296/526 cut-off events. For 16811/16811 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2055 event pairs, 48 based on Foata normal form. 3/527 useless extension candidates. Maximal degree in co-relation 2940. Up to 359 conditions per place. [2024-06-14 15:40:42,060 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 77 selfloop transitions, 36 changer transitions 0/115 dead transitions. [2024-06-14 15:40:42,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 1079 flow [2024-06-14 15:40:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:40:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:40:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 15:40:42,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2024-06-14 15:40:42,061 INFO L175 Difference]: Start difference. First operand has 108 places, 91 transitions, 717 flow. Second operand 9 states and 119 transitions. [2024-06-14 15:40:42,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 1079 flow [2024-06-14 15:40:42,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 115 transitions, 1012 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 15:40:42,078 INFO L231 Difference]: Finished difference. Result has 110 places, 93 transitions, 745 flow [2024-06-14 15:40:42,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=745, PETRI_PLACES=110, PETRI_TRANSITIONS=93} [2024-06-14 15:40:42,078 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 79 predicate places. [2024-06-14 15:40:42,078 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 93 transitions, 745 flow [2024-06-14 15:40:42,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:42,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:42,079 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:40:42,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:40:42,079 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:40:42,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:42,079 INFO L85 PathProgramCache]: Analyzing trace with hash -222937130, now seen corresponding path program 2 times [2024-06-14 15:40:42,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:42,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913773972] [2024-06-14 15:40:42,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:47,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:47,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913773972] [2024-06-14 15:40:47,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913773972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:47,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:47,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:40:47,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110152337] [2024-06-14 15:40:47,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:47,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:40:47,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:47,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:40:47,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:40:47,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:40:47,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 93 transitions, 745 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:47,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:47,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:40:47,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:47,824 INFO L124 PetriNetUnfolderBase]: 320/565 cut-off events. [2024-06-14 15:40:47,825 INFO L125 PetriNetUnfolderBase]: For 19529/19529 co-relation queries the response was YES. [2024-06-14 15:40:47,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3326 conditions, 565 events. 320/565 cut-off events. For 19529/19529 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2257 event pairs, 48 based on Foata normal form. 3/566 useless extension candidates. Maximal degree in co-relation 3270. Up to 379 conditions per place. [2024-06-14 15:40:47,828 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 82 selfloop transitions, 35 changer transitions 0/119 dead transitions. [2024-06-14 15:40:47,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 119 transitions, 1207 flow [2024-06-14 15:40:47,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:40:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:40:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 15:40:47,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2024-06-14 15:40:47,829 INFO L175 Difference]: Start difference. First operand has 110 places, 93 transitions, 745 flow. Second operand 9 states and 119 transitions. [2024-06-14 15:40:47,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 119 transitions, 1207 flow [2024-06-14 15:40:47,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 119 transitions, 1117 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:40:47,847 INFO L231 Difference]: Finished difference. Result has 112 places, 97 transitions, 774 flow [2024-06-14 15:40:47,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=774, PETRI_PLACES=112, PETRI_TRANSITIONS=97} [2024-06-14 15:40:47,847 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 81 predicate places. [2024-06-14 15:40:47,847 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 97 transitions, 774 flow [2024-06-14 15:40:47,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:47,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:47,848 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:40:47,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:40:47,848 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:40:47,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash -222930620, now seen corresponding path program 3 times [2024-06-14 15:40:47,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:47,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396337823] [2024-06-14 15:40:47,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:47,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:53,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:53,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396337823] [2024-06-14 15:40:53,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396337823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:53,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:53,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:40:53,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176622079] [2024-06-14 15:40:53,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:53,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:40:53,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:53,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:40:53,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:40:53,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:40:53,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 97 transitions, 774 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:53,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:53,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:40:53,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:53,459 INFO L124 PetriNetUnfolderBase]: 314/556 cut-off events. [2024-06-14 15:40:53,460 INFO L125 PetriNetUnfolderBase]: For 18963/18963 co-relation queries the response was YES. [2024-06-14 15:40:53,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3223 conditions, 556 events. 314/556 cut-off events. For 18963/18963 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2217 event pairs, 52 based on Foata normal form. 3/557 useless extension candidates. Maximal degree in co-relation 3166. Up to 375 conditions per place. [2024-06-14 15:40:53,463 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 78 selfloop transitions, 36 changer transitions 0/116 dead transitions. [2024-06-14 15:40:53,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 116 transitions, 1116 flow [2024-06-14 15:40:53,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:40:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:40:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-14 15:40:53,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3993055555555556 [2024-06-14 15:40:53,465 INFO L175 Difference]: Start difference. First operand has 112 places, 97 transitions, 774 flow. Second operand 9 states and 115 transitions. [2024-06-14 15:40:53,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 116 transitions, 1116 flow [2024-06-14 15:40:53,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 116 transitions, 1053 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 15:40:53,485 INFO L231 Difference]: Finished difference. Result has 116 places, 97 transitions, 789 flow [2024-06-14 15:40:53,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=789, PETRI_PLACES=116, PETRI_TRANSITIONS=97} [2024-06-14 15:40:53,486 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2024-06-14 15:40:53,486 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 97 transitions, 789 flow [2024-06-14 15:40:53,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:53,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:53,486 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:40:53,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:40:53,487 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:40:53,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:53,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1648893730, now seen corresponding path program 4 times [2024-06-14 15:40:53,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:53,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43444929] [2024-06-14 15:40:53,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:53,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:58,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:58,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43444929] [2024-06-14 15:40:58,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43444929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:58,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:58,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:40:58,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841719460] [2024-06-14 15:40:58,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:58,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:40:58,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:58,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:40:58,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:40:58,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:40:58,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 97 transitions, 789 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:58,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:58,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:40:58,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:59,174 INFO L124 PetriNetUnfolderBase]: 323/571 cut-off events. [2024-06-14 15:40:59,175 INFO L125 PetriNetUnfolderBase]: For 20216/20216 co-relation queries the response was YES. [2024-06-14 15:40:59,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3336 conditions, 571 events. 323/571 cut-off events. For 20216/20216 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2301 event pairs, 52 based on Foata normal form. 3/572 useless extension candidates. Maximal degree in co-relation 3278. Up to 531 conditions per place. [2024-06-14 15:40:59,178 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 96 selfloop transitions, 13 changer transitions 0/111 dead transitions. [2024-06-14 15:40:59,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 111 transitions, 1061 flow [2024-06-14 15:40:59,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:40:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:40:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-14 15:40:59,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2024-06-14 15:40:59,184 INFO L175 Difference]: Start difference. First operand has 116 places, 97 transitions, 789 flow. Second operand 8 states and 93 transitions. [2024-06-14 15:40:59,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 111 transitions, 1061 flow [2024-06-14 15:40:59,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 111 transitions, 979 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-14 15:40:59,206 INFO L231 Difference]: Finished difference. Result has 116 places, 99 transitions, 766 flow [2024-06-14 15:40:59,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=766, PETRI_PLACES=116, PETRI_TRANSITIONS=99} [2024-06-14 15:40:59,206 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2024-06-14 15:40:59,207 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 99 transitions, 766 flow [2024-06-14 15:40:59,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:40:59,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:59,207 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:40:59,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:40:59,207 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:40:59,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1649190648, now seen corresponding path program 1 times [2024-06-14 15:40:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:59,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868428481] [2024-06-14 15:40:59,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:59,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:04,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:04,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868428481] [2024-06-14 15:41:04,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868428481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:04,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:04,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:41:04,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158953596] [2024-06-14 15:41:04,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:04,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:41:04,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:04,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:41:04,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:41:04,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:41:04,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 99 transitions, 766 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:41:04,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:04,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:41:04,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:04,923 INFO L124 PetriNetUnfolderBase]: 319/565 cut-off events. [2024-06-14 15:41:04,924 INFO L125 PetriNetUnfolderBase]: For 19496/19496 co-relation queries the response was YES. [2024-06-14 15:41:04,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3189 conditions, 565 events. 319/565 cut-off events. For 19496/19496 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2265 event pairs, 47 based on Foata normal form. 2/565 useless extension candidates. Maximal degree in co-relation 3130. Up to 533 conditions per place. [2024-06-14 15:41:04,927 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 96 selfloop transitions, 14 changer transitions 0/112 dead transitions. [2024-06-14 15:41:04,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 112 transitions, 1034 flow [2024-06-14 15:41:04,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:41:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:41:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-14 15:41:04,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:41:04,930 INFO L175 Difference]: Start difference. First operand has 116 places, 99 transitions, 766 flow. Second operand 9 states and 99 transitions. [2024-06-14 15:41:04,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 112 transitions, 1034 flow [2024-06-14 15:41:04,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 112 transitions, 1001 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 15:41:04,952 INFO L231 Difference]: Finished difference. Result has 119 places, 101 transitions, 794 flow [2024-06-14 15:41:04,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=794, PETRI_PLACES=119, PETRI_TRANSITIONS=101} [2024-06-14 15:41:04,953 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2024-06-14 15:41:04,953 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 101 transitions, 794 flow [2024-06-14 15:41:04,953 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:41:04,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:04,953 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:41:04,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:41:04,953 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:41:04,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:04,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1570337286, now seen corresponding path program 7 times [2024-06-14 15:41:04,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:04,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684508771] [2024-06-14 15:41:04,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:04,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:10,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:10,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684508771] [2024-06-14 15:41:10,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684508771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:10,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:10,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:41:10,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313293540] [2024-06-14 15:41:10,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:10,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:41:10,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:10,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:41:10,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:41:10,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:41:10,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 101 transitions, 794 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:41:10,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:10,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:41:10,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:11,134 INFO L124 PetriNetUnfolderBase]: 317/562 cut-off events. [2024-06-14 15:41:11,134 INFO L125 PetriNetUnfolderBase]: For 19192/19192 co-relation queries the response was YES. [2024-06-14 15:41:11,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3178 conditions, 562 events. 317/562 cut-off events. For 19192/19192 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2244 event pairs, 53 based on Foata normal form. 1/561 useless extension candidates. Maximal degree in co-relation 3118. Up to 538 conditions per place. [2024-06-14 15:41:11,137 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 94 selfloop transitions, 13 changer transitions 0/109 dead transitions. [2024-06-14 15:41:11,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 109 transitions, 1026 flow [2024-06-14 15:41:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:41:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:41:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-14 15:41:11,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-14 15:41:11,140 INFO L175 Difference]: Start difference. First operand has 119 places, 101 transitions, 794 flow. Second operand 8 states and 89 transitions. [2024-06-14 15:41:11,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 109 transitions, 1026 flow [2024-06-14 15:41:11,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 109 transitions, 968 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 15:41:11,164 INFO L231 Difference]: Finished difference. Result has 120 places, 101 transitions, 767 flow [2024-06-14 15:41:11,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=767, PETRI_PLACES=120, PETRI_TRANSITIONS=101} [2024-06-14 15:41:11,165 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 89 predicate places. [2024-06-14 15:41:11,165 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 101 transitions, 767 flow [2024-06-14 15:41:11,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:41:11,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:11,166 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:41:11,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:41:11,166 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:41:11,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:11,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1640613010, now seen corresponding path program 5 times [2024-06-14 15:41:11,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:11,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075976212] [2024-06-14 15:41:11,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:11,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:16,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:16,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075976212] [2024-06-14 15:41:16,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075976212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:16,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:16,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:41:16,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248816461] [2024-06-14 15:41:16,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:16,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:41:16,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:16,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:41:16,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:41:16,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:41:16,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 101 transitions, 767 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:41:16,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:16,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:41:16,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:17,151 INFO L124 PetriNetUnfolderBase]: 326/577 cut-off events. [2024-06-14 15:41:17,151 INFO L125 PetriNetUnfolderBase]: For 21806/21806 co-relation queries the response was YES. [2024-06-14 15:41:17,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 577 events. 326/577 cut-off events. For 21806/21806 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2353 event pairs, 47 based on Foata normal form. 3/578 useless extension candidates. Maximal degree in co-relation 3160. Up to 495 conditions per place. [2024-06-14 15:41:17,170 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 95 selfloop transitions, 21 changer transitions 0/118 dead transitions. [2024-06-14 15:41:17,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 118 transitions, 1135 flow [2024-06-14 15:41:17,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:41:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:41:17,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 15:41:17,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38671875 [2024-06-14 15:41:17,185 INFO L175 Difference]: Start difference. First operand has 120 places, 101 transitions, 767 flow. Second operand 8 states and 99 transitions. [2024-06-14 15:41:17,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 118 transitions, 1135 flow [2024-06-14 15:41:17,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 118 transitions, 1076 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 15:41:17,210 INFO L231 Difference]: Finished difference. Result has 120 places, 103 transitions, 779 flow [2024-06-14 15:41:17,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=779, PETRI_PLACES=120, PETRI_TRANSITIONS=103} [2024-06-14 15:41:17,211 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 89 predicate places. [2024-06-14 15:41:17,211 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 103 transitions, 779 flow [2024-06-14 15:41:17,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:41:17,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:17,211 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:41:17,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:41:17,211 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:41:17,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1640619520, now seen corresponding path program 6 times [2024-06-14 15:41:17,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:17,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047745336] [2024-06-14 15:41:17,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:22,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:22,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047745336] [2024-06-14 15:41:22,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047745336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:22,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:22,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:41:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688658662] [2024-06-14 15:41:22,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:22,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:41:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:22,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:41:22,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:41:22,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:41:22,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 103 transitions, 779 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:41:22,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:22,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:41:22,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:22,921 INFO L124 PetriNetUnfolderBase]: 320/568 cut-off events. [2024-06-14 15:41:22,922 INFO L125 PetriNetUnfolderBase]: For 20839/20839 co-relation queries the response was YES. [2024-06-14 15:41:22,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3095 conditions, 568 events. 320/568 cut-off events. For 20839/20839 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2303 event pairs, 51 based on Foata normal form. 3/569 useless extension candidates. Maximal degree in co-relation 3034. Up to 491 conditions per place. [2024-06-14 15:41:22,925 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 95 selfloop transitions, 20 changer transitions 0/117 dead transitions. [2024-06-14 15:41:22,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 117 transitions, 1045 flow [2024-06-14 15:41:22,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:41:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:41:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 15:41:22,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38671875 [2024-06-14 15:41:22,927 INFO L175 Difference]: Start difference. First operand has 120 places, 103 transitions, 779 flow. Second operand 8 states and 99 transitions. [2024-06-14 15:41:22,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 117 transitions, 1045 flow [2024-06-14 15:41:22,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 117 transitions, 950 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 15:41:22,951 INFO L231 Difference]: Finished difference. Result has 121 places, 103 transitions, 729 flow [2024-06-14 15:41:22,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=729, PETRI_PLACES=121, PETRI_TRANSITIONS=103} [2024-06-14 15:41:22,951 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 90 predicate places. [2024-06-14 15:41:22,952 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 103 transitions, 729 flow [2024-06-14 15:41:22,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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:41:22,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:22,952 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:41:22,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:41:22,952 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:41:22,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1649201560, now seen corresponding path program 1 times [2024-06-14 15:41:22,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:22,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458526317] [2024-06-14 15:41:22,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:22,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:30,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:30,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458526317] [2024-06-14 15:41:30,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458526317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:30,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:30,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:41:30,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177827835] [2024-06-14 15:41:30,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:30,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:41:30,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:30,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:41:30,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:41:30,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:41:30,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 103 transitions, 729 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:30,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:30,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:41:30,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:30,645 INFO L124 PetriNetUnfolderBase]: 317/563 cut-off events. [2024-06-14 15:41:30,645 INFO L125 PetriNetUnfolderBase]: For 19527/19527 co-relation queries the response was YES. [2024-06-14 15:41:30,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2963 conditions, 563 events. 317/563 cut-off events. For 19527/19527 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2253 event pairs, 48 based on Foata normal form. 2/563 useless extension candidates. Maximal degree in co-relation 2901. Up to 533 conditions per place. [2024-06-14 15:41:30,649 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 99 selfloop transitions, 13 changer transitions 0/114 dead transitions. [2024-06-14 15:41:30,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 114 transitions, 977 flow [2024-06-14 15:41:30,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:41:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:41:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 15:41:30,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-14 15:41:30,661 INFO L175 Difference]: Start difference. First operand has 121 places, 103 transitions, 729 flow. Second operand 9 states and 97 transitions. [2024-06-14 15:41:30,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 114 transitions, 977 flow [2024-06-14 15:41:30,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 114 transitions, 925 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 15:41:30,686 INFO L231 Difference]: Finished difference. Result has 123 places, 103 transitions, 707 flow [2024-06-14 15:41:30,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=707, PETRI_PLACES=123, PETRI_TRANSITIONS=103} [2024-06-14 15:41:30,687 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 92 predicate places. [2024-06-14 15:41:30,687 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 103 transitions, 707 flow [2024-06-14 15:41:30,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:30,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:30,687 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:41:30,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:41:30,687 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:41:30,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:30,687 INFO L85 PathProgramCache]: Analyzing trace with hash 94434790, now seen corresponding path program 1 times [2024-06-14 15:41:30,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:30,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601158310] [2024-06-14 15:41:30,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:36,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:36,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601158310] [2024-06-14 15:41:36,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601158310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:36,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:36,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:41:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037462299] [2024-06-14 15:41:36,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:36,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:41:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:36,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:41:36,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:41:36,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:41:36,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 103 transitions, 707 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:36,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:36,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:41:36,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:36,793 INFO L124 PetriNetUnfolderBase]: 321/571 cut-off events. [2024-06-14 15:41:36,793 INFO L125 PetriNetUnfolderBase]: For 20437/20437 co-relation queries the response was YES. [2024-06-14 15:41:36,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2971 conditions, 571 events. 321/571 cut-off events. For 20437/20437 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2320 event pairs, 33 based on Foata normal form. 2/571 useless extension candidates. Maximal degree in co-relation 2908. Up to 377 conditions per place. [2024-06-14 15:41:36,797 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 82 selfloop transitions, 40 changer transitions 0/124 dead transitions. [2024-06-14 15:41:36,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 124 transitions, 1085 flow [2024-06-14 15:41:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:41:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:41:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 15:41:36,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 15:41:36,798 INFO L175 Difference]: Start difference. First operand has 123 places, 103 transitions, 707 flow. Second operand 10 states and 118 transitions. [2024-06-14 15:41:36,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 124 transitions, 1085 flow [2024-06-14 15:41:36,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 124 transitions, 1049 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 15:41:36,825 INFO L231 Difference]: Finished difference. Result has 125 places, 104 transitions, 763 flow [2024-06-14 15:41:36,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=763, PETRI_PLACES=125, PETRI_TRANSITIONS=104} [2024-06-14 15:41:36,825 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 94 predicate places. [2024-06-14 15:41:36,825 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 104 transitions, 763 flow [2024-06-14 15:41:36,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:36,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:36,826 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:41:36,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:41:36,826 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:41:36,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1523338263, now seen corresponding path program 1 times [2024-06-14 15:41:36,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:36,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742468598] [2024-06-14 15:41:36,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:36,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:43,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:43,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742468598] [2024-06-14 15:41:43,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742468598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:43,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:43,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:41:43,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415686802] [2024-06-14 15:41:43,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:43,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:41:43,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:43,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:41:43,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:41:43,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:41:43,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 104 transitions, 763 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:43,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:43,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:41:43,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:43,731 INFO L124 PetriNetUnfolderBase]: 324/576 cut-off events. [2024-06-14 15:41:43,732 INFO L125 PetriNetUnfolderBase]: For 20537/20537 co-relation queries the response was YES. [2024-06-14 15:41:43,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3063 conditions, 576 events. 324/576 cut-off events. For 20537/20537 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2375 event pairs, 41 based on Foata normal form. 1/575 useless extension candidates. Maximal degree in co-relation 3000. Up to 398 conditions per place. [2024-06-14 15:41:43,762 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 96 selfloop transitions, 39 changer transitions 0/137 dead transitions. [2024-06-14 15:41:43,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 137 transitions, 1238 flow [2024-06-14 15:41:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:41:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:41:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 15:41:43,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-14 15:41:43,764 INFO L175 Difference]: Start difference. First operand has 125 places, 104 transitions, 763 flow. Second operand 10 states and 122 transitions. [2024-06-14 15:41:43,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 137 transitions, 1238 flow [2024-06-14 15:41:43,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 137 transitions, 1162 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:41:43,817 INFO L231 Difference]: Finished difference. Result has 129 places, 116 transitions, 865 flow [2024-06-14 15:41:43,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=865, PETRI_PLACES=129, PETRI_TRANSITIONS=116} [2024-06-14 15:41:43,818 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 98 predicate places. [2024-06-14 15:41:43,818 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 116 transitions, 865 flow [2024-06-14 15:41:43,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:43,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:43,819 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:41:43,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:41:43,819 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:41:43,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:43,819 INFO L85 PathProgramCache]: Analyzing trace with hash 96308740, now seen corresponding path program 2 times [2024-06-14 15:41:43,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:43,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39107374] [2024-06-14 15:41:43,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:43,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:50,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:50,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39107374] [2024-06-14 15:41:50,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39107374] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:50,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:50,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:41:50,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981205053] [2024-06-14 15:41:50,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:50,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:41:50,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:50,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:41:50,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:41:50,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:41:50,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 116 transitions, 865 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:50,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:50,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:41:50,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:50,616 INFO L124 PetriNetUnfolderBase]: 335/597 cut-off events. [2024-06-14 15:41:50,616 INFO L125 PetriNetUnfolderBase]: For 24322/24322 co-relation queries the response was YES. [2024-06-14 15:41:50,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3340 conditions, 597 events. 335/597 cut-off events. For 24322/24322 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2501 event pairs, 52 based on Foata normal form. 2/597 useless extension candidates. Maximal degree in co-relation 3275. Up to 465 conditions per place. [2024-06-14 15:41:50,620 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 95 selfloop transitions, 40 changer transitions 0/137 dead transitions. [2024-06-14 15:41:50,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 137 transitions, 1273 flow [2024-06-14 15:41:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:41:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:41:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 15:41:50,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-14 15:41:50,623 INFO L175 Difference]: Start difference. First operand has 129 places, 116 transitions, 865 flow. Second operand 10 states and 121 transitions. [2024-06-14 15:41:50,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 137 transitions, 1273 flow [2024-06-14 15:41:50,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 137 transitions, 1223 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:41:50,659 INFO L231 Difference]: Finished difference. Result has 132 places, 118 transitions, 911 flow [2024-06-14 15:41:50,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=911, PETRI_PLACES=132, PETRI_TRANSITIONS=118} [2024-06-14 15:41:50,660 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-06-14 15:41:50,660 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 118 transitions, 911 flow [2024-06-14 15:41:50,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:50,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:50,660 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:41:50,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:41:50,661 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:41:50,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:50,661 INFO L85 PathProgramCache]: Analyzing trace with hash 96312460, now seen corresponding path program 3 times [2024-06-14 15:41:50,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:50,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013321148] [2024-06-14 15:41:50,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:50,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:57,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:57,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013321148] [2024-06-14 15:41:57,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013321148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:57,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:57,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:41:57,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713050822] [2024-06-14 15:41:57,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:57,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:41:57,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:57,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:41:57,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:41:57,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:41:57,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 118 transitions, 911 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:57,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:57,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:41:57,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:57,623 INFO L124 PetriNetUnfolderBase]: 332/592 cut-off events. [2024-06-14 15:41:57,624 INFO L125 PetriNetUnfolderBase]: For 23651/23651 co-relation queries the response was YES. [2024-06-14 15:41:57,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3268 conditions, 592 events. 332/592 cut-off events. For 23651/23651 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2462 event pairs, 53 based on Foata normal form. 2/592 useless extension candidates. Maximal degree in co-relation 3203. Up to 477 conditions per place. [2024-06-14 15:41:57,627 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 94 selfloop transitions, 39 changer transitions 0/135 dead transitions. [2024-06-14 15:41:57,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 135 transitions, 1217 flow [2024-06-14 15:41:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:41:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:41:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 15:41:57,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 15:41:57,640 INFO L175 Difference]: Start difference. First operand has 132 places, 118 transitions, 911 flow. Second operand 10 states and 118 transitions. [2024-06-14 15:41:57,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 135 transitions, 1217 flow [2024-06-14 15:41:57,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 1164 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 15:41:57,675 INFO L231 Difference]: Finished difference. Result has 136 places, 118 transitions, 940 flow [2024-06-14 15:41:57,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=940, PETRI_PLACES=136, PETRI_TRANSITIONS=118} [2024-06-14 15:41:57,676 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 105 predicate places. [2024-06-14 15:41:57,676 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 118 transitions, 940 flow [2024-06-14 15:41:57,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:57,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:57,676 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:41:57,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:41:57,676 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:41:57,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:57,677 INFO L85 PathProgramCache]: Analyzing trace with hash 183154155, now seen corresponding path program 2 times [2024-06-14 15:41:57,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:57,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295919494] [2024-06-14 15:41:57,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:57,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:03,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:03,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295919494] [2024-06-14 15:42:03,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295919494] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:03,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:03,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:42:03,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498344988] [2024-06-14 15:42:03,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:03,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:42:03,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:03,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:42:03,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:42:03,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:42:03,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 118 transitions, 940 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:03,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:03,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:42:03,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:04,003 INFO L124 PetriNetUnfolderBase]: 335/597 cut-off events. [2024-06-14 15:42:04,003 INFO L125 PetriNetUnfolderBase]: For 23759/23759 co-relation queries the response was YES. [2024-06-14 15:42:04,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3368 conditions, 597 events. 335/597 cut-off events. For 23759/23759 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2520 event pairs, 41 based on Foata normal form. 1/596 useless extension candidates. Maximal degree in co-relation 3301. Up to 486 conditions per place. [2024-06-14 15:42:04,007 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 104 selfloop transitions, 32 changer transitions 0/138 dead transitions. [2024-06-14 15:42:04,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 138 transitions, 1283 flow [2024-06-14 15:42:04,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:42:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:42:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 15:42:04,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 15:42:04,008 INFO L175 Difference]: Start difference. First operand has 136 places, 118 transitions, 940 flow. Second operand 10 states and 118 transitions. [2024-06-14 15:42:04,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 138 transitions, 1283 flow [2024-06-14 15:42:04,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 1203 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-14 15:42:04,041 INFO L231 Difference]: Finished difference. Result has 138 places, 122 transitions, 962 flow [2024-06-14 15:42:04,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=962, PETRI_PLACES=138, PETRI_TRANSITIONS=122} [2024-06-14 15:42:04,041 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 107 predicate places. [2024-06-14 15:42:04,041 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 122 transitions, 962 flow [2024-06-14 15:42:04,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:04,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:04,042 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:42:04,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:42:04,042 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:42:04,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:04,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1900509865, now seen corresponding path program 3 times [2024-06-14 15:42:04,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:04,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989326168] [2024-06-14 15:42:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:04,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:10,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:10,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989326168] [2024-06-14 15:42:10,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989326168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:10,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:10,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:42:10,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230944467] [2024-06-14 15:42:10,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:10,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:42:10,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:10,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:42:10,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:42:11,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:42:11,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 122 transitions, 962 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:11,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:11,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:42:11,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:11,340 INFO L124 PetriNetUnfolderBase]: 338/602 cut-off events. [2024-06-14 15:42:11,340 INFO L125 PetriNetUnfolderBase]: For 24847/24847 co-relation queries the response was YES. [2024-06-14 15:42:11,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3434 conditions, 602 events. 338/602 cut-off events. For 24847/24847 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2537 event pairs, 41 based on Foata normal form. 1/601 useless extension candidates. Maximal degree in co-relation 3365. Up to 485 conditions per place. [2024-06-14 15:42:11,344 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 103 selfloop transitions, 35 changer transitions 0/140 dead transitions. [2024-06-14 15:42:11,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 140 transitions, 1302 flow [2024-06-14 15:42:11,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:42:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:42:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-14 15:42:11,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371875 [2024-06-14 15:42:11,346 INFO L175 Difference]: Start difference. First operand has 138 places, 122 transitions, 962 flow. Second operand 10 states and 119 transitions. [2024-06-14 15:42:11,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 140 transitions, 1302 flow [2024-06-14 15:42:11,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 140 transitions, 1242 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 15:42:11,385 INFO L231 Difference]: Finished difference. Result has 141 places, 124 transitions, 997 flow [2024-06-14 15:42:11,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=997, PETRI_PLACES=141, PETRI_TRANSITIONS=124} [2024-06-14 15:42:11,386 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 110 predicate places. [2024-06-14 15:42:11,386 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 124 transitions, 997 flow [2024-06-14 15:42:11,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:11,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:11,386 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:42:11,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:42:11,387 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:42:11,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:11,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1900510020, now seen corresponding path program 4 times [2024-06-14 15:42:11,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:11,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005731116] [2024-06-14 15:42:11,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:11,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:17,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:17,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005731116] [2024-06-14 15:42:17,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005731116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:17,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:17,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:42:17,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583779931] [2024-06-14 15:42:17,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:17,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:42:17,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:17,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:42:17,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:42:17,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:42:17,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 124 transitions, 997 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:17,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:17,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:42:17,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:17,785 INFO L124 PetriNetUnfolderBase]: 342/610 cut-off events. [2024-06-14 15:42:17,785 INFO L125 PetriNetUnfolderBase]: For 26966/26966 co-relation queries the response was YES. [2024-06-14 15:42:17,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 610 events. 342/610 cut-off events. For 26966/26966 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2556 event pairs, 53 based on Foata normal form. 2/610 useless extension candidates. Maximal degree in co-relation 3434. Up to 531 conditions per place. [2024-06-14 15:42:17,790 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 110 selfloop transitions, 27 changer transitions 0/139 dead transitions. [2024-06-14 15:42:17,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 139 transitions, 1310 flow [2024-06-14 15:42:17,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:42:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:42:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 15:42:17,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:42:17,792 INFO L175 Difference]: Start difference. First operand has 141 places, 124 transitions, 997 flow. Second operand 10 states and 115 transitions. [2024-06-14 15:42:17,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 139 transitions, 1310 flow [2024-06-14 15:42:17,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 139 transitions, 1235 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 15:42:17,835 INFO L231 Difference]: Finished difference. Result has 143 places, 125 transitions, 989 flow [2024-06-14 15:42:17,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=989, PETRI_PLACES=143, PETRI_TRANSITIONS=125} [2024-06-14 15:42:17,835 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 112 predicate places. [2024-06-14 15:42:17,835 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 125 transitions, 989 flow [2024-06-14 15:42:17,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:17,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:17,836 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:42:17,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:42:17,836 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:42:17,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:17,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1900657890, now seen corresponding path program 5 times [2024-06-14 15:42:17,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:17,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097239078] [2024-06-14 15:42:17,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:17,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:23,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:23,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097239078] [2024-06-14 15:42:23,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097239078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:23,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:23,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:42:23,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468569588] [2024-06-14 15:42:23,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:23,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:42:23,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:23,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:42:23,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:42:23,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:42:23,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 125 transitions, 989 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:23,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:23,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:42:23,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:24,293 INFO L124 PetriNetUnfolderBase]: 353/631 cut-off events. [2024-06-14 15:42:24,293 INFO L125 PetriNetUnfolderBase]: For 30318/30318 co-relation queries the response was YES. [2024-06-14 15:42:24,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3668 conditions, 631 events. 353/631 cut-off events. For 30318/30318 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2700 event pairs, 54 based on Foata normal form. 2/631 useless extension candidates. Maximal degree in co-relation 3597. Up to 523 conditions per place. [2024-06-14 15:42:24,298 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 109 selfloop transitions, 32 changer transitions 0/143 dead transitions. [2024-06-14 15:42:24,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 143 transitions, 1419 flow [2024-06-14 15:42:24,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:42:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:42:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 15:42:24,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 15:42:24,301 INFO L175 Difference]: Start difference. First operand has 143 places, 125 transitions, 989 flow. Second operand 10 states and 118 transitions. [2024-06-14 15:42:24,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 143 transitions, 1419 flow [2024-06-14 15:42:24,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 143 transitions, 1363 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 15:42:24,354 INFO L231 Difference]: Finished difference. Result has 145 places, 127 transitions, 1021 flow [2024-06-14 15:42:24,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1021, PETRI_PLACES=145, PETRI_TRANSITIONS=127} [2024-06-14 15:42:24,354 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 114 predicate places. [2024-06-14 15:42:24,354 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 127 transitions, 1021 flow [2024-06-14 15:42:24,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:24,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:24,355 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:42:24,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:42:24,355 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:42:24,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:24,355 INFO L85 PathProgramCache]: Analyzing trace with hash 183004425, now seen corresponding path program 4 times [2024-06-14 15:42:24,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648170189] [2024-06-14 15:42:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:24,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:29,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:29,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648170189] [2024-06-14 15:42:29,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648170189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:29,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:29,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:42:29,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578931790] [2024-06-14 15:42:29,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:29,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:42:29,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:29,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:42:29,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:42:29,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:42:29,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 127 transitions, 1021 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:29,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:29,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:42:29,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:29,819 INFO L124 PetriNetUnfolderBase]: 356/636 cut-off events. [2024-06-14 15:42:29,820 INFO L125 PetriNetUnfolderBase]: For 30561/30561 co-relation queries the response was YES. [2024-06-14 15:42:29,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3740 conditions, 636 events. 356/636 cut-off events. For 30561/30561 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2737 event pairs, 50 based on Foata normal form. 1/635 useless extension candidates. Maximal degree in co-relation 3668. Up to 510 conditions per place. [2024-06-14 15:42:29,824 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 104 selfloop transitions, 38 changer transitions 0/144 dead transitions. [2024-06-14 15:42:29,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 144 transitions, 1371 flow [2024-06-14 15:42:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:42:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:42:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 15:42:29,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 15:42:29,825 INFO L175 Difference]: Start difference. First operand has 145 places, 127 transitions, 1021 flow. Second operand 9 states and 112 transitions. [2024-06-14 15:42:29,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 144 transitions, 1371 flow [2024-06-14 15:42:29,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 144 transitions, 1324 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:42:29,876 INFO L231 Difference]: Finished difference. Result has 148 places, 129 transitions, 1079 flow [2024-06-14 15:42:29,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1079, PETRI_PLACES=148, PETRI_TRANSITIONS=129} [2024-06-14 15:42:29,877 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-14 15:42:29,877 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 129 transitions, 1079 flow [2024-06-14 15:42:29,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:29,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:29,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:29,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:42:29,877 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:42:29,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:29,878 INFO L85 PathProgramCache]: Analyzing trace with hash 89219762, now seen corresponding path program 6 times [2024-06-14 15:42:29,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:29,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313163024] [2024-06-14 15:42:29,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:29,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:35,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:35,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313163024] [2024-06-14 15:42:35,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313163024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:35,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:35,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:42:35,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605859211] [2024-06-14 15:42:35,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:35,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:42:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:35,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:42:35,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:42:35,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:42:35,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 129 transitions, 1079 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:35,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:35,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:42:35,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:36,177 INFO L124 PetriNetUnfolderBase]: 353/631 cut-off events. [2024-06-14 15:42:36,178 INFO L125 PetriNetUnfolderBase]: For 30627/30627 co-relation queries the response was YES. [2024-06-14 15:42:36,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3720 conditions, 631 events. 353/631 cut-off events. For 30627/30627 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2710 event pairs, 55 based on Foata normal form. 2/631 useless extension candidates. Maximal degree in co-relation 3646. Up to 546 conditions per place. [2024-06-14 15:42:36,182 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 111 selfloop transitions, 30 changer transitions 0/143 dead transitions. [2024-06-14 15:42:36,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 143 transitions, 1393 flow [2024-06-14 15:42:36,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:42:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:42:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-14 15:42:36,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-14 15:42:36,183 INFO L175 Difference]: Start difference. First operand has 148 places, 129 transitions, 1079 flow. Second operand 10 states and 116 transitions. [2024-06-14 15:42:36,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 143 transitions, 1393 flow [2024-06-14 15:42:36,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 143 transitions, 1306 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:42:36,244 INFO L231 Difference]: Finished difference. Result has 151 places, 129 transitions, 1056 flow [2024-06-14 15:42:36,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1056, PETRI_PLACES=151, PETRI_TRANSITIONS=129} [2024-06-14 15:42:36,244 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-14 15:42:36,244 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 129 transitions, 1056 flow [2024-06-14 15:42:36,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:36,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:36,245 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:42:36,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:42:36,245 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:42:36,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:36,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1673368380, now seen corresponding path program 7 times [2024-06-14 15:42:36,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:36,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873975807] [2024-06-14 15:42:36,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:36,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:42,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:42:42,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:42,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873975807] [2024-06-14 15:42:42,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873975807] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:42,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:42,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:42:42,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734892986] [2024-06-14 15:42:42,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:42,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:42:42,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:42,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:42:42,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:42:42,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:42:42,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 129 transitions, 1056 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:42,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:42,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:42:42,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:43,129 INFO L124 PetriNetUnfolderBase]: 357/639 cut-off events. [2024-06-14 15:42:43,130 INFO L125 PetriNetUnfolderBase]: For 31846/31846 co-relation queries the response was YES. [2024-06-14 15:42:43,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3736 conditions, 639 events. 357/639 cut-off events. For 31846/31846 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2759 event pairs, 34 based on Foata normal form. 2/639 useless extension candidates. Maximal degree in co-relation 3661. Up to 498 conditions per place. [2024-06-14 15:42:43,134 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 110 selfloop transitions, 40 changer transitions 0/152 dead transitions. [2024-06-14 15:42:43,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 152 transitions, 1519 flow [2024-06-14 15:42:43,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:42:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:42:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:42:43,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 15:42:43,136 INFO L175 Difference]: Start difference. First operand has 151 places, 129 transitions, 1056 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:42:43,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 152 transitions, 1519 flow [2024-06-14 15:42:43,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 152 transitions, 1453 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-14 15:42:43,197 INFO L231 Difference]: Finished difference. Result has 152 places, 130 transitions, 1085 flow [2024-06-14 15:42:43,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1085, PETRI_PLACES=152, PETRI_TRANSITIONS=130} [2024-06-14 15:42:43,198 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 121 predicate places. [2024-06-14 15:42:43,198 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 130 transitions, 1085 flow [2024-06-14 15:42:43,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:43,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:43,198 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:42:43,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:42:43,198 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:42:43,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:43,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1673372255, now seen corresponding path program 5 times [2024-06-14 15:42:43,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:43,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453607561] [2024-06-14 15:42:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:43,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:49,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:49,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453607561] [2024-06-14 15:42:49,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453607561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:49,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:49,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:42:49,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964807508] [2024-06-14 15:42:49,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:49,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:42:49,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:49,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:42:49,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:42:49,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:42:49,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 130 transitions, 1085 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:49,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:49,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:42:49,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:49,801 INFO L124 PetriNetUnfolderBase]: 370/660 cut-off events. [2024-06-14 15:42:49,801 INFO L125 PetriNetUnfolderBase]: For 34416/34416 co-relation queries the response was YES. [2024-06-14 15:42:49,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3977 conditions, 660 events. 370/660 cut-off events. For 34416/34416 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2872 event pairs, 45 based on Foata normal form. 1/659 useless extension candidates. Maximal degree in co-relation 3901. Up to 392 conditions per place. [2024-06-14 15:42:49,846 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 92 selfloop transitions, 64 changer transitions 0/158 dead transitions. [2024-06-14 15:42:49,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 158 transitions, 1596 flow [2024-06-14 15:42:49,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:42:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:42:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-14 15:42:49,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-14 15:42:49,847 INFO L175 Difference]: Start difference. First operand has 152 places, 130 transitions, 1085 flow. Second operand 10 states and 134 transitions. [2024-06-14 15:42:49,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 158 transitions, 1596 flow [2024-06-14 15:42:49,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 158 transitions, 1454 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:42:49,904 INFO L231 Difference]: Finished difference. Result has 153 places, 134 transitions, 1144 flow [2024-06-14 15:42:49,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1144, PETRI_PLACES=153, PETRI_TRANSITIONS=134} [2024-06-14 15:42:49,914 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2024-06-14 15:42:49,914 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 134 transitions, 1144 flow [2024-06-14 15:42:49,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:49,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:49,915 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:42:49,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:42:49,915 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:42:49,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash 227747912, now seen corresponding path program 8 times [2024-06-14 15:42:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:49,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100043621] [2024-06-14 15:42:49,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:49,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:55,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:55,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100043621] [2024-06-14 15:42:55,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100043621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:55,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:55,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:42:55,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020938739] [2024-06-14 15:42:55,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:55,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:42:55,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:55,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:42:55,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:42:56,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:42:56,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 134 transitions, 1144 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:56,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:56,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:42:56,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:56,508 INFO L124 PetriNetUnfolderBase]: 374/668 cut-off events. [2024-06-14 15:42:56,509 INFO L125 PetriNetUnfolderBase]: For 37354/37354 co-relation queries the response was YES. [2024-06-14 15:42:56,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4021 conditions, 668 events. 374/668 cut-off events. For 37354/37354 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2911 event pairs, 58 based on Foata normal form. 2/668 useless extension candidates. Maximal degree in co-relation 3945. Up to 568 conditions per place. [2024-06-14 15:42:56,514 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 115 selfloop transitions, 38 changer transitions 0/155 dead transitions. [2024-06-14 15:42:56,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 155 transitions, 1505 flow [2024-06-14 15:42:56,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:42:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:42:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 15:42:56,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 15:42:56,515 INFO L175 Difference]: Start difference. First operand has 153 places, 134 transitions, 1144 flow. Second operand 10 states and 123 transitions. [2024-06-14 15:42:56,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 155 transitions, 1505 flow [2024-06-14 15:42:56,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 155 transitions, 1388 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 15:42:56,583 INFO L231 Difference]: Finished difference. Result has 156 places, 135 transitions, 1116 flow [2024-06-14 15:42:56,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1116, PETRI_PLACES=156, PETRI_TRANSITIONS=135} [2024-06-14 15:42:56,584 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-14 15:42:56,584 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 135 transitions, 1116 flow [2024-06-14 15:42:56,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:56,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:56,584 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:42:56,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:42:56,584 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:42:56,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:56,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1679086175, now seen corresponding path program 6 times [2024-06-14 15:42:56,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:56,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566471356] [2024-06-14 15:42:56,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:56,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:02,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:02,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566471356] [2024-06-14 15:43:02,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566471356] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:02,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:02,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761750166] [2024-06-14 15:43:02,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:02,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:02,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:02,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:02,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:02,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:02,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 135 transitions, 1116 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:02,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:02,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:02,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:03,241 INFO L124 PetriNetUnfolderBase]: 377/673 cut-off events. [2024-06-14 15:43:03,241 INFO L125 PetriNetUnfolderBase]: For 37234/37234 co-relation queries the response was YES. [2024-06-14 15:43:03,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4038 conditions, 673 events. 377/673 cut-off events. For 37234/37234 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2942 event pairs, 50 based on Foata normal form. 1/672 useless extension candidates. Maximal degree in co-relation 3961. Up to 562 conditions per place. [2024-06-14 15:43:03,246 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 117 selfloop transitions, 36 changer transitions 0/155 dead transitions. [2024-06-14 15:43:03,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 155 transitions, 1508 flow [2024-06-14 15:43:03,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:43:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:43:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 15:43:03,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-14 15:43:03,248 INFO L175 Difference]: Start difference. First operand has 156 places, 135 transitions, 1116 flow. Second operand 10 states and 117 transitions. [2024-06-14 15:43:03,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 155 transitions, 1508 flow [2024-06-14 15:43:03,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 155 transitions, 1430 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 15:43:03,303 INFO L231 Difference]: Finished difference. Result has 159 places, 140 transitions, 1176 flow [2024-06-14 15:43:03,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1176, PETRI_PLACES=159, PETRI_TRANSITIONS=140} [2024-06-14 15:43:03,303 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 128 predicate places. [2024-06-14 15:43:03,304 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 140 transitions, 1176 flow [2024-06-14 15:43:03,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:03,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:03,304 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:43:03,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:43:03,304 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:43:03,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:03,305 INFO L85 PathProgramCache]: Analyzing trace with hash 233254442, now seen corresponding path program 9 times [2024-06-14 15:43:03,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:03,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783270252] [2024-06-14 15:43:03,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:03,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:09,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:09,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783270252] [2024-06-14 15:43:09,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783270252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:09,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:09,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:09,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087240568] [2024-06-14 15:43:09,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:09,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:09,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:09,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:09,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:09,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:09,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 140 transitions, 1176 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:09,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:09,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:09,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:10,297 INFO L124 PetriNetUnfolderBase]: 381/681 cut-off events. [2024-06-14 15:43:10,297 INFO L125 PetriNetUnfolderBase]: For 40144/40144 co-relation queries the response was YES. [2024-06-14 15:43:10,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4123 conditions, 681 events. 381/681 cut-off events. For 40144/40144 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2973 event pairs, 58 based on Foata normal form. 2/681 useless extension candidates. Maximal degree in co-relation 4044. Up to 602 conditions per place. [2024-06-14 15:43:10,304 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 126 selfloop transitions, 27 changer transitions 0/155 dead transitions. [2024-06-14 15:43:10,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 155 transitions, 1523 flow [2024-06-14 15:43:10,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:43:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:43:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 15:43:10,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-14 15:43:10,306 INFO L175 Difference]: Start difference. First operand has 159 places, 140 transitions, 1176 flow. Second operand 10 states and 114 transitions. [2024-06-14 15:43:10,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 155 transitions, 1523 flow [2024-06-14 15:43:10,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 155 transitions, 1467 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 15:43:10,373 INFO L231 Difference]: Finished difference. Result has 164 places, 141 transitions, 1189 flow [2024-06-14 15:43:10,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1189, PETRI_PLACES=164, PETRI_TRANSITIONS=141} [2024-06-14 15:43:10,374 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 133 predicate places. [2024-06-14 15:43:10,374 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 141 transitions, 1189 flow [2024-06-14 15:43:10,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:10,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:10,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:10,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:43:10,375 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:43:10,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:10,375 INFO L85 PathProgramCache]: Analyzing trace with hash -537786871, now seen corresponding path program 7 times [2024-06-14 15:43:10,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:10,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960651537] [2024-06-14 15:43:10,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:10,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:16,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:16,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960651537] [2024-06-14 15:43:16,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960651537] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:16,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:16,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343432416] [2024-06-14 15:43:16,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:16,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:16,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:16,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:16,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:16,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:16,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 141 transitions, 1189 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:16,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:16,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:16,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:17,023 INFO L124 PetriNetUnfolderBase]: 390/696 cut-off events. [2024-06-14 15:43:17,024 INFO L125 PetriNetUnfolderBase]: For 43240/43240 co-relation queries the response was YES. [2024-06-14 15:43:17,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4216 conditions, 696 events. 390/696 cut-off events. For 43240/43240 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3070 event pairs, 46 based on Foata normal form. 3/697 useless extension candidates. Maximal degree in co-relation 4136. Up to 495 conditions per place. [2024-06-14 15:43:17,047 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 109 selfloop transitions, 57 changer transitions 0/168 dead transitions. [2024-06-14 15:43:17,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 168 transitions, 1635 flow [2024-06-14 15:43:17,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:43:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:43:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 15:43:17,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-14 15:43:17,049 INFO L175 Difference]: Start difference. First operand has 164 places, 141 transitions, 1189 flow. Second operand 10 states and 129 transitions. [2024-06-14 15:43:17,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 168 transitions, 1635 flow [2024-06-14 15:43:17,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 168 transitions, 1577 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 15:43:17,121 INFO L231 Difference]: Finished difference. Result has 166 places, 145 transitions, 1309 flow [2024-06-14 15:43:17,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1309, PETRI_PLACES=166, PETRI_TRANSITIONS=145} [2024-06-14 15:43:17,122 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 135 predicate places. [2024-06-14 15:43:17,122 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 145 transitions, 1309 flow [2024-06-14 15:43:17,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:17,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:17,122 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:43:17,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:43:17,122 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:43:17,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:17,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1678878785, now seen corresponding path program 8 times [2024-06-14 15:43:17,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:17,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629772691] [2024-06-14 15:43:17,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:17,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:23,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:23,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629772691] [2024-06-14 15:43:23,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629772691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:23,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:23,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:23,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192443053] [2024-06-14 15:43:23,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:23,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:23,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:23,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:23,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:23,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:23,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 145 transitions, 1309 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:23,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:23,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:23,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:23,956 INFO L124 PetriNetUnfolderBase]: 398/709 cut-off events. [2024-06-14 15:43:23,957 INFO L125 PetriNetUnfolderBase]: For 43612/43612 co-relation queries the response was YES. [2024-06-14 15:43:23,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4506 conditions, 709 events. 398/709 cut-off events. For 43612/43612 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3155 event pairs, 50 based on Foata normal form. 1/708 useless extension candidates. Maximal degree in co-relation 4425. Up to 588 conditions per place. [2024-06-14 15:43:23,962 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 123 selfloop transitions, 41 changer transitions 0/166 dead transitions. [2024-06-14 15:43:23,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 166 transitions, 1876 flow [2024-06-14 15:43:23,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:43:23,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:43:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 15:43:23,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:43:23,963 INFO L175 Difference]: Start difference. First operand has 166 places, 145 transitions, 1309 flow. Second operand 10 states and 120 transitions. [2024-06-14 15:43:23,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 166 transitions, 1876 flow [2024-06-14 15:43:24,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 166 transitions, 1738 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 15:43:24,026 INFO L231 Difference]: Finished difference. Result has 168 places, 150 transitions, 1345 flow [2024-06-14 15:43:24,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1345, PETRI_PLACES=168, PETRI_TRANSITIONS=150} [2024-06-14 15:43:24,027 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 137 predicate places. [2024-06-14 15:43:24,027 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 150 transitions, 1345 flow [2024-06-14 15:43:24,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:24,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:24,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:24,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:43:24,028 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:43:24,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:24,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1673516250, now seen corresponding path program 10 times [2024-06-14 15:43:24,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:24,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257497258] [2024-06-14 15:43:24,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:24,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:30,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:43:30,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:30,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257497258] [2024-06-14 15:43:30,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257497258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:30,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:30,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:30,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732858056] [2024-06-14 15:43:30,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:30,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:30,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:30,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:30,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:30,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:30,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 150 transitions, 1345 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:30,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:30,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:30,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:30,955 INFO L124 PetriNetUnfolderBase]: 402/717 cut-off events. [2024-06-14 15:43:30,955 INFO L125 PetriNetUnfolderBase]: For 46703/46703 co-relation queries the response was YES. [2024-06-14 15:43:30,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4504 conditions, 717 events. 402/717 cut-off events. For 46703/46703 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3193 event pairs, 60 based on Foata normal form. 2/717 useless extension candidates. Maximal degree in co-relation 4422. Up to 638 conditions per place. [2024-06-14 15:43:30,961 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 136 selfloop transitions, 30 changer transitions 0/168 dead transitions. [2024-06-14 15:43:30,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 168 transitions, 1728 flow [2024-06-14 15:43:30,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:43:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:43:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 15:43:30,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 15:43:30,963 INFO L175 Difference]: Start difference. First operand has 168 places, 150 transitions, 1345 flow. Second operand 10 states and 118 transitions. [2024-06-14 15:43:30,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 168 transitions, 1728 flow [2024-06-14 15:43:31,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 168 transitions, 1680 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-14 15:43:31,033 INFO L231 Difference]: Finished difference. Result has 174 places, 151 transitions, 1374 flow [2024-06-14 15:43:31,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1374, PETRI_PLACES=174, PETRI_TRANSITIONS=151} [2024-06-14 15:43:31,033 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 143 predicate places. [2024-06-14 15:43:31,033 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 151 transitions, 1374 flow [2024-06-14 15:43:31,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:31,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:31,034 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:43:31,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:43:31,034 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:43:31,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:31,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1678884365, now seen corresponding path program 9 times [2024-06-14 15:43:31,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:31,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938170015] [2024-06-14 15:43:31,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:31,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:36,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:36,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938170015] [2024-06-14 15:43:36,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938170015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:36,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:36,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:36,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838372510] [2024-06-14 15:43:36,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:36,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:36,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:36,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:37,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:37,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 151 transitions, 1374 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:37,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:37,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:37,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:37,447 INFO L124 PetriNetUnfolderBase]: 406/724 cut-off events. [2024-06-14 15:43:37,447 INFO L125 PetriNetUnfolderBase]: For 48210/48210 co-relation queries the response was YES. [2024-06-14 15:43:37,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4538 conditions, 724 events. 406/724 cut-off events. For 48210/48210 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3244 event pairs, 54 based on Foata normal form. 3/725 useless extension candidates. Maximal degree in co-relation 4454. Up to 523 conditions per place. [2024-06-14 15:43:37,453 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 117 selfloop transitions, 52 changer transitions 0/171 dead transitions. [2024-06-14 15:43:37,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 171 transitions, 1772 flow [2024-06-14 15:43:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:43:37,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:43:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 15:43:37,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:43:37,454 INFO L175 Difference]: Start difference. First operand has 174 places, 151 transitions, 1374 flow. Second operand 10 states and 128 transitions. [2024-06-14 15:43:37,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 171 transitions, 1772 flow [2024-06-14 15:43:37,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 171 transitions, 1688 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 15:43:37,525 INFO L231 Difference]: Finished difference. Result has 176 places, 153 transitions, 1426 flow [2024-06-14 15:43:37,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1426, PETRI_PLACES=176, PETRI_TRANSITIONS=153} [2024-06-14 15:43:37,526 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-14 15:43:37,526 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 153 transitions, 1426 flow [2024-06-14 15:43:37,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:37,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:37,526 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:43:37,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:43:37,527 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:43:37,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:37,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1673516405, now seen corresponding path program 10 times [2024-06-14 15:43:37,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:37,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639826299] [2024-06-14 15:43:37,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:37,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:43,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:43,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639826299] [2024-06-14 15:43:43,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639826299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:43,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:43,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155132441] [2024-06-14 15:43:43,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:43,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:43,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:43,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:43,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:43,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:43,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 153 transitions, 1426 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:43,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:43,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:43,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:44,230 INFO L124 PetriNetUnfolderBase]: 409/729 cut-off events. [2024-06-14 15:43:44,231 INFO L125 PetriNetUnfolderBase]: For 46578/46578 co-relation queries the response was YES. [2024-06-14 15:43:44,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4658 conditions, 729 events. 409/729 cut-off events. For 46578/46578 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3281 event pairs, 58 based on Foata normal form. 1/728 useless extension candidates. Maximal degree in co-relation 4573. Up to 612 conditions per place. [2024-06-14 15:43:44,235 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 127 selfloop transitions, 46 changer transitions 0/175 dead transitions. [2024-06-14 15:43:44,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 175 transitions, 1878 flow [2024-06-14 15:43:44,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:43:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:43:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 15:43:44,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 15:43:44,237 INFO L175 Difference]: Start difference. First operand has 176 places, 153 transitions, 1426 flow. Second operand 10 states and 123 transitions. [2024-06-14 15:43:44,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 175 transitions, 1878 flow [2024-06-14 15:43:44,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 175 transitions, 1764 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 15:43:44,316 INFO L231 Difference]: Finished difference. Result has 179 places, 159 transitions, 1506 flow [2024-06-14 15:43:44,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1506, PETRI_PLACES=179, PETRI_TRANSITIONS=159} [2024-06-14 15:43:44,317 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 148 predicate places. [2024-06-14 15:43:44,317 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 159 transitions, 1506 flow [2024-06-14 15:43:44,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:44,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:44,317 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:43:44,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:43:44,317 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:43:44,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:44,318 INFO L85 PathProgramCache]: Analyzing trace with hash -680609174, now seen corresponding path program 11 times [2024-06-14 15:43:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:44,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477948345] [2024-06-14 15:43:44,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:50,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:43:50,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:50,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477948345] [2024-06-14 15:43:50,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477948345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:50,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:50,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:50,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775000226] [2024-06-14 15:43:50,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:50,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:50,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:50,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:50,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:50,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:50,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 159 transitions, 1506 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:50,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:50,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:50,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:50,829 INFO L124 PetriNetUnfolderBase]: 406/724 cut-off events. [2024-06-14 15:43:50,830 INFO L125 PetriNetUnfolderBase]: For 46303/46303 co-relation queries the response was YES. [2024-06-14 15:43:50,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4563 conditions, 724 events. 406/724 cut-off events. For 46303/46303 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3241 event pairs, 55 based on Foata normal form. 2/724 useless extension candidates. Maximal degree in co-relation 4476. Up to 694 conditions per place. [2024-06-14 15:43:50,835 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 153 selfloop transitions, 14 changer transitions 0/169 dead transitions. [2024-06-14 15:43:50,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 169 transitions, 1862 flow [2024-06-14 15:43:50,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:43:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:43:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 15:43:50,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-14 15:43:50,836 INFO L175 Difference]: Start difference. First operand has 179 places, 159 transitions, 1506 flow. Second operand 9 states and 98 transitions. [2024-06-14 15:43:50,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 169 transitions, 1862 flow [2024-06-14 15:43:50,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 169 transitions, 1795 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-14 15:43:50,913 INFO L231 Difference]: Finished difference. Result has 184 places, 159 transitions, 1471 flow [2024-06-14 15:43:50,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1471, PETRI_PLACES=184, PETRI_TRANSITIONS=159} [2024-06-14 15:43:50,913 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2024-06-14 15:43:50,914 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 159 transitions, 1471 flow [2024-06-14 15:43:50,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:50,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:50,914 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:43:50,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:43:50,914 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:43:50,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:50,915 INFO L85 PathProgramCache]: Analyzing trace with hash -680609019, now seen corresponding path program 11 times [2024-06-14 15:43:50,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:50,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873601449] [2024-06-14 15:43:50,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:50,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:56,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:56,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873601449] [2024-06-14 15:43:56,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873601449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:56,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:56,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:56,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566838866] [2024-06-14 15:43:56,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:56,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:56,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:56,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:56,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:57,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:43:57,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 159 transitions, 1471 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:57,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:57,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:43:57,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:57,335 INFO L124 PetriNetUnfolderBase]: 409/729 cut-off events. [2024-06-14 15:43:57,335 INFO L125 PetriNetUnfolderBase]: For 45842/45842 co-relation queries the response was YES. [2024-06-14 15:43:57,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4571 conditions, 729 events. 409/729 cut-off events. For 45842/45842 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3274 event pairs, 55 based on Foata normal form. 1/728 useless extension candidates. Maximal degree in co-relation 4483. Up to 676 conditions per place. [2024-06-14 15:43:57,341 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 146 selfloop transitions, 23 changer transitions 0/171 dead transitions. [2024-06-14 15:43:57,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 171 transitions, 1997 flow [2024-06-14 15:43:57,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:43:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:43:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-14 15:43:57,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3576388888888889 [2024-06-14 15:43:57,343 INFO L175 Difference]: Start difference. First operand has 184 places, 159 transitions, 1471 flow. Second operand 9 states and 103 transitions. [2024-06-14 15:43:57,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 171 transitions, 1997 flow [2024-06-14 15:43:57,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 171 transitions, 1918 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 15:43:57,442 INFO L231 Difference]: Finished difference. Result has 184 places, 161 transitions, 1487 flow [2024-06-14 15:43:57,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1487, PETRI_PLACES=184, PETRI_TRANSITIONS=161} [2024-06-14 15:43:57,443 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2024-06-14 15:43:57,443 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 161 transitions, 1487 flow [2024-06-14 15:43:57,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:57,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:57,443 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:43:57,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:43:57,444 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:43:57,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:57,444 INFO L85 PathProgramCache]: Analyzing trace with hash -414696692, now seen corresponding path program 1 times [2024-06-14 15:43:57,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:57,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211663171] [2024-06-14 15:43:57,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:57,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:02,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:02,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:02,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211663171] [2024-06-14 15:44:02,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211663171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:02,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:02,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:44:02,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569643108] [2024-06-14 15:44:02,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:02,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:44:02,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:02,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:44:02,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:44:02,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:02,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 161 transitions, 1487 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:02,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:02,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:02,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:03,124 INFO L124 PetriNetUnfolderBase]: 405/723 cut-off events. [2024-06-14 15:44:03,125 INFO L125 PetriNetUnfolderBase]: For 45384/45384 co-relation queries the response was YES. [2024-06-14 15:44:03,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4424 conditions, 723 events. 405/723 cut-off events. For 45384/45384 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3237 event pairs, 48 based on Foata normal form. 2/723 useless extension candidates. Maximal degree in co-relation 4335. Up to 683 conditions per place. [2024-06-14 15:44:03,131 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 158 selfloop transitions, 15 changer transitions 0/175 dead transitions. [2024-06-14 15:44:03,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 175 transitions, 1873 flow [2024-06-14 15:44:03,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:44:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:44:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-14 15:44:03,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2024-06-14 15:44:03,133 INFO L175 Difference]: Start difference. First operand has 184 places, 161 transitions, 1487 flow. Second operand 9 states and 101 transitions. [2024-06-14 15:44:03,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 175 transitions, 1873 flow [2024-06-14 15:44:03,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 175 transitions, 1708 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-14 15:44:03,213 INFO L231 Difference]: Finished difference. Result has 185 places, 163 transitions, 1375 flow [2024-06-14 15:44:03,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1375, PETRI_PLACES=185, PETRI_TRANSITIONS=163} [2024-06-14 15:44:03,215 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 154 predicate places. [2024-06-14 15:44:03,215 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 163 transitions, 1375 flow [2024-06-14 15:44:03,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:03,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:03,215 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:44:03,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:44:03,215 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:44:03,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:03,216 INFO L85 PathProgramCache]: Analyzing trace with hash -680603439, now seen corresponding path program 12 times [2024-06-14 15:44:03,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:03,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383188952] [2024-06-14 15:44:03,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:03,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:09,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:09,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383188952] [2024-06-14 15:44:09,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383188952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:09,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:09,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:44:09,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043398622] [2024-06-14 15:44:09,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:09,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:44:09,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:09,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:44:09,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:44:09,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:09,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 163 transitions, 1375 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:09,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:09,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:09,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:09,800 INFO L124 PetriNetUnfolderBase]: 414/738 cut-off events. [2024-06-14 15:44:09,801 INFO L125 PetriNetUnfolderBase]: For 48424/48424 co-relation queries the response was YES. [2024-06-14 15:44:09,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4398 conditions, 738 events. 414/738 cut-off events. For 48424/48424 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3333 event pairs, 50 based on Foata normal form. 3/739 useless extension candidates. Maximal degree in co-relation 4309. Up to 650 conditions per place. [2024-06-14 15:44:09,806 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 149 selfloop transitions, 30 changer transitions 0/181 dead transitions. [2024-06-14 15:44:09,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 181 transitions, 1831 flow [2024-06-14 15:44:09,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:44:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:44:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-14 15:44:09,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3784722222222222 [2024-06-14 15:44:09,807 INFO L175 Difference]: Start difference. First operand has 185 places, 163 transitions, 1375 flow. Second operand 9 states and 109 transitions. [2024-06-14 15:44:09,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 181 transitions, 1831 flow [2024-06-14 15:44:09,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 181 transitions, 1794 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:44:09,881 INFO L231 Difference]: Finished difference. Result has 187 places, 167 transitions, 1478 flow [2024-06-14 15:44:09,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1478, PETRI_PLACES=187, PETRI_TRANSITIONS=167} [2024-06-14 15:44:09,881 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 156 predicate places. [2024-06-14 15:44:09,881 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 167 transitions, 1478 flow [2024-06-14 15:44:09,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:09,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:09,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:09,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:44:09,882 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:44:09,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:09,882 INFO L85 PathProgramCache]: Analyzing trace with hash -423901119, now seen corresponding path program 13 times [2024-06-14 15:44:09,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:09,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717925410] [2024-06-14 15:44:09,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:09,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:15,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:44:15,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:15,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717925410] [2024-06-14 15:44:15,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717925410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:15,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:15,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:44:15,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038132798] [2024-06-14 15:44:15,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:15,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:44:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:15,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:44:15,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:44:15,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:15,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 167 transitions, 1478 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:15,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:15,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:15,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:16,121 INFO L124 PetriNetUnfolderBase]: 417/743 cut-off events. [2024-06-14 15:44:16,121 INFO L125 PetriNetUnfolderBase]: For 46190/46190 co-relation queries the response was YES. [2024-06-14 15:44:16,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4523 conditions, 743 events. 417/743 cut-off events. For 46190/46190 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3374 event pairs, 54 based on Foata normal form. 1/742 useless extension candidates. Maximal degree in co-relation 4433. Up to 716 conditions per place. [2024-06-14 15:44:16,126 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 163 selfloop transitions, 15 changer transitions 0/180 dead transitions. [2024-06-14 15:44:16,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 180 transitions, 1912 flow [2024-06-14 15:44:16,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:44:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:44:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 15:44:16,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-14 15:44:16,132 INFO L175 Difference]: Start difference. First operand has 187 places, 167 transitions, 1478 flow. Second operand 9 states and 98 transitions. [2024-06-14 15:44:16,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 180 transitions, 1912 flow [2024-06-14 15:44:16,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 180 transitions, 1816 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-14 15:44:16,205 INFO L231 Difference]: Finished difference. Result has 191 places, 171 transitions, 1489 flow [2024-06-14 15:44:16,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1489, PETRI_PLACES=191, PETRI_TRANSITIONS=171} [2024-06-14 15:44:16,206 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 160 predicate places. [2024-06-14 15:44:16,206 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 171 transitions, 1489 flow [2024-06-14 15:44:16,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:16,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:16,206 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:44:16,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:44:16,207 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:44:16,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash -680401629, now seen corresponding path program 14 times [2024-06-14 15:44:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:16,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064293397] [2024-06-14 15:44:16,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:16,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:22,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:22,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064293397] [2024-06-14 15:44:22,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064293397] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:22,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:22,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:44:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855718454] [2024-06-14 15:44:22,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:22,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:44:22,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:22,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:44:22,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:44:22,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:22,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 171 transitions, 1489 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:22,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:22,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:22,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:22,609 INFO L124 PetriNetUnfolderBase]: 415/740 cut-off events. [2024-06-14 15:44:22,609 INFO L125 PetriNetUnfolderBase]: For 45349/45349 co-relation queries the response was YES. [2024-06-14 15:44:22,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4394 conditions, 740 events. 415/740 cut-off events. For 45349/45349 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3351 event pairs, 54 based on Foata normal form. 1/739 useless extension candidates. Maximal degree in co-relation 4301. Up to 698 conditions per place. [2024-06-14 15:44:22,616 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 157 selfloop transitions, 22 changer transitions 0/181 dead transitions. [2024-06-14 15:44:22,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 181 transitions, 1875 flow [2024-06-14 15:44:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:44:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:44:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-14 15:44:22,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2024-06-14 15:44:22,618 INFO L175 Difference]: Start difference. First operand has 191 places, 171 transitions, 1489 flow. Second operand 9 states and 102 transitions. [2024-06-14 15:44:22,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 181 transitions, 1875 flow [2024-06-14 15:44:22,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 181 transitions, 1796 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-06-14 15:44:22,707 INFO L231 Difference]: Finished difference. Result has 195 places, 172 transitions, 1467 flow [2024-06-14 15:44:22,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1467, PETRI_PLACES=195, PETRI_TRANSITIONS=172} [2024-06-14 15:44:22,708 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 164 predicate places. [2024-06-14 15:44:22,708 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 172 transitions, 1467 flow [2024-06-14 15:44:22,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:22,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:22,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:22,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:44:22,709 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:44:22,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:22,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1536390017, now seen corresponding path program 1 times [2024-06-14 15:44:22,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:22,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262226204] [2024-06-14 15:44:22,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:22,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:30,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:30,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262226204] [2024-06-14 15:44:30,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262226204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:30,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:30,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:44:30,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195003625] [2024-06-14 15:44:30,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:30,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:44:30,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:30,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:44:30,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:44:30,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:30,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 172 transitions, 1467 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:30,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:30,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:30,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:31,000 INFO L124 PetriNetUnfolderBase]: 419/748 cut-off events. [2024-06-14 15:44:31,001 INFO L125 PetriNetUnfolderBase]: For 48617/48617 co-relation queries the response was YES. [2024-06-14 15:44:31,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4401 conditions, 748 events. 419/748 cut-off events. For 48617/48617 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3409 event pairs, 36 based on Foata normal form. 2/748 useless extension candidates. Maximal degree in co-relation 4307. Up to 358 conditions per place. [2024-06-14 15:44:31,005 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 119 selfloop transitions, 74 changer transitions 0/195 dead transitions. [2024-06-14 15:44:31,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 195 transitions, 2039 flow [2024-06-14 15:44:31,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:44:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:44:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-14 15:44:31,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2024-06-14 15:44:31,006 INFO L175 Difference]: Start difference. First operand has 195 places, 172 transitions, 1467 flow. Second operand 11 states and 130 transitions. [2024-06-14 15:44:31,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 195 transitions, 2039 flow [2024-06-14 15:44:31,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 195 transitions, 1960 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 15:44:31,098 INFO L231 Difference]: Finished difference. Result has 198 places, 173 transitions, 1544 flow [2024-06-14 15:44:31,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1544, PETRI_PLACES=198, PETRI_TRANSITIONS=173} [2024-06-14 15:44:31,099 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 167 predicate places. [2024-06-14 15:44:31,099 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 173 transitions, 1544 flow [2024-06-14 15:44:31,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:31,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:31,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:31,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:44:31,100 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:44:31,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:31,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1478182247, now seen corresponding path program 2 times [2024-06-14 15:44:31,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:31,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041527954] [2024-06-14 15:44:31,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:31,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:37,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:37,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041527954] [2024-06-14 15:44:37,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041527954] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:37,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:37,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:44:37,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202566532] [2024-06-14 15:44:37,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:37,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:44:37,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:37,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:44:37,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:44:37,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:37,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 173 transitions, 1544 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:37,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:37,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:37,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:38,309 INFO L124 PetriNetUnfolderBase]: 440/785 cut-off events. [2024-06-14 15:44:38,309 INFO L125 PetriNetUnfolderBase]: For 59026/59026 co-relation queries the response was YES. [2024-06-14 15:44:38,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4875 conditions, 785 events. 440/785 cut-off events. For 59026/59026 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3617 event pairs, 50 based on Foata normal form. 2/785 useless extension candidates. Maximal degree in co-relation 4783. Up to 437 conditions per place. [2024-06-14 15:44:38,314 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 107 selfloop transitions, 91 changer transitions 0/200 dead transitions. [2024-06-14 15:44:38,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 200 transitions, 2292 flow [2024-06-14 15:44:38,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:44:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:44:38,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:44:38,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 15:44:38,315 INFO L175 Difference]: Start difference. First operand has 198 places, 173 transitions, 1544 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:44:38,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 200 transitions, 2292 flow [2024-06-14 15:44:38,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 200 transitions, 2162 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 15:44:38,414 INFO L231 Difference]: Finished difference. Result has 202 places, 177 transitions, 1703 flow [2024-06-14 15:44:38,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1703, PETRI_PLACES=202, PETRI_TRANSITIONS=177} [2024-06-14 15:44:38,414 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 171 predicate places. [2024-06-14 15:44:38,415 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 177 transitions, 1703 flow [2024-06-14 15:44:38,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:38,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:38,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:38,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:44:38,415 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:44:38,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1639971369, now seen corresponding path program 1 times [2024-06-14 15:44:38,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:38,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836940026] [2024-06-14 15:44:38,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:38,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:44,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:44,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836940026] [2024-06-14 15:44:44,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836940026] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:44,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:44,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:44:44,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629207722] [2024-06-14 15:44:44,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:44,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:44:44,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:44,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:44:44,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:44:44,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:44,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 177 transitions, 1703 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:44,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:44,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:44,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:44,882 INFO L124 PetriNetUnfolderBase]: 456/811 cut-off events. [2024-06-14 15:44:44,883 INFO L125 PetriNetUnfolderBase]: For 65946/65946 co-relation queries the response was YES. [2024-06-14 15:44:44,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5388 conditions, 811 events. 456/811 cut-off events. For 65946/65946 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3770 event pairs, 54 based on Foata normal form. 2/811 useless extension candidates. Maximal degree in co-relation 5294. Up to 447 conditions per place. [2024-06-14 15:44:44,889 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 120 selfloop transitions, 79 changer transitions 0/201 dead transitions. [2024-06-14 15:44:44,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 201 transitions, 2331 flow [2024-06-14 15:44:44,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:44:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:44:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 15:44:44,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:44:44,908 INFO L175 Difference]: Start difference. First operand has 202 places, 177 transitions, 1703 flow. Second operand 10 states and 128 transitions. [2024-06-14 15:44:44,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 201 transitions, 2331 flow [2024-06-14 15:44:45,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 201 transitions, 2266 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:44:45,039 INFO L231 Difference]: Finished difference. Result has 206 places, 181 transitions, 1853 flow [2024-06-14 15:44:45,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1853, PETRI_PLACES=206, PETRI_TRANSITIONS=181} [2024-06-14 15:44:45,040 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 175 predicate places. [2024-06-14 15:44:45,040 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 181 transitions, 1853 flow [2024-06-14 15:44:45,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:45,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:45,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:45,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:44:45,041 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:44:45,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:45,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1478297567, now seen corresponding path program 3 times [2024-06-14 15:44:45,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:45,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881499484] [2024-06-14 15:44:45,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:45,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:52,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:52,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881499484] [2024-06-14 15:44:52,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881499484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:52,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:52,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:44:52,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974059851] [2024-06-14 15:44:52,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:52,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:44:52,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:52,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:44:52,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:44:52,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:52,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 181 transitions, 1853 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:52,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:52,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:52,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:52,772 INFO L124 PetriNetUnfolderBase]: 460/819 cut-off events. [2024-06-14 15:44:52,772 INFO L125 PetriNetUnfolderBase]: For 67851/67851 co-relation queries the response was YES. [2024-06-14 15:44:52,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5613 conditions, 819 events. 460/819 cut-off events. For 67851/67851 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3830 event pairs, 48 based on Foata normal form. 2/819 useless extension candidates. Maximal degree in co-relation 5517. Up to 449 conditions per place. [2024-06-14 15:44:52,779 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 112 selfloop transitions, 92 changer transitions 0/206 dead transitions. [2024-06-14 15:44:52,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 206 transitions, 2596 flow [2024-06-14 15:44:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:44:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:44:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-14 15:44:52,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-14 15:44:52,780 INFO L175 Difference]: Start difference. First operand has 206 places, 181 transitions, 1853 flow. Second operand 11 states and 140 transitions. [2024-06-14 15:44:52,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 206 transitions, 2596 flow [2024-06-14 15:44:52,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 206 transitions, 2521 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 15:44:52,948 INFO L231 Difference]: Finished difference. Result has 211 places, 182 transitions, 1973 flow [2024-06-14 15:44:52,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1778, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1973, PETRI_PLACES=211, PETRI_TRANSITIONS=182} [2024-06-14 15:44:52,949 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 180 predicate places. [2024-06-14 15:44:52,949 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 182 transitions, 1973 flow [2024-06-14 15:44:52,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:52,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:52,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:52,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 15:44:52,949 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:44:52,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:52,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1478177597, now seen corresponding path program 4 times [2024-06-14 15:44:52,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:52,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871128689] [2024-06-14 15:44:52,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:52,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:59,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:59,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871128689] [2024-06-14 15:44:59,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871128689] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:59,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:59,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:44:59,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901372459] [2024-06-14 15:44:59,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:59,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:44:59,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:59,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:44:59,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:44:59,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:44:59,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 182 transitions, 1973 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:59,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:59,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:44:59,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:00,120 INFO L124 PetriNetUnfolderBase]: 457/814 cut-off events. [2024-06-14 15:45:00,120 INFO L125 PetriNetUnfolderBase]: For 65122/65122 co-relation queries the response was YES. [2024-06-14 15:45:00,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5659 conditions, 814 events. 457/814 cut-off events. For 65122/65122 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3809 event pairs, 51 based on Foata normal form. 2/814 useless extension candidates. Maximal degree in co-relation 5561. Up to 483 conditions per place. [2024-06-14 15:45:00,127 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 111 selfloop transitions, 90 changer transitions 0/203 dead transitions. [2024-06-14 15:45:00,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 203 transitions, 2563 flow [2024-06-14 15:45:00,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:45:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:45:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 15:45:00,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 15:45:00,128 INFO L175 Difference]: Start difference. First operand has 211 places, 182 transitions, 1973 flow. Second operand 11 states and 135 transitions. [2024-06-14 15:45:00,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 203 transitions, 2563 flow [2024-06-14 15:45:00,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 203 transitions, 2379 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-14 15:45:00,252 INFO L231 Difference]: Finished difference. Result has 213 places, 182 transitions, 1973 flow [2024-06-14 15:45:00,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1789, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1973, PETRI_PLACES=213, PETRI_TRANSITIONS=182} [2024-06-14 15:45:00,254 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2024-06-14 15:45:00,255 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 182 transitions, 1973 flow [2024-06-14 15:45:00,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:00,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:00,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:00,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 15:45:00,255 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:45:00,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:00,256 INFO L85 PathProgramCache]: Analyzing trace with hash 340176159, now seen corresponding path program 2 times [2024-06-14 15:45:00,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:00,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980558016] [2024-06-14 15:45:00,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:00,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:05,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980558016] [2024-06-14 15:45:05,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980558016] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:05,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:05,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:05,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225859773] [2024-06-14 15:45:05,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:05,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:05,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:05,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:05,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:06,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:06,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 182 transitions, 1973 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:06,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:06,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:06,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:06,478 INFO L124 PetriNetUnfolderBase]: 453/808 cut-off events. [2024-06-14 15:45:06,479 INFO L125 PetriNetUnfolderBase]: For 62216/62216 co-relation queries the response was YES. [2024-06-14 15:45:06,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5500 conditions, 808 events. 453/808 cut-off events. For 62216/62216 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3798 event pairs, 54 based on Foata normal form. 2/808 useless extension candidates. Maximal degree in co-relation 5401. Up to 610 conditions per place. [2024-06-14 15:45:06,486 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 148 selfloop transitions, 48 changer transitions 0/198 dead transitions. [2024-06-14 15:45:06,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 198 transitions, 2401 flow [2024-06-14 15:45:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:45:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:45:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:45:06,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:45:06,487 INFO L175 Difference]: Start difference. First operand has 213 places, 182 transitions, 1973 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:45:06,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 198 transitions, 2401 flow [2024-06-14 15:45:06,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 198 transitions, 2219 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-14 15:45:06,598 INFO L231 Difference]: Finished difference. Result has 213 places, 182 transitions, 1892 flow [2024-06-14 15:45:06,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1791, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1892, PETRI_PLACES=213, PETRI_TRANSITIONS=182} [2024-06-14 15:45:06,598 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2024-06-14 15:45:06,599 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 182 transitions, 1892 flow [2024-06-14 15:45:06,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:06,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:06,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:06,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 15:45:06,599 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:45:06,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:06,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1213910329, now seen corresponding path program 3 times [2024-06-14 15:45:06,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:06,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877207403] [2024-06-14 15:45:06,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:06,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:12,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:12,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877207403] [2024-06-14 15:45:12,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877207403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:12,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:12,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:12,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076138018] [2024-06-14 15:45:12,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:12,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:12,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:12,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:12,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:12,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:12,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 182 transitions, 1892 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:12,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:12,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:12,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:13,381 INFO L124 PetriNetUnfolderBase]: 459/818 cut-off events. [2024-06-14 15:45:13,381 INFO L125 PetriNetUnfolderBase]: For 63520/63520 co-relation queries the response was YES. [2024-06-14 15:45:13,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5479 conditions, 818 events. 459/818 cut-off events. For 63520/63520 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3838 event pairs, 48 based on Foata normal form. 2/818 useless extension candidates. Maximal degree in co-relation 5379. Up to 589 conditions per place. [2024-06-14 15:45:13,387 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 145 selfloop transitions, 55 changer transitions 0/202 dead transitions. [2024-06-14 15:45:13,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 202 transitions, 2354 flow [2024-06-14 15:45:13,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:45:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:45:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 15:45:13,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:45:13,388 INFO L175 Difference]: Start difference. First operand has 213 places, 182 transitions, 1892 flow. Second operand 10 states and 128 transitions. [2024-06-14 15:45:13,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 202 transitions, 2354 flow [2024-06-14 15:45:13,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 202 transitions, 2124 flow, removed 9 selfloop flow, removed 11 redundant places. [2024-06-14 15:45:13,504 INFO L231 Difference]: Finished difference. Result has 212 places, 184 transitions, 1803 flow [2024-06-14 15:45:13,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1662, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1803, PETRI_PLACES=212, PETRI_TRANSITIONS=184} [2024-06-14 15:45:13,505 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 181 predicate places. [2024-06-14 15:45:13,505 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 184 transitions, 1803 flow [2024-06-14 15:45:13,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:13,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:13,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:13,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 15:45:13,506 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:45:13,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:13,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1213910143, now seen corresponding path program 5 times [2024-06-14 15:45:13,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:13,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457946892] [2024-06-14 15:45:13,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:13,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:20,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:20,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457946892] [2024-06-14 15:45:20,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457946892] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:20,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:20,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:20,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263620761] [2024-06-14 15:45:20,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:20,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:20,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:20,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:20,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:20,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:20,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 184 transitions, 1803 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:20,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:20,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:20,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:21,086 INFO L124 PetriNetUnfolderBase]: 463/826 cut-off events. [2024-06-14 15:45:21,086 INFO L125 PetriNetUnfolderBase]: For 64976/64976 co-relation queries the response was YES. [2024-06-14 15:45:21,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5386 conditions, 826 events. 463/826 cut-off events. For 64976/64976 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3884 event pairs, 64 based on Foata normal form. 2/826 useless extension candidates. Maximal degree in co-relation 5287. Up to 709 conditions per place. [2024-06-14 15:45:21,093 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 157 selfloop transitions, 41 changer transitions 0/200 dead transitions. [2024-06-14 15:45:21,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 200 transitions, 2240 flow [2024-06-14 15:45:21,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:45:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:45:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-14 15:45:21,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36079545454545453 [2024-06-14 15:45:21,096 INFO L175 Difference]: Start difference. First operand has 212 places, 184 transitions, 1803 flow. Second operand 11 states and 127 transitions. [2024-06-14 15:45:21,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 200 transitions, 2240 flow [2024-06-14 15:45:21,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 200 transitions, 2119 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 15:45:21,232 INFO L231 Difference]: Finished difference. Result has 215 places, 185 transitions, 1777 flow [2024-06-14 15:45:21,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1682, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1777, PETRI_PLACES=215, PETRI_TRANSITIONS=185} [2024-06-14 15:45:21,232 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 184 predicate places. [2024-06-14 15:45:21,232 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 185 transitions, 1777 flow [2024-06-14 15:45:21,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:21,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:21,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:21,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 15:45:21,233 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:45:21,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1213732513, now seen corresponding path program 6 times [2024-06-14 15:45:21,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:21,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314344699] [2024-06-14 15:45:21,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:21,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:27,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:45:27,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:27,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314344699] [2024-06-14 15:45:27,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314344699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:27,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:27,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:27,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065261622] [2024-06-14 15:45:27,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:27,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:27,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:27,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:27,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:27,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:27,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 185 transitions, 1777 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:27,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:27,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:27,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:28,120 INFO L124 PetriNetUnfolderBase]: 474/847 cut-off events. [2024-06-14 15:45:28,120 INFO L125 PetriNetUnfolderBase]: For 72045/72045 co-relation queries the response was YES. [2024-06-14 15:45:28,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5571 conditions, 847 events. 474/847 cut-off events. For 72045/72045 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4047 event pairs, 63 based on Foata normal form. 2/847 useless extension candidates. Maximal degree in co-relation 5471. Up to 701 conditions per place. [2024-06-14 15:45:28,128 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 156 selfloop transitions, 46 changer transitions 0/204 dead transitions. [2024-06-14 15:45:28,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 204 transitions, 2385 flow [2024-06-14 15:45:28,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:45:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:45:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-14 15:45:28,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2024-06-14 15:45:28,131 INFO L175 Difference]: Start difference. First operand has 215 places, 185 transitions, 1777 flow. Second operand 11 states and 130 transitions. [2024-06-14 15:45:28,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 204 transitions, 2385 flow [2024-06-14 15:45:28,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 204 transitions, 2301 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:45:28,286 INFO L231 Difference]: Finished difference. Result has 217 places, 187 transitions, 1809 flow [2024-06-14 15:45:28,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1693, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1809, PETRI_PLACES=217, PETRI_TRANSITIONS=187} [2024-06-14 15:45:28,286 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-14 15:45:28,287 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 187 transitions, 1809 flow [2024-06-14 15:45:28,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:28,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:28,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:28,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 15:45:28,287 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:45:28,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1382639549, now seen corresponding path program 4 times [2024-06-14 15:45:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:28,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840568103] [2024-06-14 15:45:28,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:28,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:34,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:34,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840568103] [2024-06-14 15:45:34,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840568103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:34,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:34,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:34,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736188132] [2024-06-14 15:45:34,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:34,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:34,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:34,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:34,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:34,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:34,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 187 transitions, 1809 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:34,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:34,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:34,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:34,906 INFO L124 PetriNetUnfolderBase]: 480/857 cut-off events. [2024-06-14 15:45:34,906 INFO L125 PetriNetUnfolderBase]: For 74400/74400 co-relation queries the response was YES. [2024-06-14 15:45:34,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 857 events. 480/857 cut-off events. For 74400/74400 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4098 event pairs, 53 based on Foata normal form. 2/857 useless extension candidates. Maximal degree in co-relation 5567. Up to 638 conditions per place. [2024-06-14 15:45:34,913 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 149 selfloop transitions, 56 changer transitions 0/207 dead transitions. [2024-06-14 15:45:34,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 207 transitions, 2285 flow [2024-06-14 15:45:34,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:45:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:45:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 15:45:34,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 15:45:34,915 INFO L175 Difference]: Start difference. First operand has 217 places, 187 transitions, 1809 flow. Second operand 11 states and 135 transitions. [2024-06-14 15:45:34,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 207 transitions, 2285 flow [2024-06-14 15:45:35,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 207 transitions, 2221 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:45:35,070 INFO L231 Difference]: Finished difference. Result has 221 places, 189 transitions, 1892 flow [2024-06-14 15:45:35,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1745, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1892, PETRI_PLACES=221, PETRI_TRANSITIONS=189} [2024-06-14 15:45:35,071 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 190 predicate places. [2024-06-14 15:45:35,071 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 189 transitions, 1892 flow [2024-06-14 15:45:35,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:35,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:35,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:35,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 15:45:35,071 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:45:35,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:35,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1213737163, now seen corresponding path program 7 times [2024-06-14 15:45:35,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:35,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733423844] [2024-06-14 15:45:35,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:35,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:41,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:41,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733423844] [2024-06-14 15:45:41,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733423844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:41,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:41,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:41,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024305758] [2024-06-14 15:45:41,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:41,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:41,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:41,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:41,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:41,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:41,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 189 transitions, 1892 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:41,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:41,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:41,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:41,946 INFO L124 PetriNetUnfolderBase]: 477/852 cut-off events. [2024-06-14 15:45:41,947 INFO L125 PetriNetUnfolderBase]: For 70459/70459 co-relation queries the response was YES. [2024-06-14 15:45:41,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5634 conditions, 852 events. 477/852 cut-off events. For 70459/70459 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4065 event pairs, 66 based on Foata normal form. 2/852 useless extension candidates. Maximal degree in co-relation 5531. Up to 729 conditions per place. [2024-06-14 15:45:41,954 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 158 selfloop transitions, 44 changer transitions 0/204 dead transitions. [2024-06-14 15:45:41,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 204 transitions, 2330 flow [2024-06-14 15:45:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:45:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:45:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-14 15:45:41,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 15:45:41,956 INFO L175 Difference]: Start difference. First operand has 221 places, 189 transitions, 1892 flow. Second operand 11 states and 128 transitions. [2024-06-14 15:45:41,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 204 transitions, 2330 flow [2024-06-14 15:45:42,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 204 transitions, 2201 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:45:42,091 INFO L231 Difference]: Finished difference. Result has 223 places, 189 transitions, 1855 flow [2024-06-14 15:45:42,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1763, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1855, PETRI_PLACES=223, PETRI_TRANSITIONS=189} [2024-06-14 15:45:42,092 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 192 predicate places. [2024-06-14 15:45:42,092 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 189 transitions, 1855 flow [2024-06-14 15:45:42,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:42,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:42,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:42,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 15:45:42,093 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:45:42,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:42,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1209148543, now seen corresponding path program 8 times [2024-06-14 15:45:42,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:42,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402229886] [2024-06-14 15:45:42,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:42,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:48,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:48,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402229886] [2024-06-14 15:45:48,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402229886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:48,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:48,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:48,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890552571] [2024-06-14 15:45:48,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:48,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:48,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:48,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:48,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:48,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:48,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 189 transitions, 1855 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:48,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:48,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:48,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:49,118 INFO L124 PetriNetUnfolderBase]: 488/873 cut-off events. [2024-06-14 15:45:49,119 INFO L125 PetriNetUnfolderBase]: For 78060/78060 co-relation queries the response was YES. [2024-06-14 15:45:49,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5825 conditions, 873 events. 488/873 cut-off events. For 78060/78060 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4227 event pairs, 63 based on Foata normal form. 2/873 useless extension candidates. Maximal degree in co-relation 5721. Up to 680 conditions per place. [2024-06-14 15:45:49,126 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 155 selfloop transitions, 52 changer transitions 0/209 dead transitions. [2024-06-14 15:45:49,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 209 transitions, 2485 flow [2024-06-14 15:45:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:45:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:45:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-14 15:45:49,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:45:49,129 INFO L175 Difference]: Start difference. First operand has 223 places, 189 transitions, 1855 flow. Second operand 11 states and 132 transitions. [2024-06-14 15:45:49,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 209 transitions, 2485 flow [2024-06-14 15:45:49,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 209 transitions, 2391 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-14 15:45:49,285 INFO L231 Difference]: Finished difference. Result has 224 places, 191 transitions, 1893 flow [2024-06-14 15:45:49,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1893, PETRI_PLACES=224, PETRI_TRANSITIONS=191} [2024-06-14 15:45:49,286 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 193 predicate places. [2024-06-14 15:45:49,286 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 191 transitions, 1893 flow [2024-06-14 15:45:49,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:49,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:49,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:49,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 15:45:49,286 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:45:49,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:49,287 INFO L85 PathProgramCache]: Analyzing trace with hash 839784369, now seen corresponding path program 5 times [2024-06-14 15:45:49,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:49,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192219222] [2024-06-14 15:45:49,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:49,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:55,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:55,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192219222] [2024-06-14 15:45:55,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192219222] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:55,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:55,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:55,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590347338] [2024-06-14 15:45:55,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:55,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:55,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:55,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:55,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:55,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:45:55,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 191 transitions, 1893 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:55,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:55,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:45:55,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:55,871 INFO L124 PetriNetUnfolderBase]: 494/883 cut-off events. [2024-06-14 15:45:55,872 INFO L125 PetriNetUnfolderBase]: For 80501/80501 co-relation queries the response was YES. [2024-06-14 15:45:55,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5938 conditions, 883 events. 494/883 cut-off events. For 80501/80501 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4279 event pairs, 61 based on Foata normal form. 2/883 useless extension candidates. Maximal degree in co-relation 5833. Up to 649 conditions per place. [2024-06-14 15:45:55,879 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 148 selfloop transitions, 60 changer transitions 0/210 dead transitions. [2024-06-14 15:45:55,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 210 transitions, 2377 flow [2024-06-14 15:45:55,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:45:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:45:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 15:45:55,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:45:55,880 INFO L175 Difference]: Start difference. First operand has 224 places, 191 transitions, 1893 flow. Second operand 10 states and 128 transitions. [2024-06-14 15:45:55,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 210 transitions, 2377 flow [2024-06-14 15:45:56,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 210 transitions, 2304 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 15:45:56,021 INFO L231 Difference]: Finished difference. Result has 227 places, 193 transitions, 1979 flow [2024-06-14 15:45:56,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1979, PETRI_PLACES=227, PETRI_TRANSITIONS=193} [2024-06-14 15:45:56,021 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 196 predicate places. [2024-06-14 15:45:56,021 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 193 transitions, 1979 flow [2024-06-14 15:45:56,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:56,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:56,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:56,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 15:45:56,022 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:45:56,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:56,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1209268513, now seen corresponding path program 9 times [2024-06-14 15:45:56,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:56,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041698274] [2024-06-14 15:45:56,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:56,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:02,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:02,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041698274] [2024-06-14 15:46:02,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041698274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:02,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:02,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:46:02,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947322880] [2024-06-14 15:46:02,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:02,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:46:02,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:02,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:46:02,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:46:02,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:02,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 193 transitions, 1979 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:02,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:02,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:02,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:02,861 INFO L124 PetriNetUnfolderBase]: 498/891 cut-off events. [2024-06-14 15:46:02,861 INFO L125 PetriNetUnfolderBase]: For 82362/82362 co-relation queries the response was YES. [2024-06-14 15:46:02,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6100 conditions, 891 events. 498/891 cut-off events. For 82362/82362 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4327 event pairs, 73 based on Foata normal form. 2/891 useless extension candidates. Maximal degree in co-relation 5993. Up to 759 conditions per place. [2024-06-14 15:46:02,869 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 159 selfloop transitions, 48 changer transitions 0/209 dead transitions. [2024-06-14 15:46:02,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 209 transitions, 2438 flow [2024-06-14 15:46:02,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-14 15:46:02,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3664772727272727 [2024-06-14 15:46:02,871 INFO L175 Difference]: Start difference. First operand has 227 places, 193 transitions, 1979 flow. Second operand 11 states and 129 transitions. [2024-06-14 15:46:02,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 209 transitions, 2438 flow [2024-06-14 15:46:03,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 209 transitions, 2299 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:46:03,079 INFO L231 Difference]: Finished difference. Result has 230 places, 194 transitions, 1953 flow [2024-06-14 15:46:03,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1840, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1953, PETRI_PLACES=230, PETRI_TRANSITIONS=194} [2024-06-14 15:46:03,080 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 199 predicate places. [2024-06-14 15:46:03,080 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 194 transitions, 1953 flow [2024-06-14 15:46:03,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:03,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:03,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:03,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 15:46:03,081 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:46:03,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:03,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1209263863, now seen corresponding path program 10 times [2024-06-14 15:46:03,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:03,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472286207] [2024-06-14 15:46:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:03,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:09,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:09,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472286207] [2024-06-14 15:46:09,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472286207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:09,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:09,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:46:09,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142775590] [2024-06-14 15:46:09,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:09,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:46:09,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:09,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:46:09,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:46:09,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:09,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 194 transitions, 1953 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:09,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:09,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:09,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:10,165 INFO L124 PetriNetUnfolderBase]: 495/886 cut-off events. [2024-06-14 15:46:10,165 INFO L125 PetriNetUnfolderBase]: For 78027/78027 co-relation queries the response was YES. [2024-06-14 15:46:10,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5879 conditions, 886 events. 495/886 cut-off events. For 78027/78027 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4312 event pairs, 58 based on Foata normal form. 2/886 useless extension candidates. Maximal degree in co-relation 5771. Up to 650 conditions per place. [2024-06-14 15:46:10,173 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 152 selfloop transitions, 59 changer transitions 0/213 dead transitions. [2024-06-14 15:46:10,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 213 transitions, 2417 flow [2024-06-14 15:46:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-14 15:46:10,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-14 15:46:10,174 INFO L175 Difference]: Start difference. First operand has 230 places, 194 transitions, 1953 flow. Second operand 11 states and 137 transitions. [2024-06-14 15:46:10,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 213 transitions, 2417 flow [2024-06-14 15:46:10,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 213 transitions, 2315 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:46:10,325 INFO L231 Difference]: Finished difference. Result has 232 places, 194 transitions, 1973 flow [2024-06-14 15:46:10,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1851, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1973, PETRI_PLACES=232, PETRI_TRANSITIONS=194} [2024-06-14 15:46:10,325 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 201 predicate places. [2024-06-14 15:46:10,325 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 194 transitions, 1973 flow [2024-06-14 15:46:10,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:10,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:10,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:10,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 15:46:10,326 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:46:10,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:10,327 INFO L85 PathProgramCache]: Analyzing trace with hash 334813217, now seen corresponding path program 11 times [2024-06-14 15:46:10,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:10,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602037228] [2024-06-14 15:46:10,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:10,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:16,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:46:16,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602037228] [2024-06-14 15:46:16,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602037228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:16,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:16,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:46:16,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277453720] [2024-06-14 15:46:16,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:16,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:46:16,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:16,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:46:16,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:46:16,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:16,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 194 transitions, 1973 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:16,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:16,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:16,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:17,373 INFO L124 PetriNetUnfolderBase]: 499/894 cut-off events. [2024-06-14 15:46:17,373 INFO L125 PetriNetUnfolderBase]: For 79817/79817 co-relation queries the response was YES. [2024-06-14 15:46:17,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5968 conditions, 894 events. 499/894 cut-off events. For 79817/79817 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4346 event pairs, 52 based on Foata normal form. 2/894 useless extension candidates. Maximal degree in co-relation 5859. Up to 625 conditions per place. [2024-06-14 15:46:17,381 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 144 selfloop transitions, 73 changer transitions 0/219 dead transitions. [2024-06-14 15:46:17,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 219 transitions, 2636 flow [2024-06-14 15:46:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-14 15:46:17,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-14 15:46:17,382 INFO L175 Difference]: Start difference. First operand has 232 places, 194 transitions, 1973 flow. Second operand 11 states and 139 transitions. [2024-06-14 15:46:17,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 219 transitions, 2636 flow [2024-06-14 15:46:17,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 219 transitions, 2474 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-14 15:46:17,543 INFO L231 Difference]: Finished difference. Result has 232 places, 195 transitions, 1972 flow [2024-06-14 15:46:17,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1972, PETRI_PLACES=232, PETRI_TRANSITIONS=195} [2024-06-14 15:46:17,544 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 201 predicate places. [2024-06-14 15:46:17,544 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 195 transitions, 1972 flow [2024-06-14 15:46:17,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:17,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:17,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:17,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 15:46:17,545 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:46:17,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:17,545 INFO L85 PathProgramCache]: Analyzing trace with hash 334928537, now seen corresponding path program 12 times [2024-06-14 15:46:17,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:17,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891796816] [2024-06-14 15:46:17,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:17,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:23,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:46:23,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:23,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891796816] [2024-06-14 15:46:23,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891796816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:23,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:23,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:46:23,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106288675] [2024-06-14 15:46:23,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:23,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:46:23,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:23,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:46:23,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:46:24,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:24,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 195 transitions, 1972 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:24,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:24,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:24,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:24,567 INFO L124 PetriNetUnfolderBase]: 510/915 cut-off events. [2024-06-14 15:46:24,568 INFO L125 PetriNetUnfolderBase]: For 88616/88616 co-relation queries the response was YES. [2024-06-14 15:46:24,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6187 conditions, 915 events. 510/915 cut-off events. For 88616/88616 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4513 event pairs, 69 based on Foata normal form. 2/915 useless extension candidates. Maximal degree in co-relation 6078. Up to 730 conditions per place. [2024-06-14 15:46:24,577 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 146 selfloop transitions, 72 changer transitions 0/220 dead transitions. [2024-06-14 15:46:24,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 220 transitions, 2652 flow [2024-06-14 15:46:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-14 15:46:24,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-14 15:46:24,579 INFO L175 Difference]: Start difference. First operand has 232 places, 195 transitions, 1972 flow. Second operand 11 states and 139 transitions. [2024-06-14 15:46:24,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 220 transitions, 2652 flow [2024-06-14 15:46:24,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 220 transitions, 2375 flow, removed 10 selfloop flow, removed 11 redundant places. [2024-06-14 15:46:24,764 INFO L231 Difference]: Finished difference. Result has 232 places, 197 transitions, 1871 flow [2024-06-14 15:46:24,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1871, PETRI_PLACES=232, PETRI_TRANSITIONS=197} [2024-06-14 15:46:24,765 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 201 predicate places. [2024-06-14 15:46:24,765 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 197 transitions, 1871 flow [2024-06-14 15:46:24,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:24,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:24,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:24,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 15:46:24,765 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:46:24,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:24,766 INFO L85 PathProgramCache]: Analyzing trace with hash 334933373, now seen corresponding path program 6 times [2024-06-14 15:46:24,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:24,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593810470] [2024-06-14 15:46:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:30,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:46:30,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:30,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593810470] [2024-06-14 15:46:30,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593810470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:30,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:30,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:46:30,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137530414] [2024-06-14 15:46:30,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:30,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:46:30,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:30,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:46:30,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:46:30,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:30,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 197 transitions, 1871 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:30,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:30,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:30,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:31,267 INFO L124 PetriNetUnfolderBase]: 516/925 cut-off events. [2024-06-14 15:46:31,268 INFO L125 PetriNetUnfolderBase]: For 90777/90777 co-relation queries the response was YES. [2024-06-14 15:46:31,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5985 conditions, 925 events. 516/925 cut-off events. For 90777/90777 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4564 event pairs, 60 based on Foata normal form. 2/925 useless extension candidates. Maximal degree in co-relation 5877. Up to 607 conditions per place. [2024-06-14 15:46:31,277 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 138 selfloop transitions, 83 changer transitions 0/223 dead transitions. [2024-06-14 15:46:31,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 223 transitions, 2569 flow [2024-06-14 15:46:31,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:46:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:46:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-14 15:46:31,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-14 15:46:31,278 INFO L175 Difference]: Start difference. First operand has 232 places, 197 transitions, 1871 flow. Second operand 10 states and 136 transitions. [2024-06-14 15:46:31,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 223 transitions, 2569 flow [2024-06-14 15:46:31,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 223 transitions, 2468 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:31,460 INFO L231 Difference]: Finished difference. Result has 235 places, 199 transitions, 1975 flow [2024-06-14 15:46:31,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1975, PETRI_PLACES=235, PETRI_TRANSITIONS=199} [2024-06-14 15:46:31,460 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 204 predicate places. [2024-06-14 15:46:31,461 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 199 transitions, 1975 flow [2024-06-14 15:46:31,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:31,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:31,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:31,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 15:46:31,462 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:46:31,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:31,462 INFO L85 PathProgramCache]: Analyzing trace with hash 334933187, now seen corresponding path program 13 times [2024-06-14 15:46:31,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:31,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387250565] [2024-06-14 15:46:31,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:31,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:37,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:37,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387250565] [2024-06-14 15:46:37,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387250565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:37,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:37,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:46:37,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453782595] [2024-06-14 15:46:37,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:37,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:46:37,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:37,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:46:37,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:46:38,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:38,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 199 transitions, 1975 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:38,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:38,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:38,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:38,642 INFO L124 PetriNetUnfolderBase]: 513/920 cut-off events. [2024-06-14 15:46:38,642 INFO L125 PetriNetUnfolderBase]: For 86048/86048 co-relation queries the response was YES. [2024-06-14 15:46:38,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5980 conditions, 920 events. 513/920 cut-off events. For 86048/86048 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4535 event pairs, 57 based on Foata normal form. 2/920 useless extension candidates. Maximal degree in co-relation 5870. Up to 627 conditions per place. [2024-06-14 15:46:38,649 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 132 selfloop transitions, 90 changer transitions 0/224 dead transitions. [2024-06-14 15:46:38,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 224 transitions, 2645 flow [2024-06-14 15:46:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-14 15:46:38,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:46:38,650 INFO L175 Difference]: Start difference. First operand has 235 places, 199 transitions, 1975 flow. Second operand 11 states and 143 transitions. [2024-06-14 15:46:38,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 224 transitions, 2645 flow [2024-06-14 15:46:38,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 224 transitions, 2431 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 15:46:38,826 INFO L231 Difference]: Finished difference. Result has 238 places, 199 transitions, 1945 flow [2024-06-14 15:46:38,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1761, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1945, PETRI_PLACES=238, PETRI_TRANSITIONS=199} [2024-06-14 15:46:38,826 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 207 predicate places. [2024-06-14 15:46:38,827 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 199 transitions, 1945 flow [2024-06-14 15:46:38,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:38,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:38,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:38,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 15:46:38,827 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:46:38,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash 508477017, now seen corresponding path program 14 times [2024-06-14 15:46:38,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:38,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127027271] [2024-06-14 15:46:38,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:38,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:45,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:45,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127027271] [2024-06-14 15:46:45,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127027271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:45,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:45,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:46:45,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978516232] [2024-06-14 15:46:45,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:45,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:46:45,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:45,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:46:45,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:46:45,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:45,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 199 transitions, 1945 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:45,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:45,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:45,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:46,034 INFO L124 PetriNetUnfolderBase]: 533/964 cut-off events. [2024-06-14 15:46:46,034 INFO L125 PetriNetUnfolderBase]: For 123880/123880 co-relation queries the response was YES. [2024-06-14 15:46:46,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6090 conditions, 964 events. 533/964 cut-off events. For 123880/123880 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4793 event pairs, 64 based on Foata normal form. 12/974 useless extension candidates. Maximal degree in co-relation 5979. Up to 715 conditions per place. [2024-06-14 15:46:46,040 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 159 selfloop transitions, 57 changer transitions 8/226 dead transitions. [2024-06-14 15:46:46,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 226 transitions, 2474 flow [2024-06-14 15:46:46,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:46,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-14 15:46:46,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2024-06-14 15:46:46,041 INFO L175 Difference]: Start difference. First operand has 238 places, 199 transitions, 1945 flow. Second operand 11 states and 142 transitions. [2024-06-14 15:46:46,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 226 transitions, 2474 flow [2024-06-14 15:46:46,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 226 transitions, 2292 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-14 15:46:46,213 INFO L231 Difference]: Finished difference. Result has 239 places, 197 transitions, 1862 flow [2024-06-14 15:46:46,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1763, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1862, PETRI_PLACES=239, PETRI_TRANSITIONS=197} [2024-06-14 15:46:46,214 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 208 predicate places. [2024-06-14 15:46:46,214 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 197 transitions, 1862 flow [2024-06-14 15:46:46,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:46,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:46,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:46,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 15:46:46,215 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:46:46,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:46,215 INFO L85 PathProgramCache]: Analyzing trace with hash 508299387, now seen corresponding path program 15 times [2024-06-14 15:46:46,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:46,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988845187] [2024-06-14 15:46:46,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:46,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:52,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:52,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988845187] [2024-06-14 15:46:52,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988845187] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:52,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:52,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:46:52,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344541692] [2024-06-14 15:46:52,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:52,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:46:52,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:52,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:46:52,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:46:52,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:52,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 197 transitions, 1862 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:52,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:52,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:52,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:53,095 INFO L124 PetriNetUnfolderBase]: 540/981 cut-off events. [2024-06-14 15:46:53,096 INFO L125 PetriNetUnfolderBase]: For 126868/126868 co-relation queries the response was YES. [2024-06-14 15:46:53,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6921 conditions, 981 events. 540/981 cut-off events. For 126868/126868 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4937 event pairs, 75 based on Foata normal form. 2/981 useless extension candidates. Maximal degree in co-relation 6809. Up to 705 conditions per place. [2024-06-14 15:46:53,104 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 161 selfloop transitions, 62 changer transitions 0/225 dead transitions. [2024-06-14 15:46:53,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 225 transitions, 2568 flow [2024-06-14 15:46:53,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-14 15:46:53,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 15:46:53,105 INFO L175 Difference]: Start difference. First operand has 239 places, 197 transitions, 1862 flow. Second operand 11 states and 143 transitions. [2024-06-14 15:46:53,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 225 transitions, 2568 flow [2024-06-14 15:46:53,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 225 transitions, 2444 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:46:53,351 INFO L231 Difference]: Finished difference. Result has 240 places, 199 transitions, 1890 flow [2024-06-14 15:46:53,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1890, PETRI_PLACES=240, PETRI_TRANSITIONS=199} [2024-06-14 15:46:53,352 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 209 predicate places. [2024-06-14 15:46:53,352 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 199 transitions, 1890 flow [2024-06-14 15:46:53,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:53,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:53,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:53,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 15:46:53,352 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:46:53,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash 508304223, now seen corresponding path program 7 times [2024-06-14 15:46:53,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:53,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357195456] [2024-06-14 15:46:53,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:53,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:58,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:58,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357195456] [2024-06-14 15:46:58,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357195456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:58,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:58,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:46:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432696540] [2024-06-14 15:46:58,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:58,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:46:58,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:58,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:46:58,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:46:58,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:46:58,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 199 transitions, 1890 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:58,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:58,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:46:58,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:59,299 INFO L124 PetriNetUnfolderBase]: 556/1007 cut-off events. [2024-06-14 15:46:59,300 INFO L125 PetriNetUnfolderBase]: For 137672/137672 co-relation queries the response was YES. [2024-06-14 15:46:59,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7304 conditions, 1007 events. 556/1007 cut-off events. For 137672/137672 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5050 event pairs, 74 based on Foata normal form. 2/1007 useless extension candidates. Maximal degree in co-relation 7191. Up to 771 conditions per place. [2024-06-14 15:46:59,310 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 158 selfloop transitions, 66 changer transitions 0/226 dead transitions. [2024-06-14 15:46:59,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 226 transitions, 2632 flow [2024-06-14 15:46:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:46:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:46:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-14 15:46:59,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-14 15:46:59,316 INFO L175 Difference]: Start difference. First operand has 240 places, 199 transitions, 1890 flow. Second operand 10 states and 136 transitions. [2024-06-14 15:46:59,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 226 transitions, 2632 flow [2024-06-14 15:46:59,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 226 transitions, 2540 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:59,595 INFO L231 Difference]: Finished difference. Result has 243 places, 203 transitions, 2007 flow [2024-06-14 15:46:59,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1798, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2007, PETRI_PLACES=243, PETRI_TRANSITIONS=203} [2024-06-14 15:46:59,595 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 212 predicate places. [2024-06-14 15:46:59,596 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 203 transitions, 2007 flow [2024-06-14 15:46:59,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:59,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:59,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:59,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 15:46:59,596 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:46:59,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash 512064707, now seen corresponding path program 16 times [2024-06-14 15:46:59,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:59,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522938113] [2024-06-14 15:46:59,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:59,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:05,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:05,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522938113] [2024-06-14 15:47:05,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522938113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:05,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:05,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:05,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111203042] [2024-06-14 15:47:05,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:05,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:05,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:05,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:05,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:05,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:05,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 203 transitions, 2007 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:05,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:05,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:05,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:06,383 INFO L124 PetriNetUnfolderBase]: 582/1061 cut-off events. [2024-06-14 15:47:06,383 INFO L125 PetriNetUnfolderBase]: For 186477/186477 co-relation queries the response was YES. [2024-06-14 15:47:06,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7645 conditions, 1061 events. 582/1061 cut-off events. For 186477/186477 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5448 event pairs, 84 based on Foata normal form. 14/1073 useless extension candidates. Maximal degree in co-relation 7530. Up to 812 conditions per place. [2024-06-14 15:47:06,392 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 169 selfloop transitions, 50 changer transitions 8/229 dead transitions. [2024-06-14 15:47:06,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 229 transitions, 2570 flow [2024-06-14 15:47:06,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:47:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:47:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-14 15:47:06,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-14 15:47:06,393 INFO L175 Difference]: Start difference. First operand has 243 places, 203 transitions, 2007 flow. Second operand 11 states and 139 transitions. [2024-06-14 15:47:06,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 229 transitions, 2570 flow [2024-06-14 15:47:06,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 229 transitions, 2461 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 15:47:06,664 INFO L231 Difference]: Finished difference. Result has 249 places, 203 transitions, 2014 flow [2024-06-14 15:47:06,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2014, PETRI_PLACES=249, PETRI_TRANSITIONS=203} [2024-06-14 15:47:06,665 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-14 15:47:06,665 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 203 transitions, 2014 flow [2024-06-14 15:47:06,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:06,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:06,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:06,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 15:47:06,665 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:47:06,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:06,666 INFO L85 PathProgramCache]: Analyzing trace with hash 680967093, now seen corresponding path program 8 times [2024-06-14 15:47:06,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:06,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413763656] [2024-06-14 15:47:06,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:06,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:12,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:12,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413763656] [2024-06-14 15:47:12,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413763656] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:12,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:12,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:12,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860724230] [2024-06-14 15:47:12,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:12,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:12,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:12,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:12,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:13,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:13,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 203 transitions, 2014 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:13,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:13,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:13,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:13,457 INFO L124 PetriNetUnfolderBase]: 562/1021 cut-off events. [2024-06-14 15:47:13,457 INFO L125 PetriNetUnfolderBase]: For 147263/147263 co-relation queries the response was YES. [2024-06-14 15:47:13,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7635 conditions, 1021 events. 562/1021 cut-off events. For 147263/147263 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5176 event pairs, 78 based on Foata normal form. 2/1021 useless extension candidates. Maximal degree in co-relation 7517. Up to 800 conditions per place. [2024-06-14 15:47:13,465 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 167 selfloop transitions, 54 changer transitions 0/223 dead transitions. [2024-06-14 15:47:13,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 223 transitions, 2534 flow [2024-06-14 15:47:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:47:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:47:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:47:13,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-14 15:47:13,466 INFO L175 Difference]: Start difference. First operand has 249 places, 203 transitions, 2014 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:47:13,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 223 transitions, 2534 flow [2024-06-14 15:47:13,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 223 transitions, 2421 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:47:13,750 INFO L231 Difference]: Finished difference. Result has 249 places, 205 transitions, 2056 flow [2024-06-14 15:47:13,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2056, PETRI_PLACES=249, PETRI_TRANSITIONS=205} [2024-06-14 15:47:13,751 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-14 15:47:13,751 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 205 transitions, 2056 flow [2024-06-14 15:47:13,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:13,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:13,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:13,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 15:47:13,751 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:47:13,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash 339575003, now seen corresponding path program 9 times [2024-06-14 15:47:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:13,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436236125] [2024-06-14 15:47:13,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:20,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:20,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436236125] [2024-06-14 15:47:20,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436236125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:20,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:20,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:20,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575340346] [2024-06-14 15:47:20,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:20,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:20,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:20,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:20,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:20,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:20,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 205 transitions, 2056 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:20,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:20,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:20,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:20,637 INFO L124 PetriNetUnfolderBase]: 558/1015 cut-off events. [2024-06-14 15:47:20,638 INFO L125 PetriNetUnfolderBase]: For 139468/139468 co-relation queries the response was YES. [2024-06-14 15:47:20,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7423 conditions, 1015 events. 558/1015 cut-off events. For 139468/139468 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5174 event pairs, 79 based on Foata normal form. 2/1015 useless extension candidates. Maximal degree in co-relation 7305. Up to 816 conditions per place. [2024-06-14 15:47:20,647 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 167 selfloop transitions, 56 changer transitions 0/225 dead transitions. [2024-06-14 15:47:20,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 225 transitions, 2548 flow [2024-06-14 15:47:20,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:47:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:47:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 15:47:20,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-14 15:47:20,648 INFO L175 Difference]: Start difference. First operand has 249 places, 205 transitions, 2056 flow. Second operand 10 states and 129 transitions. [2024-06-14 15:47:20,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 225 transitions, 2548 flow [2024-06-14 15:47:20,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 225 transitions, 2393 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-14 15:47:20,921 INFO L231 Difference]: Finished difference. Result has 251 places, 205 transitions, 2018 flow [2024-06-14 15:47:20,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2018, PETRI_PLACES=251, PETRI_TRANSITIONS=205} [2024-06-14 15:47:20,922 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 220 predicate places. [2024-06-14 15:47:20,922 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 205 transitions, 2018 flow [2024-06-14 15:47:20,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:20,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:20,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:20,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 15:47:20,923 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:47:20,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:20,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1525275031, now seen corresponding path program 17 times [2024-06-14 15:47:20,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:20,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648557179] [2024-06-14 15:47:20,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:20,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:27,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:27,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648557179] [2024-06-14 15:47:27,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648557179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:27,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:27,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:27,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601185407] [2024-06-14 15:47:27,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:27,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:27,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:27,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:27,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:27,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:27,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 205 transitions, 2018 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:27,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:27,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:27,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:28,116 INFO L124 PetriNetUnfolderBase]: 555/1010 cut-off events. [2024-06-14 15:47:28,116 INFO L125 PetriNetUnfolderBase]: For 133929/133929 co-relation queries the response was YES. [2024-06-14 15:47:28,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7195 conditions, 1010 events. 555/1010 cut-off events. For 133929/133929 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5133 event pairs, 76 based on Foata normal form. 2/1010 useless extension candidates. Maximal degree in co-relation 7076. Up to 805 conditions per place. [2024-06-14 15:47:28,126 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 165 selfloop transitions, 59 changer transitions 0/226 dead transitions. [2024-06-14 15:47:28,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 226 transitions, 2514 flow [2024-06-14 15:47:28,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:47:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:47:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:47:28,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 15:47:28,128 INFO L175 Difference]: Start difference. First operand has 251 places, 205 transitions, 2018 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:47:28,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 226 transitions, 2514 flow [2024-06-14 15:47:28,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 226 transitions, 2392 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 15:47:28,409 INFO L231 Difference]: Finished difference. Result has 253 places, 205 transitions, 2018 flow [2024-06-14 15:47:28,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1896, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2018, PETRI_PLACES=253, PETRI_TRANSITIONS=205} [2024-06-14 15:47:28,410 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 222 predicate places. [2024-06-14 15:47:28,410 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 205 transitions, 2018 flow [2024-06-14 15:47:28,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:28,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:28,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:28,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 15:47:28,411 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:28,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:28,411 INFO L85 PathProgramCache]: Analyzing trace with hash 681213171, now seen corresponding path program 1 times [2024-06-14 15:47:28,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:28,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747336709] [2024-06-14 15:47:28,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:28,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:34,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:34,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747336709] [2024-06-14 15:47:34,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747336709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:34,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:34,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:47:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074488428] [2024-06-14 15:47:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:34,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:47:34,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:34,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:47:34,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:47:34,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:34,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 205 transitions, 2018 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:34,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:34,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:34,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:34,907 INFO L124 PetriNetUnfolderBase]: 563/1026 cut-off events. [2024-06-14 15:47:34,907 INFO L125 PetriNetUnfolderBase]: For 145473/145473 co-relation queries the response was YES. [2024-06-14 15:47:34,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7300 conditions, 1026 events. 563/1026 cut-off events. For 145473/145473 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5250 event pairs, 80 based on Foata normal form. 4/1028 useless extension candidates. Maximal degree in co-relation 7180. Up to 824 conditions per place. [2024-06-14 15:47:34,917 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 175 selfloop transitions, 46 changer transitions 0/223 dead transitions. [2024-06-14 15:47:34,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 223 transitions, 2522 flow [2024-06-14 15:47:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:47:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:47:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:47:34,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 15:47:34,918 INFO L175 Difference]: Start difference. First operand has 253 places, 205 transitions, 2018 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:47:34,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 223 transitions, 2522 flow [2024-06-14 15:47:35,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 223 transitions, 2393 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:47:35,201 INFO L231 Difference]: Finished difference. Result has 253 places, 207 transitions, 2016 flow [2024-06-14 15:47:35,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1889, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2016, PETRI_PLACES=253, PETRI_TRANSITIONS=207} [2024-06-14 15:47:35,202 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 222 predicate places. [2024-06-14 15:47:35,202 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 207 transitions, 2016 flow [2024-06-14 15:47:35,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:35,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:35,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:35,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 15:47:35,203 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:35,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:35,203 INFO L85 PathProgramCache]: Analyzing trace with hash 674710797, now seen corresponding path program 18 times [2024-06-14 15:47:35,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:35,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825809140] [2024-06-14 15:47:35,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:35,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:41,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:41,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825809140] [2024-06-14 15:47:41,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825809140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:41,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:41,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:41,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028777473] [2024-06-14 15:47:41,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:41,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:41,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:41,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:41,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:41,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:41,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 207 transitions, 2016 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:41,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:41,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:41,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:42,364 INFO L124 PetriNetUnfolderBase]: 583/1070 cut-off events. [2024-06-14 15:47:42,364 INFO L125 PetriNetUnfolderBase]: For 182644/182644 co-relation queries the response was YES. [2024-06-14 15:47:42,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7452 conditions, 1070 events. 583/1070 cut-off events. For 182644/182644 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5543 event pairs, 86 based on Foata normal form. 12/1080 useless extension candidates. Maximal degree in co-relation 7331. Up to 821 conditions per place. [2024-06-14 15:47:42,374 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 174 selfloop transitions, 48 changer transitions 8/232 dead transitions. [2024-06-14 15:47:42,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 232 transitions, 2557 flow [2024-06-14 15:47:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:47:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:47:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-14 15:47:42,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4005681818181818 [2024-06-14 15:47:42,375 INFO L175 Difference]: Start difference. First operand has 253 places, 207 transitions, 2016 flow. Second operand 11 states and 141 transitions. [2024-06-14 15:47:42,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 232 transitions, 2557 flow [2024-06-14 15:47:42,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 232 transitions, 2446 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:47:42,635 INFO L231 Difference]: Finished difference. Result has 256 places, 205 transitions, 1990 flow [2024-06-14 15:47:42,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1990, PETRI_PLACES=256, PETRI_TRANSITIONS=205} [2024-06-14 15:47:42,635 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 225 predicate places. [2024-06-14 15:47:42,636 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 205 transitions, 1990 flow [2024-06-14 15:47:42,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:42,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:42,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:42,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 15:47:42,636 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:42,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:42,636 INFO L85 PathProgramCache]: Analyzing trace with hash 505808783, now seen corresponding path program 10 times [2024-06-14 15:47:42,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:42,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77623878] [2024-06-14 15:47:42,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:42,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:48,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:48,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:48,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77623878] [2024-06-14 15:47:48,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77623878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:48,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:48,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:48,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858138803] [2024-06-14 15:47:48,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:48,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:48,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:48,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:48,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:49,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:49,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 205 transitions, 1990 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:49,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:49,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:49,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:49,590 INFO L124 PetriNetUnfolderBase]: 563/1030 cut-off events. [2024-06-14 15:47:49,590 INFO L125 PetriNetUnfolderBase]: For 142766/142766 co-relation queries the response was YES. [2024-06-14 15:47:49,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7345 conditions, 1030 events. 563/1030 cut-off events. For 142766/142766 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5308 event pairs, 84 based on Foata normal form. 2/1030 useless extension candidates. Maximal degree in co-relation 7223. Up to 831 conditions per place. [2024-06-14 15:47:49,601 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 175 selfloop transitions, 48 changer transitions 0/225 dead transitions. [2024-06-14 15:47:49,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 225 transitions, 2518 flow [2024-06-14 15:47:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:47:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:47:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 15:47:49,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:47:49,602 INFO L175 Difference]: Start difference. First operand has 256 places, 205 transitions, 1990 flow. Second operand 10 states and 128 transitions. [2024-06-14 15:47:49,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 225 transitions, 2518 flow [2024-06-14 15:47:49,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 225 transitions, 2403 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:47:49,956 INFO L231 Difference]: Finished difference. Result has 256 places, 207 transitions, 2022 flow [2024-06-14 15:47:49,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2022, PETRI_PLACES=256, PETRI_TRANSITIONS=207} [2024-06-14 15:47:49,956 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 225 predicate places. [2024-06-14 15:47:49,957 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 207 transitions, 2022 flow [2024-06-14 15:47:49,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:49,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:49,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:49,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 15:47:49,957 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:49,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:49,958 INFO L85 PathProgramCache]: Analyzing trace with hash 505630967, now seen corresponding path program 19 times [2024-06-14 15:47:49,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:49,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036682272] [2024-06-14 15:47:49,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:49,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:56,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:56,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036682272] [2024-06-14 15:47:56,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036682272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:56,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:56,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:56,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442399544] [2024-06-14 15:47:56,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:56,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:56,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:56,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:56,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:56,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:47:56,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 207 transitions, 2022 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:56,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:56,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:47:56,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:56,901 INFO L124 PetriNetUnfolderBase]: 574/1051 cut-off events. [2024-06-14 15:47:56,901 INFO L125 PetriNetUnfolderBase]: For 154873/154873 co-relation queries the response was YES. [2024-06-14 15:47:56,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7665 conditions, 1051 events. 574/1051 cut-off events. For 154873/154873 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5458 event pairs, 89 based on Foata normal form. 2/1051 useless extension candidates. Maximal degree in co-relation 7542. Up to 896 conditions per place. [2024-06-14 15:47:56,911 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 174 selfloop transitions, 50 changer transitions 0/226 dead transitions. [2024-06-14 15:47:56,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 226 transitions, 2732 flow [2024-06-14 15:47:56,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:47:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:47:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-14 15:47:56,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2024-06-14 15:47:56,913 INFO L175 Difference]: Start difference. First operand has 256 places, 207 transitions, 2022 flow. Second operand 11 states and 130 transitions. [2024-06-14 15:47:56,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 226 transitions, 2732 flow [2024-06-14 15:47:57,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 226 transitions, 2605 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 15:47:57,221 INFO L231 Difference]: Finished difference. Result has 259 places, 209 transitions, 2035 flow [2024-06-14 15:47:57,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2035, PETRI_PLACES=259, PETRI_TRANSITIONS=209} [2024-06-14 15:47:57,221 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 228 predicate places. [2024-06-14 15:47:57,221 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 209 transitions, 2035 flow [2024-06-14 15:47:57,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:57,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:57,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:57,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 15:47:57,222 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:57,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:57,222 INFO L85 PathProgramCache]: Analyzing trace with hash 505635617, now seen corresponding path program 20 times [2024-06-14 15:47:57,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:57,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100811720] [2024-06-14 15:47:57,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:57,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:03,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:03,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100811720] [2024-06-14 15:48:03,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100811720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:03,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:03,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:03,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414835580] [2024-06-14 15:48:03,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:03,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:03,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:03,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:03,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:03,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:03,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 209 transitions, 2035 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:03,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:03,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:03,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:04,166 INFO L124 PetriNetUnfolderBase]: 571/1046 cut-off events. [2024-06-14 15:48:04,166 INFO L125 PetriNetUnfolderBase]: For 148762/148762 co-relation queries the response was YES. [2024-06-14 15:48:04,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7444 conditions, 1046 events. 571/1046 cut-off events. For 148762/148762 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5412 event pairs, 88 based on Foata normal form. 2/1046 useless extension candidates. Maximal degree in co-relation 7320. Up to 920 conditions per place. [2024-06-14 15:48:04,176 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 175 selfloop transitions, 47 changer transitions 0/224 dead transitions. [2024-06-14 15:48:04,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 224 transitions, 2513 flow [2024-06-14 15:48:04,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:48:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:48:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-14 15:48:04,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 15:48:04,177 INFO L175 Difference]: Start difference. First operand has 259 places, 209 transitions, 2035 flow. Second operand 11 states and 128 transitions. [2024-06-14 15:48:04,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 224 transitions, 2513 flow [2024-06-14 15:48:04,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 224 transitions, 2428 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-14 15:48:04,478 INFO L231 Difference]: Finished difference. Result has 263 places, 209 transitions, 2048 flow [2024-06-14 15:48:04,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1950, PETRI_DIFFERENCE_MINUEND_PLACES=252, 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=11, PETRI_FLOW=2048, PETRI_PLACES=263, PETRI_TRANSITIONS=209} [2024-06-14 15:48:04,479 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 232 predicate places. [2024-06-14 15:48:04,479 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 209 transitions, 2048 flow [2024-06-14 15:48:04,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:04,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:04,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:04,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 15:48:04,480 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:04,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:04,480 INFO L85 PathProgramCache]: Analyzing trace with hash 505635803, now seen corresponding path program 11 times [2024-06-14 15:48:04,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:04,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095545893] [2024-06-14 15:48:04,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:04,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:11,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:11,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:11,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095545893] [2024-06-14 15:48:11,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095545893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:11,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:11,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:11,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420826950] [2024-06-14 15:48:11,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:11,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:11,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:11,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:11,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:11,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:11,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 209 transitions, 2048 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:11,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:11,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:11,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:11,808 INFO L124 PetriNetUnfolderBase]: 577/1056 cut-off events. [2024-06-14 15:48:11,809 INFO L125 PetriNetUnfolderBase]: For 152104/152104 co-relation queries the response was YES. [2024-06-14 15:48:11,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7583 conditions, 1056 events. 577/1056 cut-off events. For 152104/152104 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5474 event pairs, 82 based on Foata normal form. 2/1056 useless extension candidates. Maximal degree in co-relation 7457. Up to 836 conditions per place. [2024-06-14 15:48:11,819 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 172 selfloop transitions, 55 changer transitions 0/229 dead transitions. [2024-06-14 15:48:11,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 229 transitions, 2588 flow [2024-06-14 15:48:11,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 15:48:11,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-14 15:48:11,822 INFO L175 Difference]: Start difference. First operand has 263 places, 209 transitions, 2048 flow. Second operand 10 states and 129 transitions. [2024-06-14 15:48:11,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 229 transitions, 2588 flow [2024-06-14 15:48:12,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 229 transitions, 2484 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:48:12,280 INFO L231 Difference]: Finished difference. Result has 263 places, 211 transitions, 2109 flow [2024-06-14 15:48:12,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2109, PETRI_PLACES=263, PETRI_TRANSITIONS=211} [2024-06-14 15:48:12,281 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 232 predicate places. [2024-06-14 15:48:12,281 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 211 transitions, 2109 flow [2024-06-14 15:48:12,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:12,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:12,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:12,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 15:48:12,282 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:12,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:12,282 INFO L85 PathProgramCache]: Analyzing trace with hash 39433497, now seen corresponding path program 2 times [2024-06-14 15:48:12,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:12,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719253560] [2024-06-14 15:48:12,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:12,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:18,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:18,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719253560] [2024-06-14 15:48:18,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719253560] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:18,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:18,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:48:18,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304629892] [2024-06-14 15:48:18,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:18,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:48:18,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:18,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:48:18,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:48:18,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:18,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 211 transitions, 2109 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:18,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:18,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:18,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:18,687 INFO L124 PetriNetUnfolderBase]: 581/1064 cut-off events. [2024-06-14 15:48:18,687 INFO L125 PetriNetUnfolderBase]: For 155243/155243 co-relation queries the response was YES. [2024-06-14 15:48:18,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7703 conditions, 1064 events. 581/1064 cut-off events. For 155243/155243 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5524 event pairs, 82 based on Foata normal form. 2/1064 useless extension candidates. Maximal degree in co-relation 7576. Up to 1026 conditions per place. [2024-06-14 15:48:18,697 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 208 selfloop transitions, 15 changer transitions 0/225 dead transitions. [2024-06-14 15:48:18,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 225 transitions, 2605 flow [2024-06-14 15:48:18,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 15:48:18,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-14 15:48:18,698 INFO L175 Difference]: Start difference. First operand has 263 places, 211 transitions, 2109 flow. Second operand 10 states and 108 transitions. [2024-06-14 15:48:18,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 225 transitions, 2605 flow [2024-06-14 15:48:19,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 225 transitions, 2460 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:19,124 INFO L231 Difference]: Finished difference. Result has 265 places, 212 transitions, 2022 flow [2024-06-14 15:48:19,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1964, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2022, PETRI_PLACES=265, PETRI_TRANSITIONS=212} [2024-06-14 15:48:19,125 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 234 predicate places. [2024-06-14 15:48:19,125 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 212 transitions, 2022 flow [2024-06-14 15:48:19,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:19,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:19,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:19,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 15:48:19,125 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:19,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1896747495, now seen corresponding path program 3 times [2024-06-14 15:48:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:19,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593000122] [2024-06-14 15:48:19,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:19,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:24,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:24,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593000122] [2024-06-14 15:48:24,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593000122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:24,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:24,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:48:24,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869197676] [2024-06-14 15:48:24,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:24,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:48:24,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:24,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:48:24,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:48:24,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:24,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 212 transitions, 2022 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:24,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:24,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:24,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:25,321 INFO L124 PetriNetUnfolderBase]: 585/1072 cut-off events. [2024-06-14 15:48:25,321 INFO L125 PetriNetUnfolderBase]: For 158019/158019 co-relation queries the response was YES. [2024-06-14 15:48:25,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7649 conditions, 1072 events. 585/1072 cut-off events. For 158019/158019 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5566 event pairs, 82 based on Foata normal form. 2/1072 useless extension candidates. Maximal degree in co-relation 7521. Up to 1034 conditions per place. [2024-06-14 15:48:25,332 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 210 selfloop transitions, 14 changer transitions 0/226 dead transitions. [2024-06-14 15:48:25,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 226 transitions, 2522 flow [2024-06-14 15:48:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 15:48:25,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33125 [2024-06-14 15:48:25,333 INFO L175 Difference]: Start difference. First operand has 265 places, 212 transitions, 2022 flow. Second operand 10 states and 106 transitions. [2024-06-14 15:48:25,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 226 transitions, 2522 flow [2024-06-14 15:48:25,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 226 transitions, 2474 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:25,747 INFO L231 Difference]: Finished difference. Result has 267 places, 213 transitions, 2032 flow [2024-06-14 15:48:25,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2032, PETRI_PLACES=267, PETRI_TRANSITIONS=213} [2024-06-14 15:48:25,748 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 236 predicate places. [2024-06-14 15:48:25,748 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 213 transitions, 2032 flow [2024-06-14 15:48:25,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:25,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:25,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:25,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 15:48:25,749 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:25,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:25,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1560584107, now seen corresponding path program 21 times [2024-06-14 15:48:25,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:25,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646148493] [2024-06-14 15:48:25,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:25,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:31,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:31,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646148493] [2024-06-14 15:48:31,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646148493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:31,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:31,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:31,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170580797] [2024-06-14 15:48:31,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:31,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:31,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:31,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:31,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:32,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:32,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 213 transitions, 2032 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:32,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:32,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:32,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:32,542 INFO L124 PetriNetUnfolderBase]: 589/1080 cut-off events. [2024-06-14 15:48:32,542 INFO L125 PetriNetUnfolderBase]: For 161299/161299 co-relation queries the response was YES. [2024-06-14 15:48:32,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7698 conditions, 1080 events. 589/1080 cut-off events. For 161299/161299 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5659 event pairs, 90 based on Foata normal form. 2/1080 useless extension candidates. Maximal degree in co-relation 7569. Up to 997 conditions per place. [2024-06-14 15:48:32,553 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 193 selfloop transitions, 32 changer transitions 0/227 dead transitions. [2024-06-14 15:48:32,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 227 transitions, 2729 flow [2024-06-14 15:48:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-14 15:48:32,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-14 15:48:32,555 INFO L175 Difference]: Start difference. First operand has 267 places, 213 transitions, 2032 flow. Second operand 10 states and 113 transitions. [2024-06-14 15:48:32,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 227 transitions, 2729 flow [2024-06-14 15:48:32,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 227 transitions, 2681 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:32,974 INFO L231 Difference]: Finished difference. Result has 269 places, 214 transitions, 2071 flow [2024-06-14 15:48:32,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2071, PETRI_PLACES=269, PETRI_TRANSITIONS=214} [2024-06-14 15:48:32,975 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 238 predicate places. [2024-06-14 15:48:32,975 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 214 transitions, 2071 flow [2024-06-14 15:48:32,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:32,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:32,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:32,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 15:48:32,975 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:32,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:32,976 INFO L85 PathProgramCache]: Analyzing trace with hash 29305239, now seen corresponding path program 12 times [2024-06-14 15:48:32,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:32,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259943141] [2024-06-14 15:48:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:38,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:38,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259943141] [2024-06-14 15:48:38,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259943141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:38,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:38,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:38,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293823340] [2024-06-14 15:48:38,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:38,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:38,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:38,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:38,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:38,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:38,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 214 transitions, 2071 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:38,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:38,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:38,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:39,269 INFO L124 PetriNetUnfolderBase]: 585/1074 cut-off events. [2024-06-14 15:48:39,270 INFO L125 PetriNetUnfolderBase]: For 154266/154266 co-relation queries the response was YES. [2024-06-14 15:48:39,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7508 conditions, 1074 events. 585/1074 cut-off events. For 154266/154266 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5622 event pairs, 81 based on Foata normal form. 2/1074 useless extension candidates. Maximal degree in co-relation 7378. Up to 1026 conditions per place. [2024-06-14 15:48:39,278 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 211 selfloop transitions, 17 changer transitions 0/230 dead transitions. [2024-06-14 15:48:39,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 230 transitions, 2575 flow [2024-06-14 15:48:39,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-14 15:48:39,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-14 15:48:39,279 INFO L175 Difference]: Start difference. First operand has 269 places, 214 transitions, 2071 flow. Second operand 10 states and 111 transitions. [2024-06-14 15:48:39,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 230 transitions, 2575 flow [2024-06-14 15:48:39,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 230 transitions, 2369 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-06-14 15:48:39,615 INFO L231 Difference]: Finished difference. Result has 268 places, 216 transitions, 1926 flow [2024-06-14 15:48:39,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1926, PETRI_PLACES=268, PETRI_TRANSITIONS=216} [2024-06-14 15:48:39,616 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 237 predicate places. [2024-06-14 15:48:39,616 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 216 transitions, 1926 flow [2024-06-14 15:48:39,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:39,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:39,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:39,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 15:48:39,617 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:39,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:39,617 INFO L85 PathProgramCache]: Analyzing trace with hash 604031855, now seen corresponding path program 22 times [2024-06-14 15:48:39,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:39,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481978411] [2024-06-14 15:48:39,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:39,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:45,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:45,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481978411] [2024-06-14 15:48:45,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481978411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:45,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:45,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:45,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409201415] [2024-06-14 15:48:45,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:45,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:45,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:45,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:45,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:45,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:45,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 216 transitions, 1926 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:45,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:45,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:45,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:46,199 INFO L124 PetriNetUnfolderBase]: 567/1036 cut-off events. [2024-06-14 15:48:46,200 INFO L125 PetriNetUnfolderBase]: For 115606/115606 co-relation queries the response was YES. [2024-06-14 15:48:46,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6306 conditions, 1036 events. 567/1036 cut-off events. For 115606/115606 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5425 event pairs, 75 based on Foata normal form. 2/1036 useless extension candidates. Maximal degree in co-relation 6178. Up to 1003 conditions per place. [2024-06-14 15:48:46,211 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 210 selfloop transitions, 16 changer transitions 0/228 dead transitions. [2024-06-14 15:48:46,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 228 transitions, 2415 flow [2024-06-14 15:48:46,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 15:48:46,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-14 15:48:46,212 INFO L175 Difference]: Start difference. First operand has 268 places, 216 transitions, 1926 flow. Second operand 10 states and 107 transitions. [2024-06-14 15:48:46,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 228 transitions, 2415 flow [2024-06-14 15:48:46,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 228 transitions, 2370 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:46,518 INFO L231 Difference]: Finished difference. Result has 270 places, 217 transitions, 1932 flow [2024-06-14 15:48:46,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1932, PETRI_PLACES=270, PETRI_TRANSITIONS=217} [2024-06-14 15:48:46,519 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 239 predicate places. [2024-06-14 15:48:46,519 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 217 transitions, 1932 flow [2024-06-14 15:48:46,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:46,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:46,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:46,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 15:48:46,519 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:46,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:46,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1701836595, now seen corresponding path program 4 times [2024-06-14 15:48:46,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:46,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125811263] [2024-06-14 15:48:46,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:46,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:51,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:48:51,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:51,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125811263] [2024-06-14 15:48:51,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125811263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:51,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:51,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:51,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692564411] [2024-06-14 15:48:51,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:51,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:51,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:51,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:51,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:52,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:52,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 217 transitions, 1932 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:52,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:52,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:52,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:52,561 INFO L124 PetriNetUnfolderBase]: 571/1044 cut-off events. [2024-06-14 15:48:52,561 INFO L125 PetriNetUnfolderBase]: For 118161/118161 co-relation queries the response was YES. [2024-06-14 15:48:52,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6379 conditions, 1044 events. 571/1044 cut-off events. For 118161/118161 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5491 event pairs, 70 based on Foata normal form. 2/1044 useless extension candidates. Maximal degree in co-relation 6250. Up to 984 conditions per place. [2024-06-14 15:48:52,569 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 205 selfloop transitions, 24 changer transitions 0/231 dead transitions. [2024-06-14 15:48:52,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 231 transitions, 2444 flow [2024-06-14 15:48:52,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-14 15:48:52,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-14 15:48:52,571 INFO L175 Difference]: Start difference. First operand has 270 places, 217 transitions, 1932 flow. Second operand 10 states and 113 transitions. [2024-06-14 15:48:52,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 231 transitions, 2444 flow [2024-06-14 15:48:52,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 231 transitions, 2404 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:52,848 INFO L231 Difference]: Finished difference. Result has 272 places, 218 transitions, 1972 flow [2024-06-14 15:48:52,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1972, PETRI_PLACES=272, PETRI_TRANSITIONS=218} [2024-06-14 15:48:52,848 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 241 predicate places. [2024-06-14 15:48:52,849 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 218 transitions, 1972 flow [2024-06-14 15:48:52,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:52,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:52,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:52,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 15:48:52,849 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:52,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1637857243, now seen corresponding path program 23 times [2024-06-14 15:48:52,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:52,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195556351] [2024-06-14 15:48:52,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:52,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:58,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:48:58,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:58,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195556351] [2024-06-14 15:48:58,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195556351] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:58,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:58,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:58,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949808577] [2024-06-14 15:48:58,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:58,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:58,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:58,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:58,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:59,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:48:59,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 218 transitions, 1972 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:59,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:59,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:48:59,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:59,492 INFO L124 PetriNetUnfolderBase]: 575/1052 cut-off events. [2024-06-14 15:48:59,493 INFO L125 PetriNetUnfolderBase]: For 120593/120593 co-relation queries the response was YES. [2024-06-14 15:48:59,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6454 conditions, 1052 events. 575/1052 cut-off events. For 120593/120593 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5545 event pairs, 66 based on Foata normal form. 2/1052 useless extension candidates. Maximal degree in co-relation 6324. Up to 931 conditions per place. [2024-06-14 15:48:59,503 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 191 selfloop transitions, 42 changer transitions 0/235 dead transitions. [2024-06-14 15:48:59,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 235 transitions, 2707 flow [2024-06-14 15:48:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:48:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:48:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-14 15:48:59,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35511363636363635 [2024-06-14 15:48:59,504 INFO L175 Difference]: Start difference. First operand has 272 places, 218 transitions, 1972 flow. Second operand 11 states and 125 transitions. [2024-06-14 15:48:59,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 235 transitions, 2707 flow [2024-06-14 15:48:59,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 235 transitions, 2556 flow, removed 13 selfloop flow, removed 11 redundant places. [2024-06-14 15:48:59,813 INFO L231 Difference]: Finished difference. Result has 273 places, 221 transitions, 1947 flow [2024-06-14 15:48:59,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1947, PETRI_PLACES=273, PETRI_TRANSITIONS=221} [2024-06-14 15:48:59,827 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 242 predicate places. [2024-06-14 15:48:59,827 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 221 transitions, 1947 flow [2024-06-14 15:48:59,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:59,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:59,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:59,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 15:48:59,828 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:59,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:59,828 INFO L85 PathProgramCache]: Analyzing trace with hash -256025271, now seen corresponding path program 13 times [2024-06-14 15:48:59,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:59,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566499161] [2024-06-14 15:48:59,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:59,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:06,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:06,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566499161] [2024-06-14 15:49:06,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566499161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:06,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:06,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:06,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042700695] [2024-06-14 15:49:06,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:06,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:06,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:06,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:06,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:06,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:06,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 221 transitions, 1947 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:06,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:06,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:06,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:06,579 INFO L124 PetriNetUnfolderBase]: 587/1072 cut-off events. [2024-06-14 15:49:06,579 INFO L125 PetriNetUnfolderBase]: For 122681/122681 co-relation queries the response was YES. [2024-06-14 15:49:06,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6563 conditions, 1072 events. 587/1072 cut-off events. For 122681/122681 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 5683 event pairs, 71 based on Foata normal form. 2/1072 useless extension candidates. Maximal degree in co-relation 6432. Up to 1020 conditions per place. [2024-06-14 15:49:06,590 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 215 selfloop transitions, 21 changer transitions 0/238 dead transitions. [2024-06-14 15:49:06,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 238 transitions, 2509 flow [2024-06-14 15:49:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-14 15:49:06,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-14 15:49:06,592 INFO L175 Difference]: Start difference. First operand has 273 places, 221 transitions, 1947 flow. Second operand 10 states and 113 transitions. [2024-06-14 15:49:06,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 238 transitions, 2509 flow [2024-06-14 15:49:06,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 238 transitions, 2392 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 15:49:06,870 INFO L231 Difference]: Finished difference. Result has 276 places, 225 transitions, 1943 flow [2024-06-14 15:49:06,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1838, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1943, PETRI_PLACES=276, PETRI_TRANSITIONS=225} [2024-06-14 15:49:06,876 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 245 predicate places. [2024-06-14 15:49:06,876 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 225 transitions, 1943 flow [2024-06-14 15:49:06,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:06,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:06,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:06,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 15:49:06,877 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:06,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash 604278119, now seen corresponding path program 5 times [2024-06-14 15:49:06,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:06,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889591923] [2024-06-14 15:49:06,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:06,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:12,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:12,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889591923] [2024-06-14 15:49:12,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889591923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:12,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:12,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:49:12,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174288981] [2024-06-14 15:49:12,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:12,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:49:12,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:12,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:49:12,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:49:13,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:13,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 225 transitions, 1943 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:13,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:13,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:13,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:13,546 INFO L124 PetriNetUnfolderBase]: 591/1080 cut-off events. [2024-06-14 15:49:13,547 INFO L125 PetriNetUnfolderBase]: For 125165/125165 co-relation queries the response was YES. [2024-06-14 15:49:13,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6566 conditions, 1080 events. 591/1080 cut-off events. For 125165/125165 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5768 event pairs, 72 based on Foata normal form. 2/1080 useless extension candidates. Maximal degree in co-relation 6433. Up to 1047 conditions per place. [2024-06-14 15:49:13,558 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 219 selfloop transitions, 16 changer transitions 0/237 dead transitions. [2024-06-14 15:49:13,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 237 transitions, 2465 flow [2024-06-14 15:49:13,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:13,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-14 15:49:13,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334375 [2024-06-14 15:49:13,559 INFO L175 Difference]: Start difference. First operand has 276 places, 225 transitions, 1943 flow. Second operand 10 states and 107 transitions. [2024-06-14 15:49:13,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 237 transitions, 2465 flow [2024-06-14 15:49:13,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 237 transitions, 2402 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 15:49:13,877 INFO L231 Difference]: Finished difference. Result has 279 places, 226 transitions, 1946 flow [2024-06-14 15:49:13,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1880, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1946, PETRI_PLACES=279, PETRI_TRANSITIONS=226} [2024-06-14 15:49:13,878 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 248 predicate places. [2024-06-14 15:49:13,878 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 226 transitions, 1946 flow [2024-06-14 15:49:13,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:13,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:13,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:13,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-14 15:49:13,879 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:13,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:13,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1560579271, now seen corresponding path program 14 times [2024-06-14 15:49:13,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:13,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3486692] [2024-06-14 15:49:13,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:13,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:20,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:20,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3486692] [2024-06-14 15:49:20,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3486692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:20,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:20,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:20,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363193571] [2024-06-14 15:49:20,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:20,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:20,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:20,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:20,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:20,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:20,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 226 transitions, 1946 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:20,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:20,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:20,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:20,767 INFO L124 PetriNetUnfolderBase]: 597/1090 cut-off events. [2024-06-14 15:49:20,768 INFO L125 PetriNetUnfolderBase]: For 127799/127799 co-relation queries the response was YES. [2024-06-14 15:49:20,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6637 conditions, 1090 events. 597/1090 cut-off events. For 127799/127799 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 5816 event pairs, 66 based on Foata normal form. 2/1090 useless extension candidates. Maximal degree in co-relation 6503. Up to 944 conditions per place. [2024-06-14 15:49:20,780 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 195 selfloop transitions, 45 changer transitions 0/242 dead transitions. [2024-06-14 15:49:20,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 242 transitions, 2720 flow [2024-06-14 15:49:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-14 15:49:20,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371875 [2024-06-14 15:49:20,781 INFO L175 Difference]: Start difference. First operand has 279 places, 226 transitions, 1946 flow. Second operand 10 states and 119 transitions. [2024-06-14 15:49:20,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 242 transitions, 2720 flow [2024-06-14 15:49:21,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 242 transitions, 2661 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:21,070 INFO L231 Difference]: Finished difference. Result has 281 places, 228 transitions, 2032 flow [2024-06-14 15:49:21,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2032, PETRI_PLACES=281, PETRI_TRANSITIONS=228} [2024-06-14 15:49:21,070 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 250 predicate places. [2024-06-14 15:49:21,070 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 228 transitions, 2032 flow [2024-06-14 15:49:21,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:21,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:21,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:21,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-14 15:49:21,071 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:21,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash -256031781, now seen corresponding path program 15 times [2024-06-14 15:49:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:21,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507433378] [2024-06-14 15:49:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:21,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:26,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:26,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507433378] [2024-06-14 15:49:26,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507433378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:26,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:26,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:26,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426289540] [2024-06-14 15:49:26,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:26,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:26,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:26,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:26,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:27,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:27,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 228 transitions, 2032 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:27,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:27,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:27,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:27,455 INFO L124 PetriNetUnfolderBase]: 613/1116 cut-off events. [2024-06-14 15:49:27,455 INFO L125 PetriNetUnfolderBase]: For 142132/142132 co-relation queries the response was YES. [2024-06-14 15:49:27,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7124 conditions, 1116 events. 613/1116 cut-off events. For 142132/142132 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 5961 event pairs, 73 based on Foata normal form. 2/1116 useless extension candidates. Maximal degree in co-relation 6989. Up to 1044 conditions per place. [2024-06-14 15:49:27,466 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 218 selfloop transitions, 26 changer transitions 0/246 dead transitions. [2024-06-14 15:49:27,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 246 transitions, 2864 flow [2024-06-14 15:49:27,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-14 15:49:27,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-14 15:49:27,467 INFO L175 Difference]: Start difference. First operand has 281 places, 228 transitions, 2032 flow. Second operand 10 states and 115 transitions. [2024-06-14 15:49:27,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 246 transitions, 2864 flow [2024-06-14 15:49:27,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 246 transitions, 2652 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-06-14 15:49:27,837 INFO L231 Difference]: Finished difference. Result has 283 places, 232 transitions, 1992 flow [2024-06-14 15:49:27,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1992, PETRI_PLACES=283, PETRI_TRANSITIONS=232} [2024-06-14 15:49:27,837 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 252 predicate places. [2024-06-14 15:49:27,837 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 232 transitions, 1992 flow [2024-06-14 15:49:27,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:27,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:27,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:27,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-14 15:49:27,838 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:27,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:27,838 INFO L85 PathProgramCache]: Analyzing trace with hash -255794631, now seen corresponding path program 16 times [2024-06-14 15:49:27,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:27,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137927011] [2024-06-14 15:49:27,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:27,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:33,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:33,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137927011] [2024-06-14 15:49:33,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137927011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:33,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:33,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:33,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934829470] [2024-06-14 15:49:33,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:33,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:33,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:33,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:33,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:33,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:33,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 232 transitions, 1992 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:33,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:33,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:33,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:34,140 INFO L124 PetriNetUnfolderBase]: 609/1110 cut-off events. [2024-06-14 15:49:34,140 INFO L125 PetriNetUnfolderBase]: For 132254/132254 co-relation queries the response was YES. [2024-06-14 15:49:34,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6670 conditions, 1110 events. 609/1110 cut-off events. For 132254/132254 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 5942 event pairs, 71 based on Foata normal form. 2/1110 useless extension candidates. Maximal degree in co-relation 6534. Up to 1058 conditions per place. [2024-06-14 15:49:34,152 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 221 selfloop transitions, 21 changer transitions 0/244 dead transitions. [2024-06-14 15:49:34,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 244 transitions, 2502 flow [2024-06-14 15:49:34,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-14 15:49:34,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-14 15:49:34,153 INFO L175 Difference]: Start difference. First operand has 283 places, 232 transitions, 1992 flow. Second operand 10 states and 112 transitions. [2024-06-14 15:49:34,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 244 transitions, 2502 flow [2024-06-14 15:49:34,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 244 transitions, 2402 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-14 15:49:34,463 INFO L231 Difference]: Finished difference. Result has 286 places, 232 transitions, 1939 flow [2024-06-14 15:49:34,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1939, PETRI_PLACES=286, PETRI_TRANSITIONS=232} [2024-06-14 15:49:34,468 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 255 predicate places. [2024-06-14 15:49:34,468 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 232 transitions, 1939 flow [2024-06-14 15:49:34,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:34,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:34,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:34,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-14 15:49:34,469 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:34,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:34,469 INFO L85 PathProgramCache]: Analyzing trace with hash 376130891, now seen corresponding path program 17 times [2024-06-14 15:49:34,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:34,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815772510] [2024-06-14 15:49:34,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:34,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:41,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:41,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815772510] [2024-06-14 15:49:41,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815772510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:41,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:41,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:41,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122434864] [2024-06-14 15:49:41,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:41,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:41,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:41,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:41,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:41,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 232 transitions, 1939 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:41,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:41,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:41,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:41,742 INFO L124 PetriNetUnfolderBase]: 615/1120 cut-off events. [2024-06-14 15:49:41,743 INFO L125 PetriNetUnfolderBase]: For 134907/134907 co-relation queries the response was YES. [2024-06-14 15:49:41,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6695 conditions, 1120 events. 615/1120 cut-off events. For 134907/134907 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6003 event pairs, 67 based on Foata normal form. 2/1120 useless extension candidates. Maximal degree in co-relation 6558. Up to 1022 conditions per place. [2024-06-14 15:49:41,754 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 211 selfloop transitions, 35 changer transitions 0/248 dead transitions. [2024-06-14 15:49:41,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 248 transitions, 2511 flow [2024-06-14 15:49:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-14 15:49:41,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371875 [2024-06-14 15:49:41,755 INFO L175 Difference]: Start difference. First operand has 286 places, 232 transitions, 1939 flow. Second operand 10 states and 119 transitions. [2024-06-14 15:49:41,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 248 transitions, 2511 flow [2024-06-14 15:49:42,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 248 transitions, 2452 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:49:42,135 INFO L231 Difference]: Finished difference. Result has 287 places, 234 transitions, 2009 flow [2024-06-14 15:49:42,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1880, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2009, PETRI_PLACES=287, PETRI_TRANSITIONS=234} [2024-06-14 15:49:42,135 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 256 predicate places. [2024-06-14 15:49:42,135 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 234 transitions, 2009 flow [2024-06-14 15:49:42,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:42,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:42,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:42,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-14 15:49:42,136 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:42,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:42,136 INFO L85 PathProgramCache]: Analyzing trace with hash 376130705, now seen corresponding path program 24 times [2024-06-14 15:49:42,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:42,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443063791] [2024-06-14 15:49:42,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:42,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:48,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:48,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443063791] [2024-06-14 15:49:48,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443063791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:48,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:48,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:48,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825009794] [2024-06-14 15:49:48,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:48,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:48,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:48,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:48,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:48,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:48,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 234 transitions, 2009 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:48,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:48,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:48,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:48,856 INFO L124 PetriNetUnfolderBase]: 619/1128 cut-off events. [2024-06-14 15:49:48,857 INFO L125 PetriNetUnfolderBase]: For 137357/137357 co-relation queries the response was YES. [2024-06-14 15:49:48,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6789 conditions, 1128 events. 619/1128 cut-off events. For 137357/137357 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6053 event pairs, 77 based on Foata normal form. 2/1128 useless extension candidates. Maximal degree in co-relation 6651. Up to 1080 conditions per place. [2024-06-14 15:49:48,868 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 218 selfloop transitions, 25 changer transitions 0/245 dead transitions. [2024-06-14 15:49:48,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 245 transitions, 2534 flow [2024-06-14 15:49:48,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-14 15:49:48,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 15:49:48,869 INFO L175 Difference]: Start difference. First operand has 287 places, 234 transitions, 2009 flow. Second operand 10 states and 110 transitions. [2024-06-14 15:49:48,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 245 transitions, 2534 flow [2024-06-14 15:49:49,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 245 transitions, 2425 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:49,256 INFO L231 Difference]: Finished difference. Result has 289 places, 235 transitions, 1973 flow [2024-06-14 15:49:49,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1900, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1973, PETRI_PLACES=289, PETRI_TRANSITIONS=235} [2024-06-14 15:49:49,256 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 258 predicate places. [2024-06-14 15:49:49,257 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 235 transitions, 1973 flow [2024-06-14 15:49:49,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:49,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:49,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:49,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-14 15:49:49,257 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:49,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash 382633079, now seen corresponding path program 6 times [2024-06-14 15:49:49,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:49,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016554851] [2024-06-14 15:49:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:49,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:55,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:55,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016554851] [2024-06-14 15:49:55,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016554851] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:55,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:55,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:55,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081450792] [2024-06-14 15:49:55,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:55,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:55,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:55,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:55,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:55,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:49:55,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 235 transitions, 1973 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:55,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:55,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:49:55,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:55,655 INFO L124 PetriNetUnfolderBase]: 616/1123 cut-off events. [2024-06-14 15:49:55,655 INFO L125 PetriNetUnfolderBase]: For 126829/126829 co-relation queries the response was YES. [2024-06-14 15:49:55,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6464 conditions, 1123 events. 616/1123 cut-off events. For 126829/126829 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6026 event pairs, 73 based on Foata normal form. 2/1123 useless extension candidates. Maximal degree in co-relation 6325. Up to 1078 conditions per place. [2024-06-14 15:49:55,667 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 225 selfloop transitions, 20 changer transitions 0/247 dead transitions. [2024-06-14 15:49:55,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 247 transitions, 2489 flow [2024-06-14 15:49:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:55,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-14 15:49:55,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-14 15:49:55,669 INFO L175 Difference]: Start difference. First operand has 289 places, 235 transitions, 1973 flow. Second operand 10 states and 111 transitions. [2024-06-14 15:49:55,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 247 transitions, 2489 flow [2024-06-14 15:49:56,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 247 transitions, 2411 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:56,017 INFO L231 Difference]: Finished difference. Result has 291 places, 235 transitions, 1939 flow [2024-06-14 15:49:56,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1939, PETRI_PLACES=291, PETRI_TRANSITIONS=235} [2024-06-14 15:49:56,023 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 260 predicate places. [2024-06-14 15:49:56,023 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 235 transitions, 1939 flow [2024-06-14 15:49:56,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:56,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:56,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:56,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-14 15:49:56,024 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:56,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:56,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1554143671, now seen corresponding path program 18 times [2024-06-14 15:49:56,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:56,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800349083] [2024-06-14 15:49:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:56,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:02,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:02,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800349083] [2024-06-14 15:50:02,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800349083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:02,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:02,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:02,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282379561] [2024-06-14 15:50:02,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:02,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:02,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:02,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:02,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:02,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:02,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 235 transitions, 1939 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:02,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:02,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:02,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:03,186 INFO L124 PetriNetUnfolderBase]: 628/1143 cut-off events. [2024-06-14 15:50:03,187 INFO L125 PetriNetUnfolderBase]: For 129296/129296 co-relation queries the response was YES. [2024-06-14 15:50:03,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6571 conditions, 1143 events. 628/1143 cut-off events. For 129296/129296 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6175 event pairs, 68 based on Foata normal form. 2/1143 useless extension candidates. Maximal degree in co-relation 6431. Up to 1050 conditions per place. [2024-06-14 15:50:03,199 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 219 selfloop transitions, 32 changer transitions 0/253 dead transitions. [2024-06-14 15:50:03,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 253 transitions, 2531 flow [2024-06-14 15:50:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-14 15:50:03,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371875 [2024-06-14 15:50:03,200 INFO L175 Difference]: Start difference. First operand has 291 places, 235 transitions, 1939 flow. Second operand 10 states and 119 transitions. [2024-06-14 15:50:03,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 253 transitions, 2531 flow [2024-06-14 15:50:03,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 253 transitions, 2410 flow, removed 15 selfloop flow, removed 12 redundant places. [2024-06-14 15:50:03,579 INFO L231 Difference]: Finished difference. Result has 289 places, 239 transitions, 1951 flow [2024-06-14 15:50:03,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1951, PETRI_PLACES=289, PETRI_TRANSITIONS=239} [2024-06-14 15:50:03,580 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 258 predicate places. [2024-06-14 15:50:03,580 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 239 transitions, 1951 flow [2024-06-14 15:50:03,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:03,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:03,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:03,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-14 15:50:03,581 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:03,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:03,581 INFO L85 PathProgramCache]: Analyzing trace with hash 382387001, now seen corresponding path program 19 times [2024-06-14 15:50:03,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:03,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908709534] [2024-06-14 15:50:03,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:03,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:09,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:50:09,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:09,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908709534] [2024-06-14 15:50:09,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908709534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:09,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:09,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:09,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514215880] [2024-06-14 15:50:09,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:09,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:09,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:09,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:09,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:09,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:09,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 239 transitions, 1951 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:09,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:09,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:09,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:10,040 INFO L124 PetriNetUnfolderBase]: 624/1137 cut-off events. [2024-06-14 15:50:10,040 INFO L125 PetriNetUnfolderBase]: For 118077/118077 co-relation queries the response was YES. [2024-06-14 15:50:10,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6220 conditions, 1137 events. 624/1137 cut-off events. For 118077/118077 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6148 event pairs, 66 based on Foata normal form. 2/1137 useless extension candidates. Maximal degree in co-relation 6082. Up to 1024 conditions per place. [2024-06-14 15:50:10,048 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 215 selfloop transitions, 37 changer transitions 0/254 dead transitions. [2024-06-14 15:50:10,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 254 transitions, 2715 flow [2024-06-14 15:50:10,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 15:50:10,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-14 15:50:10,050 INFO L175 Difference]: Start difference. First operand has 289 places, 239 transitions, 1951 flow. Second operand 10 states and 121 transitions. [2024-06-14 15:50:10,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 254 transitions, 2715 flow [2024-06-14 15:50:10,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 254 transitions, 2622 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 15:50:10,314 INFO L231 Difference]: Finished difference. Result has 292 places, 239 transitions, 1937 flow [2024-06-14 15:50:10,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1937, PETRI_PLACES=292, PETRI_TRANSITIONS=239} [2024-06-14 15:50:10,314 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 261 predicate places. [2024-06-14 15:50:10,314 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 239 transitions, 1937 flow [2024-06-14 15:50:10,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:10,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:10,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:10,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-14 15:50:10,315 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:10,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:10,315 INFO L85 PathProgramCache]: Analyzing trace with hash 382624151, now seen corresponding path program 20 times [2024-06-14 15:50:10,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:10,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960812561] [2024-06-14 15:50:10,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:10,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:15,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:15,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960812561] [2024-06-14 15:50:15,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960812561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:15,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:15,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:15,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940657092] [2024-06-14 15:50:15,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:15,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:15,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:15,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:15,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:16,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:16,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 239 transitions, 1937 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:16,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:16,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:16,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:16,562 INFO L124 PetriNetUnfolderBase]: 620/1131 cut-off events. [2024-06-14 15:50:16,562 INFO L125 PetriNetUnfolderBase]: For 106772/106772 co-relation queries the response was YES. [2024-06-14 15:50:16,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5936 conditions, 1131 events. 620/1131 cut-off events. For 106772/106772 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6109 event pairs, 66 based on Foata normal form. 2/1131 useless extension candidates. Maximal degree in co-relation 5797. Up to 1038 conditions per place. [2024-06-14 15:50:16,574 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 217 selfloop transitions, 33 changer transitions 0/252 dead transitions. [2024-06-14 15:50:16,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 252 transitions, 2465 flow [2024-06-14 15:50:16,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 15:50:16,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-14 15:50:16,575 INFO L175 Difference]: Start difference. First operand has 292 places, 239 transitions, 1937 flow. Second operand 10 states and 117 transitions. [2024-06-14 15:50:16,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 252 transitions, 2465 flow [2024-06-14 15:50:16,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 252 transitions, 2195 flow, removed 38 selfloop flow, removed 11 redundant places. [2024-06-14 15:50:16,822 INFO L231 Difference]: Finished difference. Result has 291 places, 239 transitions, 1738 flow [2024-06-14 15:50:16,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1738, PETRI_PLACES=291, PETRI_TRANSITIONS=239} [2024-06-14 15:50:16,822 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 260 predicate places. [2024-06-14 15:50:16,822 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 239 transitions, 1738 flow [2024-06-14 15:50:16,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:16,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:16,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:16,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-14 15:50:16,823 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:16,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:16,823 INFO L85 PathProgramCache]: Analyzing trace with hash 382386815, now seen corresponding path program 25 times [2024-06-14 15:50:16,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:16,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436481686] [2024-06-14 15:50:16,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:16,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:22,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:50:22,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:22,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436481686] [2024-06-14 15:50:22,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436481686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:22,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:22,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:22,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216352377] [2024-06-14 15:50:22,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:22,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:22,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:22,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:22,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:23,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:23,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 239 transitions, 1738 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:23,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:23,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:23,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:23,532 INFO L124 PetriNetUnfolderBase]: 617/1126 cut-off events. [2024-06-14 15:50:23,533 INFO L125 PetriNetUnfolderBase]: For 94298/94298 co-relation queries the response was YES. [2024-06-14 15:50:23,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5402 conditions, 1126 events. 617/1126 cut-off events. For 94298/94298 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6079 event pairs, 77 based on Foata normal form. 2/1126 useless extension candidates. Maximal degree in co-relation 5264. Up to 1078 conditions per place. [2024-06-14 15:50:23,544 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 223 selfloop transitions, 24 changer transitions 0/249 dead transitions. [2024-06-14 15:50:23,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 249 transitions, 2254 flow [2024-06-14 15:50:23,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:23,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-14 15:50:23,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-14 15:50:23,545 INFO L175 Difference]: Start difference. First operand has 291 places, 239 transitions, 1738 flow. Second operand 10 states and 111 transitions. [2024-06-14 15:50:23,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 249 transitions, 2254 flow [2024-06-14 15:50:23,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 249 transitions, 2140 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:50:23,769 INFO L231 Difference]: Finished difference. Result has 292 places, 239 transitions, 1676 flow [2024-06-14 15:50:23,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1676, PETRI_PLACES=292, PETRI_TRANSITIONS=239} [2024-06-14 15:50:23,769 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 261 predicate places. [2024-06-14 15:50:23,769 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 239 transitions, 1676 flow [2024-06-14 15:50:23,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:23,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:23,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:23,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-14 15:50:23,784 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:23,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:23,785 INFO L85 PathProgramCache]: Analyzing trace with hash 613654407, now seen corresponding path program 1 times [2024-06-14 15:50:23,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:23,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359545418] [2024-06-14 15:50:23,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:23,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:29,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:29,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359545418] [2024-06-14 15:50:29,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359545418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:29,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:29,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:50:29,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527390087] [2024-06-14 15:50:29,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:29,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:50:29,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:29,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:50:29,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:50:29,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:29,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 239 transitions, 1676 flow. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:29,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:29,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:29,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:30,482 INFO L124 PetriNetUnfolderBase]: 644/1187 cut-off events. [2024-06-14 15:50:30,482 INFO L125 PetriNetUnfolderBase]: For 176892/176892 co-relation queries the response was YES. [2024-06-14 15:50:30,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6161 conditions, 1187 events. 644/1187 cut-off events. For 176892/176892 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6417 event pairs, 70 based on Foata normal form. 8/1193 useless extension candidates. Maximal degree in co-relation 6023. Up to 547 conditions per place. [2024-06-14 15:50:30,494 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 140 selfloop transitions, 109 changer transitions 18/269 dead transitions. [2024-06-14 15:50:30,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 269 transitions, 2532 flow [2024-06-14 15:50:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:50:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:50:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-14 15:50:30,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4005681818181818 [2024-06-14 15:50:30,495 INFO L175 Difference]: Start difference. First operand has 292 places, 239 transitions, 1676 flow. Second operand 11 states and 141 transitions. [2024-06-14 15:50:30,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 269 transitions, 2532 flow [2024-06-14 15:50:30,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 269 transitions, 2395 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:50:30,854 INFO L231 Difference]: Finished difference. Result has 293 places, 235 transitions, 1741 flow [2024-06-14 15:50:30,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1741, PETRI_PLACES=293, PETRI_TRANSITIONS=235} [2024-06-14 15:50:30,854 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 262 predicate places. [2024-06-14 15:50:30,854 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 235 transitions, 1741 flow [2024-06-14 15:50:30,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:30,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:30,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:30,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-14 15:50:30,855 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:30,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:30,855 INFO L85 PathProgramCache]: Analyzing trace with hash -311630635, now seen corresponding path program 2 times [2024-06-14 15:50:30,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:30,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630515576] [2024-06-14 15:50:30,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:30,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:38,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:38,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630515576] [2024-06-14 15:50:38,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630515576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:38,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:38,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:50:38,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423758675] [2024-06-14 15:50:38,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:38,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:50:38,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:38,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:50:38,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:50:38,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:38,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 235 transitions, 1741 flow. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:38,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:38,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:38,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:38,934 INFO L124 PetriNetUnfolderBase]: 657/1218 cut-off events. [2024-06-14 15:50:38,934 INFO L125 PetriNetUnfolderBase]: For 249265/249265 co-relation queries the response was YES. [2024-06-14 15:50:38,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7600 conditions, 1218 events. 657/1218 cut-off events. For 249265/249265 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6605 event pairs, 87 based on Foata normal form. 8/1224 useless extension candidates. Maximal degree in co-relation 7461. Up to 660 conditions per place. [2024-06-14 15:50:38,946 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 145 selfloop transitions, 103 changer transitions 16/266 dead transitions. [2024-06-14 15:50:38,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 266 transitions, 2607 flow [2024-06-14 15:50:38,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:50:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:50:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-14 15:50:38,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41761363636363635 [2024-06-14 15:50:38,947 INFO L175 Difference]: Start difference. First operand has 293 places, 235 transitions, 1741 flow. Second operand 11 states and 147 transitions. [2024-06-14 15:50:38,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 266 transitions, 2607 flow [2024-06-14 15:50:39,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 266 transitions, 2439 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 15:50:39,322 INFO L231 Difference]: Finished difference. Result has 288 places, 231 transitions, 1768 flow [2024-06-14 15:50:39,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1581, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1768, PETRI_PLACES=288, PETRI_TRANSITIONS=231} [2024-06-14 15:50:39,323 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 257 predicate places. [2024-06-14 15:50:39,323 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 231 transitions, 1768 flow [2024-06-14 15:50:39,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:39,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:39,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:39,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-14 15:50:39,324 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:39,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:39,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1420991619, now seen corresponding path program 3 times [2024-06-14 15:50:39,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:39,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014339418] [2024-06-14 15:50:39,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:39,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:45,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:45,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014339418] [2024-06-14 15:50:45,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014339418] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:45,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:45,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:50:45,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134977509] [2024-06-14 15:50:45,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:45,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:50:45,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:45,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:50:45,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:50:46,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:46,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 231 transitions, 1768 flow. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:46,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:46,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:46,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:46,604 INFO L124 PetriNetUnfolderBase]: 643/1192 cut-off events. [2024-06-14 15:50:46,604 INFO L125 PetriNetUnfolderBase]: For 236606/236606 co-relation queries the response was YES. [2024-06-14 15:50:46,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7600 conditions, 1192 events. 643/1192 cut-off events. For 236606/236606 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6454 event pairs, 77 based on Foata normal form. 8/1198 useless extension candidates. Maximal degree in co-relation 7464. Up to 630 conditions per place. [2024-06-14 15:50:46,617 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 138 selfloop transitions, 109 changer transitions 13/262 dead transitions. [2024-06-14 15:50:46,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 262 transitions, 2620 flow [2024-06-14 15:50:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:50:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:50:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-14 15:50:46,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147727272727273 [2024-06-14 15:50:46,618 INFO L175 Difference]: Start difference. First operand has 288 places, 231 transitions, 1768 flow. Second operand 11 states and 146 transitions. [2024-06-14 15:50:46,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 262 transitions, 2620 flow [2024-06-14 15:50:47,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 262 transitions, 2402 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-14 15:50:47,017 INFO L231 Difference]: Finished difference. Result has 283 places, 228 transitions, 1761 flow [2024-06-14 15:50:47,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1761, PETRI_PLACES=283, PETRI_TRANSITIONS=228} [2024-06-14 15:50:47,018 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 252 predicate places. [2024-06-14 15:50:47,019 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 228 transitions, 1761 flow [2024-06-14 15:50:47,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:47,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:47,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:47,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-14 15:50:47,019 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:47,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:47,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1421135769, now seen corresponding path program 4 times [2024-06-14 15:50:47,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:47,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428888500] [2024-06-14 15:50:47,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:47,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:53,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:53,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428888500] [2024-06-14 15:50:53,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428888500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:53,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:53,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:50:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99252540] [2024-06-14 15:50:53,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:53,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:50:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:53,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:50:53,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:50:53,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:53,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 228 transitions, 1761 flow. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:53,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:53,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:53,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:53,750 INFO L124 PetriNetUnfolderBase]: 633/1174 cut-off events. [2024-06-14 15:50:53,750 INFO L125 PetriNetUnfolderBase]: For 224545/224545 co-relation queries the response was YES. [2024-06-14 15:50:53,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7485 conditions, 1174 events. 633/1174 cut-off events. For 224545/224545 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6322 event pairs, 79 based on Foata normal form. 8/1180 useless extension candidates. Maximal degree in co-relation 7352. Up to 660 conditions per place. [2024-06-14 15:50:53,761 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 142 selfloop transitions, 103 changer transitions 10/257 dead transitions. [2024-06-14 15:50:53,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 257 transitions, 2593 flow [2024-06-14 15:50:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:50:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:50:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-14 15:50:53,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4005681818181818 [2024-06-14 15:50:53,763 INFO L175 Difference]: Start difference. First operand has 283 places, 228 transitions, 1761 flow. Second operand 11 states and 141 transitions. [2024-06-14 15:50:53,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 257 transitions, 2593 flow [2024-06-14 15:50:54,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 257 transitions, 2366 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:50:54,054 INFO L231 Difference]: Finished difference. Result has 280 places, 226 transitions, 1734 flow [2024-06-14 15:50:54,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1734, PETRI_PLACES=280, PETRI_TRANSITIONS=226} [2024-06-14 15:50:54,055 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 249 predicate places. [2024-06-14 15:50:54,055 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 226 transitions, 1734 flow [2024-06-14 15:50:54,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:54,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:54,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:54,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-14 15:50:54,055 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:54,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:54,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1932825043, now seen corresponding path program 5 times [2024-06-14 15:50:54,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:54,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088282764] [2024-06-14 15:50:54,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:54,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:59,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:50:59,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:59,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088282764] [2024-06-14 15:50:59,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088282764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:59,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:59,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:50:59,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854204632] [2024-06-14 15:50:59,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:59,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:50:59,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:59,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:50:59,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:50:59,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:50:59,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 226 transitions, 1734 flow. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:59,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:59,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:50:59,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:00,423 INFO L124 PetriNetUnfolderBase]: 602/1113 cut-off events. [2024-06-14 15:51:00,423 INFO L125 PetriNetUnfolderBase]: For 168732/168732 co-relation queries the response was YES. [2024-06-14 15:51:00,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6135 conditions, 1113 events. 602/1113 cut-off events. For 168732/168732 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 5930 event pairs, 70 based on Foata normal form. 10/1121 useless extension candidates. Maximal degree in co-relation 6004. Up to 660 conditions per place. [2024-06-14 15:51:00,434 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 127 selfloop transitions, 98 changer transitions 23/250 dead transitions. [2024-06-14 15:51:00,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 250 transitions, 2306 flow [2024-06-14 15:51:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:51:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:51:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 15:51:00,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 15:51:00,435 INFO L175 Difference]: Start difference. First operand has 280 places, 226 transitions, 1734 flow. Second operand 11 states and 135 transitions. [2024-06-14 15:51:00,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 250 transitions, 2306 flow [2024-06-14 15:51:00,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 250 transitions, 2098 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:51:00,668 INFO L231 Difference]: Finished difference. Result has 279 places, 220 transitions, 1685 flow [2024-06-14 15:51:00,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1526, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1685, PETRI_PLACES=279, PETRI_TRANSITIONS=220} [2024-06-14 15:51:00,669 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 248 predicate places. [2024-06-14 15:51:00,669 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 220 transitions, 1685 flow [2024-06-14 15:51:00,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:00,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:00,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:00,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-14 15:51:00,669 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:00,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:00,670 INFO L85 PathProgramCache]: Analyzing trace with hash -82281917, now seen corresponding path program 6 times [2024-06-14 15:51:00,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:00,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292121797] [2024-06-14 15:51:00,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:00,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:07,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:07,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292121797] [2024-06-14 15:51:07,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292121797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:07,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:07,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:51:07,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075378121] [2024-06-14 15:51:07,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:07,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:51:07,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:07,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:51:07,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:51:07,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:51:07,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 220 transitions, 1685 flow. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:07,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:07,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:51:07,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:07,921 INFO L124 PetriNetUnfolderBase]: 591/1092 cut-off events. [2024-06-14 15:51:07,921 INFO L125 PetriNetUnfolderBase]: For 165605/165605 co-relation queries the response was YES. [2024-06-14 15:51:07,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6018 conditions, 1092 events. 591/1092 cut-off events. For 165605/165605 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 5817 event pairs, 72 based on Foata normal form. 10/1100 useless extension candidates. Maximal degree in co-relation 5888. Up to 844 conditions per place. [2024-06-14 15:51:07,931 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 178 selfloop transitions, 47 changer transitions 14/241 dead transitions. [2024-06-14 15:51:07,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 241 transitions, 2229 flow [2024-06-14 15:51:07,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:51:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:51:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 15:51:07,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 15:51:07,932 INFO L175 Difference]: Start difference. First operand has 279 places, 220 transitions, 1685 flow. Second operand 11 states and 135 transitions. [2024-06-14 15:51:07,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 241 transitions, 2229 flow [2024-06-14 15:51:08,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 241 transitions, 2023 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 15:51:08,184 INFO L231 Difference]: Finished difference. Result has 268 places, 217 transitions, 1556 flow [2024-06-14 15:51:08,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1479, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1556, PETRI_PLACES=268, PETRI_TRANSITIONS=217} [2024-06-14 15:51:08,185 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 237 predicate places. [2024-06-14 15:51:08,185 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 217 transitions, 1556 flow [2024-06-14 15:51:08,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:08,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:08,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:08,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-14 15:51:08,187 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:08,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:08,187 INFO L85 PathProgramCache]: Analyzing trace with hash -82489307, now seen corresponding path program 7 times [2024-06-14 15:51:08,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:08,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702785873] [2024-06-14 15:51:08,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:08,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:15,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:15,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702785873] [2024-06-14 15:51:15,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702785873] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:15,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:15,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:51:15,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084888435] [2024-06-14 15:51:15,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:15,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:51:15,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:15,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:51:15,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:51:15,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:51:15,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 217 transitions, 1556 flow. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:15,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:15,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:51:15,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:16,003 INFO L124 PetriNetUnfolderBase]: 606/1129 cut-off events. [2024-06-14 15:51:16,004 INFO L125 PetriNetUnfolderBase]: For 197040/197040 co-relation queries the response was YES. [2024-06-14 15:51:16,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6939 conditions, 1129 events. 606/1129 cut-off events. For 197040/197040 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6048 event pairs, 81 based on Foata normal form. 8/1135 useless extension candidates. Maximal degree in co-relation 6813. Up to 819 conditions per place. [2024-06-14 15:51:16,014 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 183 selfloop transitions, 48 changer transitions 10/243 dead transitions. [2024-06-14 15:51:16,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 243 transitions, 2336 flow [2024-06-14 15:51:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:51:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:51:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-14 15:51:16,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-14 15:51:16,015 INFO L175 Difference]: Start difference. First operand has 268 places, 217 transitions, 1556 flow. Second operand 11 states and 140 transitions. [2024-06-14 15:51:16,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 243 transitions, 2336 flow [2024-06-14 15:51:16,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 243 transitions, 2234 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-14 15:51:16,314 INFO L231 Difference]: Finished difference. Result has 266 places, 215 transitions, 1544 flow [2024-06-14 15:51:16,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1544, PETRI_PLACES=266, PETRI_TRANSITIONS=215} [2024-06-14 15:51:16,314 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 235 predicate places. [2024-06-14 15:51:16,314 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 215 transitions, 1544 flow [2024-06-14 15:51:16,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:16,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:16,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:16,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-14 15:51:16,316 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:16,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:16,316 INFO L85 PathProgramCache]: Analyzing trace with hash -82483727, now seen corresponding path program 8 times [2024-06-14 15:51:16,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:16,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961359146] [2024-06-14 15:51:16,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:16,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:22,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:22,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961359146] [2024-06-14 15:51:22,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961359146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:22,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:22,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:51:22,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024193298] [2024-06-14 15:51:22,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:22,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:51:22,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:22,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:51:22,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:51:22,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:51:22,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 215 transitions, 1544 flow. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:22,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:22,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:51:22,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:22,803 INFO L124 PetriNetUnfolderBase]: 669/1250 cut-off events. [2024-06-14 15:51:22,803 INFO L125 PetriNetUnfolderBase]: For 204303/204303 co-relation queries the response was YES. [2024-06-14 15:51:22,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7412 conditions, 1250 events. 669/1250 cut-off events. For 204303/204303 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6810 event pairs, 125 based on Foata normal form. 10/1258 useless extension candidates. Maximal degree in co-relation 7287. Up to 985 conditions per place. [2024-06-14 15:51:22,815 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 202 selfloop transitions, 50 changer transitions 13/267 dead transitions. [2024-06-14 15:51:22,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 267 transitions, 2387 flow [2024-06-14 15:51:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:51:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:51:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2024-06-14 15:51:22,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3697916666666667 [2024-06-14 15:51:22,816 INFO L175 Difference]: Start difference. First operand has 266 places, 215 transitions, 1544 flow. Second operand 12 states and 142 transitions. [2024-06-14 15:51:22,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 267 transitions, 2387 flow [2024-06-14 15:51:23,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 267 transitions, 2245 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:51:23,246 INFO L231 Difference]: Finished difference. Result has 272 places, 235 transitions, 1789 flow [2024-06-14 15:51:23,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1789, PETRI_PLACES=272, PETRI_TRANSITIONS=235} [2024-06-14 15:51:23,247 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 241 predicate places. [2024-06-14 15:51:23,247 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 235 transitions, 1789 flow [2024-06-14 15:51:23,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:23,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:23,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:23,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-14 15:51:23,247 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:23,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:23,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1028852591, now seen corresponding path program 9 times [2024-06-14 15:51:23,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:23,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427638996] [2024-06-14 15:51:23,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:23,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:29,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:29,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427638996] [2024-06-14 15:51:29,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427638996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:29,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:29,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:51:29,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149073519] [2024-06-14 15:51:29,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:29,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:51:29,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:29,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:51:29,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:51:30,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 15:51:30,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 235 transitions, 1789 flow. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:30,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:30,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 15:51:30,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:30,634 INFO L124 PetriNetUnfolderBase]: 685/1286 cut-off events. [2024-06-14 15:51:30,634 INFO L125 PetriNetUnfolderBase]: For 242545/242545 co-relation queries the response was YES. [2024-06-14 15:51:30,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8619 conditions, 1286 events. 685/1286 cut-off events. For 242545/242545 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 7052 event pairs, 113 based on Foata normal form. 8/1292 useless extension candidates. Maximal degree in co-relation 8489. Up to 883 conditions per place. [2024-06-14 15:51:30,646 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 180 selfloop transitions, 70 changer transitions 10/262 dead transitions. [2024-06-14 15:51:30,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 262 transitions, 2605 flow [2024-06-14 15:51:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:51:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:51:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-14 15:51:30,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:51:30,647 INFO L175 Difference]: Start difference. First operand has 272 places, 235 transitions, 1789 flow. Second operand 11 states and 132 transitions. [2024-06-14 15:51:30,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 262 transitions, 2605 flow [2024-06-14 15:51:31,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 262 transitions, 2548 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:51:31,185 INFO L231 Difference]: Finished difference. Result has 273 places, 233 transitions, 1864 flow [2024-06-14 15:51:31,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1864, PETRI_PLACES=273, PETRI_TRANSITIONS=233} [2024-06-14 15:51:31,185 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 242 predicate places. [2024-06-14 15:51:31,186 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 233 transitions, 1864 flow [2024-06-14 15:51:31,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:31,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:31,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:31,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-14 15:51:31,186 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:31,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash -87846107, now seen corresponding path program 10 times [2024-06-14 15:51:31,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:31,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272939046] [2024-06-14 15:51:31,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:31,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:37,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:37,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272939046] [2024-06-14 15:51:37,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272939046] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:37,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:37,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:51:37,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559545381] [2024-06-14 15:51:37,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:37,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:51:37,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:37,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:51:37,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:51:37,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 15:51:37,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 233 transitions, 1864 flow. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:37,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:37,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 15:51:37,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:38,152 INFO L124 PetriNetUnfolderBase]: 654/1225 cut-off events. [2024-06-14 15:51:38,152 INFO L125 PetriNetUnfolderBase]: For 200945/200945 co-relation queries the response was YES. [2024-06-14 15:51:38,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7486 conditions, 1225 events. 654/1225 cut-off events. For 200945/200945 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6654 event pairs, 100 based on Foata normal form. 10/1233 useless extension candidates. Maximal degree in co-relation 7358. Up to 861 conditions per place. [2024-06-14 15:51:38,166 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 167 selfloop transitions, 71 changer transitions 16/256 dead transitions. [2024-06-14 15:51:38,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 256 transitions, 2442 flow [2024-06-14 15:51:38,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:51:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:51:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-14 15:51:38,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-14 15:51:38,167 INFO L175 Difference]: Start difference. First operand has 273 places, 233 transitions, 1864 flow. Second operand 11 states and 139 transitions. [2024-06-14 15:51:38,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 256 transitions, 2442 flow [2024-06-14 15:51:38,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 256 transitions, 2300 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:51:38,579 INFO L231 Difference]: Finished difference. Result has 272 places, 229 transitions, 1842 flow [2024-06-14 15:51:38,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1842, PETRI_PLACES=272, PETRI_TRANSITIONS=229} [2024-06-14 15:51:38,579 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 241 predicate places. [2024-06-14 15:51:38,579 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 229 transitions, 1842 flow [2024-06-14 15:51:38,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:38,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:38,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:38,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-14 15:51:38,580 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:38,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:38,580 INFO L85 PathProgramCache]: Analyzing trace with hash -87995837, now seen corresponding path program 11 times [2024-06-14 15:51:38,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:38,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184781323] [2024-06-14 15:51:38,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:38,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15