./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 15:42:22,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:42:22,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:42:22,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:42:22,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:42:22,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:42:22,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:42:22,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:42:22,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:42:22,161 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:42:22,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:42:22,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:42:22,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:42:22,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:42:22,165 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:42:22,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:42:22,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:42:22,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:42:22,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:42:22,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:42:22,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:42:22,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:42:22,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:42:22,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:42:22,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:42:22,168 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:42:22,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:42:22,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:42:22,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:42:22,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:42:22,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:42:22,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:42:22,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:42:22,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:42:22,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:42:22,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:42:22,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:42:22,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:42:22,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:42:22,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:42:22,173 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:42:22,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:42:22,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:42:22,174 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:42:22,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:42:22,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:42:22,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:42:22,502 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:42:22,503 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:42:22,504 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/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-14 15:42:22,652 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:42:22,652 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:42:22,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:42:23,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:42:24,120 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:42:24,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:42:24,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e9aef9c/58c31a3721b74e5d8b392742f8579396/FLAG064007ae4 [2024-06-14 15:42:24,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e9aef9c/58c31a3721b74e5d8b392742f8579396 [2024-06-14 15:42:24,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:42:24,158 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:42:24,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:42:24,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:42:24,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:42:24,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:42:22" (1/2) ... [2024-06-14 15:42:24,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f799fc4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:24, skipping insertion in model container [2024-06-14 15:42:24,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:42:22" (1/2) ... [2024-06-14 15:42:24,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@541ad737 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:42:24, skipping insertion in model container [2024-06-14 15:42:24,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:42:24" (2/2) ... [2024-06-14 15:42:24,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f799fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:24, skipping insertion in model container [2024-06-14 15:42:24,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:42:24" (2/2) ... [2024-06-14 15:42:24,170 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:42:24,237 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:42:24,238 INFO L97 edCorrectnessWitness]: Location invariant before [L813-L813] (((((((((((((((! 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 || 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_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_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_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$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )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_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$w_buff0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff1) + (long long )y >= 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 )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 )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 )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 )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$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$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$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_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_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_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$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_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 )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) && (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) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 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_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)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((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 == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:42:24,239 INFO L97 edCorrectnessWitness]: Location invariant before [L814-L814] (((((((((((((((! 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 || 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_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_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_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$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )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_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$w_buff0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff1) + (long long )y >= 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 )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 )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 )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 )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$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$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$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_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_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_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$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_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 )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) && (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) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 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_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)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((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 == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-14 15:42:24,239 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:42:24,239 INFO L106 edCorrectnessWitness]: ghost_update [L811-L811] multithreaded = 1; [2024-06-14 15:42:24,288 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:42:24,626 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:42:24,637 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:42:24,962 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:42:25,002 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:42:25,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:25 WrapperNode [2024-06-14 15:42:25,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:42:25,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:42:25,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:42:25,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:42:25,011 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:42:25" (1/1) ... [2024-06-14 15:42:25,050 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:42:25" (1/1) ... [2024-06-14 15:42:25,132 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 113 [2024-06-14 15:42:25,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:42:25,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:42:25,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:42:25,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:42:25,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:25" (1/1) ... [2024-06-14 15:42:25,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:25" (1/1) ... [2024-06-14 15:42:25,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:25" (1/1) ... [2024-06-14 15:42:25,262 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:42:25,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:25" (1/1) ... [2024-06-14 15:42:25,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:25" (1/1) ... [2024-06-14 15:42:25,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:25" (1/1) ... [2024-06-14 15:42:25,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:25" (1/1) ... [2024-06-14 15:42:25,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:25" (1/1) ... [2024-06-14 15:42:25,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:25" (1/1) ... [2024-06-14 15:42:25,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:42:25,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:42:25,322 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:42:25,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:42:25,323 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:25" (1/1) ... [2024-06-14 15:42:25,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:42:25,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:42:25,349 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:42:25,377 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:42:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:42:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:42:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:42:25,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:42:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:42:25,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:42:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:42:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:42:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:42:25,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:42:25,411 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:42:25,537 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:42:25,539 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:42:26,362 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:42:26,362 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:42:26,583 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:42:26,583 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:42:26,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:42:26 BoogieIcfgContainer [2024-06-14 15:42:26,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:42:26,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:42:26,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:42:26,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:42:26,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:42:22" (1/4) ... [2024-06-14 15:42:26,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89eb524 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:42:26, skipping insertion in model container [2024-06-14 15:42:26,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:42:24" (2/4) ... [2024-06-14 15:42:26,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89eb524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:42:26, skipping insertion in model container [2024-06-14 15:42:26,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:42:25" (3/4) ... [2024-06-14 15:42:26,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89eb524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:42:26, skipping insertion in model container [2024-06-14 15:42:26,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:42:26" (4/4) ... [2024-06-14 15:42:26,601 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:42:26,619 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:42:26,619 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:42:26,619 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:42:26,711 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:42:26,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-14 15:42:26,788 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-14 15:42:26,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:42:26,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:42:26,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-14 15:42:26,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-14 15:42:26,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:42:26,809 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;@73fa357f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:42:26,810 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:42:26,816 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:42:26,816 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:42:26,816 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:42:26,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:26,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:42:26,818 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:42:26,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:26,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1505849308, now seen corresponding path program 1 times [2024-06-14 15:42:26,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:26,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136370877] [2024-06-14 15:42:26,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:26,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:31,706 INFO L134 CoverageAnalysis]: 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:31,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:31,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136370877] [2024-06-14 15:42:31,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136370877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:31,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:31,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:42:31,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402295594] [2024-06-14 15:42:31,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:31,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:42:31,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:31,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:42:31,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:42:31,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 15:42:31,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 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:42:31,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:31,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 15:42:31,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:32,096 INFO L124 PetriNetUnfolderBase]: 162/307 cut-off events. [2024-06-14 15:42:32,097 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-14 15:42:32,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 307 events. 162/307 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1113 event pairs, 97 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 606. Up to 288 conditions per place. [2024-06-14 15:42:32,103 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-14 15:42:32,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 119 flow [2024-06-14 15:42:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:42:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:42:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-06-14 15:42:32,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2024-06-14 15:42:32,116 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 52 transitions. [2024-06-14 15:42:32,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 119 flow [2024-06-14 15:42:32,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 15:42:32,120 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-14 15:42:32,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-14 15:42:32,125 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-14 15:42:32,125 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-14 15:42:32,125 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:42:32,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:32,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:32,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:42:32,126 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:42:32,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash -282759621, now seen corresponding path program 1 times [2024-06-14 15:42:32,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:32,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886896730] [2024-06-14 15:42:32,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:32,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:35,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:42:35,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:35,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886896730] [2024-06-14 15:42:35,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886896730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:35,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:35,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:42:35,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355884702] [2024-06-14 15:42:35,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:35,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:42:35,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:35,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:42:35,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:42:35,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-14 15:42:35,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 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:42:35,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:35,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-14 15:42:35,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:36,090 INFO L124 PetriNetUnfolderBase]: 159/304 cut-off events. [2024-06-14 15:42:36,090 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-14 15:42:36,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 304 events. 159/304 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1089 event pairs, 79 based on Foata normal form. 2/306 useless extension candidates. Maximal degree in co-relation 679. Up to 274 conditions per place. [2024-06-14 15:42:36,097 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 27 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-14 15:42:36,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 161 flow [2024-06-14 15:42:36,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:42:36,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:42:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2024-06-14 15:42:36,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-06-14 15:42:36,102 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 66 transitions. [2024-06-14 15:42:36,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 161 flow [2024-06-14 15:42:36,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:42:36,106 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-14 15:42:36,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-14 15:42:36,107 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-14 15:42:36,108 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-14 15:42:36,109 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:42:36,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:36,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:36,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:42:36,110 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:42:36,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:36,114 INFO L85 PathProgramCache]: Analyzing trace with hash -175612531, now seen corresponding path program 1 times [2024-06-14 15:42:36,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:36,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875620342] [2024-06-14 15:42:36,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:36,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:39,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:39,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875620342] [2024-06-14 15:42:39,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875620342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:39,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:39,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:42:39,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944549345] [2024-06-14 15:42:39,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:39,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:42:39,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:39,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:42:39,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:42:39,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-14 15:42:39,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:39,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:39,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-14 15:42:39,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:39,975 INFO L124 PetriNetUnfolderBase]: 187/339 cut-off events. [2024-06-14 15:42:39,976 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-06-14 15:42:39,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 339 events. 187/339 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1188 event pairs, 67 based on Foata normal form. 3/342 useless extension candidates. Maximal degree in co-relation 852. Up to 293 conditions per place. [2024-06-14 15:42:39,979 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 36 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2024-06-14 15:42:39,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 255 flow [2024-06-14 15:42:39,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:42:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:42:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-06-14 15:42:39,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5290322580645161 [2024-06-14 15:42:39,987 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 82 transitions. [2024-06-14 15:42:39,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 255 flow [2024-06-14 15:42:39,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 246 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 15:42:39,991 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 162 flow [2024-06-14 15:42:39,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2024-06-14 15:42:39,992 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-14 15:42:39,993 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 162 flow [2024-06-14 15:42:39,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:39,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:39,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:39,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:42:39,994 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:42:39,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:39,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1149020006, now seen corresponding path program 1 times [2024-06-14 15:42:39,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:39,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102002651] [2024-06-14 15:42:39,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:39,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:43,723 INFO L134 CoverageAnalysis]: 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:43,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:43,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102002651] [2024-06-14 15:42:43,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102002651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:43,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:43,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:42:43,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668909739] [2024-06-14 15:42:43,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:43,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:42:43,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:43,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:42:43,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:42:43,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-14 15:42:43,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:43,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-14 15:42:43,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:44,122 INFO L124 PetriNetUnfolderBase]: 188/341 cut-off events. [2024-06-14 15:42:44,123 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES. [2024-06-14 15:42:44,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 341 events. 188/341 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1198 event pairs, 46 based on Foata normal form. 3/344 useless extension candidates. Maximal degree in co-relation 1026. Up to 282 conditions per place. [2024-06-14 15:42:44,127 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 40 selfloop transitions, 14 changer transitions 0/56 dead transitions. [2024-06-14 15:42:44,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 340 flow [2024-06-14 15:42:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:42:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:42:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-14 15:42:44,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-06-14 15:42:44,132 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 162 flow. Second operand 6 states and 96 transitions. [2024-06-14 15:42:44,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 340 flow [2024-06-14 15:42:44,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 336 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-14 15:42:44,139 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 214 flow [2024-06-14 15:42:44,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-14 15:42:44,141 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-14 15:42:44,141 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 214 flow [2024-06-14 15:42:44,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call 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:44,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:44,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:44,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:42:44,142 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:42:44,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:44,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1260475274, now seen corresponding path program 1 times [2024-06-14 15:42:44,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:44,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780711594] [2024-06-14 15:42:44,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:47,976 INFO L134 CoverageAnalysis]: 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:47,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:47,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780711594] [2024-06-14 15:42:47,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780711594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:47,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:47,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:42:47,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946478362] [2024-06-14 15:42:47,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:47,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:42:47,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:47,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:42:47,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:42:48,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-14 15:42:48,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:48,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:48,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-14 15:42:48,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:48,469 INFO L124 PetriNetUnfolderBase]: 189/344 cut-off events. [2024-06-14 15:42:48,470 INFO L125 PetriNetUnfolderBase]: For 640/640 co-relation queries the response was YES. [2024-06-14 15:42:48,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 344 events. 189/344 cut-off events. For 640/640 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1218 event pairs, 24 based on Foata normal form. 6/350 useless extension candidates. Maximal degree in co-relation 1156. Up to 259 conditions per place. [2024-06-14 15:42:48,473 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 40 selfloop transitions, 16 changer transitions 0/58 dead transitions. [2024-06-14 15:42:48,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 386 flow [2024-06-14 15:42:48,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:42:48,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:42:48,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2024-06-14 15:42:48,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2024-06-14 15:42:48,475 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 214 flow. Second operand 7 states and 105 transitions. [2024-06-14 15:42:48,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 386 flow [2024-06-14 15:42:48,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 354 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 15:42:48,479 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 217 flow [2024-06-14 15:42:48,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-06-14 15:42:48,479 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-14 15:42:48,480 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 217 flow [2024-06-14 15:42:48,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:48,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:48,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:48,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:42:48,481 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:42:48,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1934851801, now seen corresponding path program 1 times [2024-06-14 15:42:48,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:48,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564002736] [2024-06-14 15:42:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:48,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:54,593 INFO L134 CoverageAnalysis]: 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:54,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:54,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564002736] [2024-06-14 15:42:54,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564002736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:54,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:54,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:42:54,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573038508] [2024-06-14 15:42:54,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:54,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:42:54,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:54,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:42:54,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:42:54,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:42:54,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:54,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:54,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:42:54,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:55,034 INFO L124 PetriNetUnfolderBase]: 187/341 cut-off events. [2024-06-14 15:42:55,034 INFO L125 PetriNetUnfolderBase]: For 747/747 co-relation queries the response was YES. [2024-06-14 15:42:55,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 341 events. 187/341 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1194 event pairs, 47 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 1202. Up to 329 conditions per place. [2024-06-14 15:42:55,038 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 35 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2024-06-14 15:42:55,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 311 flow [2024-06-14 15:42:55,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:42:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:42:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2024-06-14 15:42:55,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-14 15:42:55,040 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 217 flow. Second operand 5 states and 60 transitions. [2024-06-14 15:42:55,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 311 flow [2024-06-14 15:42:55,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 270 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 15:42:55,044 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 193 flow [2024-06-14 15:42:55,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-06-14 15:42:55,047 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-14 15:42:55,047 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 193 flow [2024-06-14 15:42:55,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:55,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:55,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:55,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:42:55,048 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:42:55,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:55,049 INFO L85 PathProgramCache]: Analyzing trace with hash 137115187, now seen corresponding path program 1 times [2024-06-14 15:42:55,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:55,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203125176] [2024-06-14 15:42:55,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:55,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:00,594 INFO L134 CoverageAnalysis]: 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:00,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:00,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203125176] [2024-06-14 15:43:00,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203125176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:00,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:00,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:43:00,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855191192] [2024-06-14 15:43:00,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:00,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:43:00,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:00,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:43:00,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:43:00,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:43:00,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 193 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:43:00,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:00,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:43:00,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:01,081 INFO L124 PetriNetUnfolderBase]: 181/332 cut-off events. [2024-06-14 15:43:01,082 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES. [2024-06-14 15:43:01,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 332 events. 181/332 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1134 event pairs, 44 based on Foata normal form. 3/335 useless extension candidates. Maximal degree in co-relation 1128. Up to 311 conditions per place. [2024-06-14 15:43:01,084 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-14 15:43:01,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 311 flow [2024-06-14 15:43:01,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:43:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:43:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2024-06-14 15:43:01,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2024-06-14 15:43:01,086 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 193 flow. Second operand 6 states and 71 transitions. [2024-06-14 15:43:01,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 311 flow [2024-06-14 15:43:01,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 296 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-14 15:43:01,089 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 211 flow [2024-06-14 15:43:01,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-06-14 15:43:01,090 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2024-06-14 15:43:01,090 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 211 flow [2024-06-14 15:43:01,090 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:43:01,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:01,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:01,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:43:01,091 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:43:01,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:01,091 INFO L85 PathProgramCache]: Analyzing trace with hash -514451052, now seen corresponding path program 1 times [2024-06-14 15:43:01,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:01,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455813292] [2024-06-14 15:43:01,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:01,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:06,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:43:06,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:06,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455813292] [2024-06-14 15:43:06,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455813292] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:06,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:06,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:43:06,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279007600] [2024-06-14 15:43:06,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:06,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:43:06,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:06,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:43:06,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:43:06,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:43:06,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 211 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:43:06,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:06,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:43:06,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:06,436 INFO L124 PetriNetUnfolderBase]: 182/334 cut-off events. [2024-06-14 15:43:06,436 INFO L125 PetriNetUnfolderBase]: For 1009/1009 co-relation queries the response was YES. [2024-06-14 15:43:06,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 334 events. 182/334 cut-off events. For 1009/1009 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1159 event pairs, 43 based on Foata normal form. 2/336 useless extension candidates. Maximal degree in co-relation 1200. Up to 288 conditions per place. [2024-06-14 15:43:06,439 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 37 selfloop transitions, 13 changer transitions 0/52 dead transitions. [2024-06-14 15:43:06,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 362 flow [2024-06-14 15:43:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:43:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:43:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-06-14 15:43:06,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41397849462365593 [2024-06-14 15:43:06,440 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 211 flow. Second operand 6 states and 77 transitions. [2024-06-14 15:43:06,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 362 flow [2024-06-14 15:43:06,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 345 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:43:06,447 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 242 flow [2024-06-14 15:43:06,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-14 15:43:06,451 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2024-06-14 15:43:06,451 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 242 flow [2024-06-14 15:43:06,451 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:43:06,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:06,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:06,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:43:06,452 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:43:06,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:06,453 INFO L85 PathProgramCache]: Analyzing trace with hash 328281990, now seen corresponding path program 2 times [2024-06-14 15:43:06,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:06,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191485999] [2024-06-14 15:43:06,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:06,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:10,625 INFO L134 CoverageAnalysis]: 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:10,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:10,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191485999] [2024-06-14 15:43:10,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191485999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:10,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:10,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:43:10,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489316814] [2024-06-14 15:43:10,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:10,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:43:10,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:10,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:43:10,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:43:10,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:43:10,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 242 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:43:10,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:10,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:43:10,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:11,003 INFO L124 PetriNetUnfolderBase]: 177/327 cut-off events. [2024-06-14 15:43:11,004 INFO L125 PetriNetUnfolderBase]: For 1252/1252 co-relation queries the response was YES. [2024-06-14 15:43:11,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 327 events. 177/327 cut-off events. For 1252/1252 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1125 event pairs, 88 based on Foata normal form. 1/328 useless extension candidates. Maximal degree in co-relation 1204. Up to 309 conditions per place. [2024-06-14 15:43:11,007 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 37 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2024-06-14 15:43:11,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 49 transitions, 361 flow [2024-06-14 15:43:11,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:43:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:43:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2024-06-14 15:43:11,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35023041474654376 [2024-06-14 15:43:11,008 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 242 flow. Second operand 7 states and 76 transitions. [2024-06-14 15:43:11,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 49 transitions, 361 flow [2024-06-14 15:43:11,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 345 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 15:43:11,012 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 269 flow [2024-06-14 15:43:11,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-06-14 15:43:11,012 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-06-14 15:43:11,013 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 269 flow [2024-06-14 15:43:11,013 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:43:11,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:11,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:11,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:43:11,013 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:43:11,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:11,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1202049722, now seen corresponding path program 1 times [2024-06-14 15:43:11,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:11,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487687838] [2024-06-14 15:43:11,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:11,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:17,120 INFO L134 CoverageAnalysis]: 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:17,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:17,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487687838] [2024-06-14 15:43:17,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487687838] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:17,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:17,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:43:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000771110] [2024-06-14 15:43:17,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:17,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:43:17,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:17,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:43:17,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:43:17,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:43:17,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 269 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:43:17,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:17,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:43:17,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:17,710 INFO L124 PetriNetUnfolderBase]: 227/409 cut-off events. [2024-06-14 15:43:17,711 INFO L125 PetriNetUnfolderBase]: For 1889/1889 co-relation queries the response was YES. [2024-06-14 15:43:17,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 409 events. 227/409 cut-off events. For 1889/1889 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1510 event pairs, 44 based on Foata normal form. 6/415 useless extension candidates. Maximal degree in co-relation 1535. Up to 289 conditions per place. [2024-06-14 15:43:17,714 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 54 selfloop transitions, 23 changer transitions 0/79 dead transitions. [2024-06-14 15:43:17,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 602 flow [2024-06-14 15:43:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:43:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:43:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-14 15:43:17,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314516129032258 [2024-06-14 15:43:17,717 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 269 flow. Second operand 8 states and 107 transitions. [2024-06-14 15:43:17,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 602 flow [2024-06-14 15:43:17,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 554 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 15:43:17,723 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 410 flow [2024-06-14 15:43:17,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=410, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2024-06-14 15:43:17,725 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2024-06-14 15:43:17,725 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 410 flow [2024-06-14 15:43:17,725 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:43:17,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:17,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:17,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:43:17,726 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:43:17,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:17,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1553636556, now seen corresponding path program 2 times [2024-06-14 15:43:17,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:17,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476739141] [2024-06-14 15:43:17,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:17,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:22,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:22,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476739141] [2024-06-14 15:43:22,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476739141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:22,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:22,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:43:22,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174378032] [2024-06-14 15:43:22,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:22,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:43:22,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:22,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:43:22,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:43:22,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:43:22,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 410 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:43:22,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:22,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:43:22,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:22,757 INFO L124 PetriNetUnfolderBase]: 265/471 cut-off events. [2024-06-14 15:43:22,758 INFO L125 PetriNetUnfolderBase]: For 2630/2630 co-relation queries the response was YES. [2024-06-14 15:43:22,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 471 events. 265/471 cut-off events. For 2630/2630 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1799 event pairs, 55 based on Foata normal form. 6/477 useless extension candidates. Maximal degree in co-relation 2026. Up to 305 conditions per place. [2024-06-14 15:43:22,761 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 48 selfloop transitions, 31 changer transitions 0/81 dead transitions. [2024-06-14 15:43:22,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 678 flow [2024-06-14 15:43:22,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:43:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:43:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-14 15:43:22,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 15:43:22,763 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 410 flow. Second operand 7 states and 93 transitions. [2024-06-14 15:43:22,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 678 flow [2024-06-14 15:43:22,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 81 transitions, 666 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-14 15:43:22,769 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 516 flow [2024-06-14 15:43:22,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=516, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2024-06-14 15:43:22,770 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2024-06-14 15:43:22,770 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 516 flow [2024-06-14 15:43:22,770 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:43:22,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:22,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:22,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:43:22,771 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:43:22,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:22,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1587045232, now seen corresponding path program 3 times [2024-06-14 15:43:22,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:22,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428209109] [2024-06-14 15:43:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:22,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:27,099 INFO L134 CoverageAnalysis]: 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:27,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:27,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428209109] [2024-06-14 15:43:27,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428209109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:27,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:27,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:43:27,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073278595] [2024-06-14 15:43:27,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:27,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:43:27,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:27,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:43:27,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:43:27,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:43:27,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 516 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:43:27,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:27,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:43:27,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:27,504 INFO L124 PetriNetUnfolderBase]: 274/486 cut-off events. [2024-06-14 15:43:27,505 INFO L125 PetriNetUnfolderBase]: For 3214/3214 co-relation queries the response was YES. [2024-06-14 15:43:27,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 486 events. 274/486 cut-off events. For 3214/3214 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1852 event pairs, 104 based on Foata normal form. 3/489 useless extension candidates. Maximal degree in co-relation 2289. Up to 460 conditions per place. [2024-06-14 15:43:27,509 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 62 selfloop transitions, 12 changer transitions 0/76 dead transitions. [2024-06-14 15:43:27,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 76 transitions, 703 flow [2024-06-14 15:43:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:43:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:43:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-14 15:43:27,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-14 15:43:27,510 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 516 flow. Second operand 8 states and 87 transitions. [2024-06-14 15:43:27,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 76 transitions, 703 flow [2024-06-14 15:43:27,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 76 transitions, 665 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-14 15:43:27,517 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 529 flow [2024-06-14 15:43:27,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=529, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2024-06-14 15:43:27,518 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 43 predicate places. [2024-06-14 15:43:27,518 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 529 flow [2024-06-14 15:43:27,518 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:43:27,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:27,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:27,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:43:27,519 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:43:27,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1198929262, now seen corresponding path program 4 times [2024-06-14 15:43:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:27,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757084297] [2024-06-14 15:43:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:31,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:43:31,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:31,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757084297] [2024-06-14 15:43:31,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757084297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:31,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:31,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:43:31,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420463680] [2024-06-14 15:43:31,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:31,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:43:31,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:31,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:43:31,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:43:32,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:43:32,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 529 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:43:32,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:32,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:43:32,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:32,350 INFO L124 PetriNetUnfolderBase]: 268/477 cut-off events. [2024-06-14 15:43:32,350 INFO L125 PetriNetUnfolderBase]: For 3011/3011 co-relation queries the response was YES. [2024-06-14 15:43:32,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2234 conditions, 477 events. 268/477 cut-off events. For 3011/3011 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1829 event pairs, 102 based on Foata normal form. 3/480 useless extension candidates. Maximal degree in co-relation 2195. Up to 439 conditions per place. [2024-06-14 15:43:32,355 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 64 selfloop transitions, 14 changer transitions 0/80 dead transitions. [2024-06-14 15:43:32,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 80 transitions, 733 flow [2024-06-14 15:43:32,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:43:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:43:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2024-06-14 15:43:32,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-14 15:43:32,357 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 529 flow. Second operand 7 states and 84 transitions. [2024-06-14 15:43:32,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 80 transitions, 733 flow [2024-06-14 15:43:32,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 80 transitions, 701 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:43:32,369 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 554 flow [2024-06-14 15:43:32,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=554, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2024-06-14 15:43:32,370 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2024-06-14 15:43:32,371 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 554 flow [2024-06-14 15:43:32,371 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:43:32,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:32,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:32,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:43:32,371 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:43:32,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash -268215941, now seen corresponding path program 1 times [2024-06-14 15:43:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:32,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506019045] [2024-06-14 15:43:32,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:32,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:38,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:43:38,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:38,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506019045] [2024-06-14 15:43:38,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506019045] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:38,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:38,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:43:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476832924] [2024-06-14 15:43:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:38,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:43:38,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:38,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:43:38,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:43:38,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:43:38,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 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:43:38,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:38,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:43:38,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:39,192 INFO L124 PetriNetUnfolderBase]: 283/503 cut-off events. [2024-06-14 15:43:39,193 INFO L125 PetriNetUnfolderBase]: For 3362/3362 co-relation queries the response was YES. [2024-06-14 15:43:39,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2383 conditions, 503 events. 283/503 cut-off events. For 3362/3362 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1976 event pairs, 60 based on Foata normal form. 1/504 useless extension candidates. Maximal degree in co-relation 2344. Up to 425 conditions per place. [2024-06-14 15:43:39,197 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 66 selfloop transitions, 23 changer transitions 0/91 dead transitions. [2024-06-14 15:43:39,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 838 flow [2024-06-14 15:43:39,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:43:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:43:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 15:43:39,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2024-06-14 15:43:39,199 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 554 flow. Second operand 8 states and 99 transitions. [2024-06-14 15:43:39,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 838 flow [2024-06-14 15:43:39,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 91 transitions, 801 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 15:43:39,204 INFO L231 Difference]: Finished difference. Result has 78 places, 78 transitions, 628 flow [2024-06-14 15:43:39,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=628, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2024-06-14 15:43:39,206 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2024-06-14 15:43:39,206 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 78 transitions, 628 flow [2024-06-14 15:43:39,206 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:43:39,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:39,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:39,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:43:39,207 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:43:39,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:39,207 INFO L85 PathProgramCache]: Analyzing trace with hash 322704401, now seen corresponding path program 2 times [2024-06-14 15:43:39,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:39,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794077964] [2024-06-14 15:43:39,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:39,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:44,221 INFO L134 CoverageAnalysis]: 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:44,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:44,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794077964] [2024-06-14 15:43:44,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794077964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:44,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:44,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:43:44,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486514746] [2024-06-14 15:43:44,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:44,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:43:44,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:44,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:43:44,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:43:44,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:43:44,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 78 transitions, 628 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:43:44,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:44,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:43:44,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:44,646 INFO L124 PetriNetUnfolderBase]: 281/500 cut-off events. [2024-06-14 15:43:44,647 INFO L125 PetriNetUnfolderBase]: For 3756/3756 co-relation queries the response was YES. [2024-06-14 15:43:44,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 500 events. 281/500 cut-off events. For 3756/3756 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1942 event pairs, 54 based on Foata normal form. 1/501 useless extension candidates. Maximal degree in co-relation 2410. Up to 434 conditions per place. [2024-06-14 15:43:44,650 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 66 selfloop transitions, 21 changer transitions 0/89 dead transitions. [2024-06-14 15:43:44,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 89 transitions, 835 flow [2024-06-14 15:43:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:43:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:43:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 15:43:44,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-14 15:43:44,652 INFO L175 Difference]: Start difference. First operand has 78 places, 78 transitions, 628 flow. Second operand 8 states and 97 transitions. [2024-06-14 15:43:44,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 89 transitions, 835 flow [2024-06-14 15:43:44,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 816 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-14 15:43:44,661 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 656 flow [2024-06-14 15:43:44,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=656, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2024-06-14 15:43:44,662 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-06-14 15:43:44,662 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 656 flow [2024-06-14 15:43:44,662 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:43:44,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:44,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:44,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:43:44,663 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:43:44,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:44,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1729931091, now seen corresponding path program 3 times [2024-06-14 15:43:44,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:44,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339201883] [2024-06-14 15:43:44,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:44,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:50,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:50,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339201883] [2024-06-14 15:43:50,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339201883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:50,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:50,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:43:50,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723954836] [2024-06-14 15:43:50,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:50,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:43:50,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:50,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:43:50,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:43:50,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:43:50,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 656 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:43:50,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:50,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:43:50,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:50,682 INFO L124 PetriNetUnfolderBase]: 288/512 cut-off events. [2024-06-14 15:43:50,682 INFO L125 PetriNetUnfolderBase]: For 4386/4386 co-relation queries the response was YES. [2024-06-14 15:43:50,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2581 conditions, 512 events. 288/512 cut-off events. For 4386/4386 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1997 event pairs, 58 based on Foata normal form. 1/513 useless extension candidates. Maximal degree in co-relation 2538. Up to 412 conditions per place. [2024-06-14 15:43:50,687 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 66 selfloop transitions, 30 changer transitions 0/98 dead transitions. [2024-06-14 15:43:50,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 98 transitions, 962 flow [2024-06-14 15:43:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:43:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:43:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 15:43:50,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2024-06-14 15:43:50,691 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 656 flow. Second operand 8 states and 99 transitions. [2024-06-14 15:43:50,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 98 transitions, 962 flow [2024-06-14 15:43:50,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 98 transitions, 920 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 15:43:50,701 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 757 flow [2024-06-14 15:43:50,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=757, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2024-06-14 15:43:50,702 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 58 predicate places. [2024-06-14 15:43:50,702 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 757 flow [2024-06-14 15:43:50,703 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:43:50,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:50,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:50,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:43:50,704 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:43:50,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:50,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1391159500, now seen corresponding path program 1 times [2024-06-14 15:43:50,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:50,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394960627] [2024-06-14 15:43:50,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:50,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:56,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:56,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394960627] [2024-06-14 15:43:56,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394960627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:56,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:56,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:43:56,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646190620] [2024-06-14 15:43:56,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:56,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:43:56,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:56,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:43:56,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:43:56,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:43:56,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 757 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:43:56,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:56,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:43:56,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:57,427 INFO L124 PetriNetUnfolderBase]: 301/534 cut-off events. [2024-06-14 15:43:57,428 INFO L125 PetriNetUnfolderBase]: For 5370/5370 co-relation queries the response was YES. [2024-06-14 15:43:57,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2825 conditions, 534 events. 301/534 cut-off events. For 5370/5370 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2146 event pairs, 55 based on Foata normal form. 3/537 useless extension candidates. Maximal degree in co-relation 2779. Up to 397 conditions per place. [2024-06-14 15:43:57,434 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 83 selfloop transitions, 27 changer transitions 0/112 dead transitions. [2024-06-14 15:43:57,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 112 transitions, 1166 flow [2024-06-14 15:43:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:43:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:43:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-14 15:43:57,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435483870967742 [2024-06-14 15:43:57,435 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 757 flow. Second operand 8 states and 110 transitions. [2024-06-14 15:43:57,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 112 transitions, 1166 flow [2024-06-14 15:43:57,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 112 transitions, 1120 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-14 15:43:57,448 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 847 flow [2024-06-14 15:43:57,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=847, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2024-06-14 15:43:57,448 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2024-06-14 15:43:57,449 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 847 flow [2024-06-14 15:43:57,449 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:43:57,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:57,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:57,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:43:57,449 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:43:57,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:57,450 INFO L85 PathProgramCache]: Analyzing trace with hash 803419758, now seen corresponding path program 2 times [2024-06-14 15:43:57,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:57,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021756454] [2024-06-14 15:43:57,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:57,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:04,151 INFO L134 CoverageAnalysis]: 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:04,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:04,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021756454] [2024-06-14 15:44:04,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021756454] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:04,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:04,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:04,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60319911] [2024-06-14 15:44:04,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:04,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:04,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:04,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:04,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:04,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:44:04,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 847 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:44:04,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:04,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:44:04,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:04,782 INFO L124 PetriNetUnfolderBase]: 295/525 cut-off events. [2024-06-14 15:44:04,783 INFO L125 PetriNetUnfolderBase]: For 5576/5576 co-relation queries the response was YES. [2024-06-14 15:44:04,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 525 events. 295/525 cut-off events. For 5576/5576 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2089 event pairs, 53 based on Foata normal form. 3/528 useless extension candidates. Maximal degree in co-relation 2826. Up to 393 conditions per place. [2024-06-14 15:44:04,789 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 81 selfloop transitions, 28 changer transitions 0/111 dead transitions. [2024-06-14 15:44:04,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 111 transitions, 1166 flow [2024-06-14 15:44:04,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:44:04,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:44:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 15:44:04,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-14 15:44:04,791 INFO L175 Difference]: Start difference. First operand has 95 places, 90 transitions, 847 flow. Second operand 9 states and 117 transitions. [2024-06-14 15:44:04,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 111 transitions, 1166 flow [2024-06-14 15:44:04,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 111 transitions, 1114 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:44:04,804 INFO L231 Difference]: Finished difference. Result has 99 places, 90 transitions, 856 flow [2024-06-14 15:44:04,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=856, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2024-06-14 15:44:04,805 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2024-06-14 15:44:04,805 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 856 flow [2024-06-14 15:44:04,805 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:44:04,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:04,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:04,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:44:04,806 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:44:04,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:04,806 INFO L85 PathProgramCache]: Analyzing trace with hash -921907197, now seen corresponding path program 4 times [2024-06-14 15:44:04,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:04,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319896651] [2024-06-14 15:44:04,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:04,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:10,245 INFO L134 CoverageAnalysis]: 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:10,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:10,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319896651] [2024-06-14 15:44:10,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319896651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:10,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:10,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:44:10,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230278826] [2024-06-14 15:44:10,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:10,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:44:10,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:10,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:44:10,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:44:10,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:44:10,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 856 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:44:10,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:10,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:44:10,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:10,630 INFO L124 PetriNetUnfolderBase]: 298/530 cut-off events. [2024-06-14 15:44:10,630 INFO L125 PetriNetUnfolderBase]: For 5949/5949 co-relation queries the response was YES. [2024-06-14 15:44:10,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 530 events. 298/530 cut-off events. For 5949/5949 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2116 event pairs, 59 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 2893. Up to 422 conditions per place. [2024-06-14 15:44:10,636 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 67 selfloop transitions, 34 changer transitions 0/103 dead transitions. [2024-06-14 15:44:10,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 103 transitions, 1140 flow [2024-06-14 15:44:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:44:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:44:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-14 15:44:10,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41013824884792627 [2024-06-14 15:44:10,637 INFO L175 Difference]: Start difference. First operand has 99 places, 90 transitions, 856 flow. Second operand 7 states and 89 transitions. [2024-06-14 15:44:10,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 103 transitions, 1140 flow [2024-06-14 15:44:10,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 103 transitions, 1085 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 15:44:10,652 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 900 flow [2024-06-14 15:44:10,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=900, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2024-06-14 15:44:10,652 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2024-06-14 15:44:10,653 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 900 flow [2024-06-14 15:44:10,653 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:44:10,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:10,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:10,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:44:10,653 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:44:10,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash -921816987, now seen corresponding path program 5 times [2024-06-14 15:44:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:10,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562212783] [2024-06-14 15:44:10,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:10,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:17,255 INFO L134 CoverageAnalysis]: 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:17,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:17,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562212783] [2024-06-14 15:44:17,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562212783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:17,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:17,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:44:17,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397031483] [2024-06-14 15:44:17,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:17,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:44:17,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:17,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:44:17,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:44:17,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:44:17,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 900 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:44:17,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:17,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:44:17,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:17,605 INFO L124 PetriNetUnfolderBase]: 296/527 cut-off events. [2024-06-14 15:44:17,605 INFO L125 PetriNetUnfolderBase]: For 6282/6282 co-relation queries the response was YES. [2024-06-14 15:44:17,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2950 conditions, 527 events. 296/527 cut-off events. For 6282/6282 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2095 event pairs, 104 based on Foata normal form. 1/528 useless extension candidates. Maximal degree in co-relation 2898. Up to 485 conditions per place. [2024-06-14 15:44:17,610 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 82 selfloop transitions, 17 changer transitions 0/101 dead transitions. [2024-06-14 15:44:17,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 101 transitions, 1143 flow [2024-06-14 15:44:17,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-14 15:44:17,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-14 15:44:17,612 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 900 flow. Second operand 8 states and 90 transitions. [2024-06-14 15:44:17,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 101 transitions, 1143 flow [2024-06-14 15:44:17,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 101 transitions, 1082 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:44:17,626 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 906 flow [2024-06-14 15:44:17,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=906, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2024-06-14 15:44:17,626 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2024-06-14 15:44:17,626 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 906 flow [2024-06-14 15:44:17,627 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:44:17,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:17,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:17,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:44:17,628 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:44:17,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:17,628 INFO L85 PathProgramCache]: Analyzing trace with hash -918092182, now seen corresponding path program 3 times [2024-06-14 15:44:17,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:17,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309238510] [2024-06-14 15:44:17,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:17,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:21,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:44:21,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:21,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309238510] [2024-06-14 15:44:21,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309238510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:21,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:21,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:21,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226111909] [2024-06-14 15:44:21,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:21,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:21,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:21,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:21,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:21,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:44:21,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 906 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:44:21,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:21,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:44:21,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:22,286 INFO L124 PetriNetUnfolderBase]: 305/542 cut-off events. [2024-06-14 15:44:22,286 INFO L125 PetriNetUnfolderBase]: For 5974/5974 co-relation queries the response was YES. [2024-06-14 15:44:22,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2960 conditions, 542 events. 305/542 cut-off events. For 5974/5974 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2187 event pairs, 101 based on Foata normal form. 3/545 useless extension candidates. Maximal degree in co-relation 2908. Up to 425 conditions per place. [2024-06-14 15:44:22,291 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 83 selfloop transitions, 26 changer transitions 0/111 dead transitions. [2024-06-14 15:44:22,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 111 transitions, 1234 flow [2024-06-14 15:44:22,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:44:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:44:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-14 15:44:22,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-14 15:44:22,292 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 906 flow. Second operand 9 states and 109 transitions. [2024-06-14 15:44:22,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 111 transitions, 1234 flow [2024-06-14 15:44:22,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 111 transitions, 1153 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 15:44:22,303 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 912 flow [2024-06-14 15:44:22,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=912, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2024-06-14 15:44:22,304 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2024-06-14 15:44:22,304 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 912 flow [2024-06-14 15:44:22,304 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:44:22,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:22,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:22,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:44:22,305 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:44:22,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:22,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1687205114, now seen corresponding path program 4 times [2024-06-14 15:44:22,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:22,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470042065] [2024-06-14 15:44:22,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:22,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:26,639 INFO L134 CoverageAnalysis]: 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:26,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:26,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470042065] [2024-06-14 15:44:26,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470042065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:26,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:26,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:44:26,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078334460] [2024-06-14 15:44:26,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:26,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:44:26,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:26,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:44:26,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:44:26,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:44:26,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 912 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:44:26,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:26,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:44:26,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:27,063 INFO L124 PetriNetUnfolderBase]: 314/559 cut-off events. [2024-06-14 15:44:27,063 INFO L125 PetriNetUnfolderBase]: For 6554/6554 co-relation queries the response was YES. [2024-06-14 15:44:27,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3033 conditions, 559 events. 314/559 cut-off events. For 6554/6554 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2291 event pairs, 73 based on Foata normal form. 3/562 useless extension candidates. Maximal degree in co-relation 2982. Up to 365 conditions per place. [2024-06-14 15:44:27,069 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 70 selfloop transitions, 47 changer transitions 0/119 dead transitions. [2024-06-14 15:44:27,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 119 transitions, 1287 flow [2024-06-14 15:44:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:44:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:44:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-14 15:44:27,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-14 15:44:27,071 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 912 flow. Second operand 7 states and 98 transitions. [2024-06-14 15:44:27,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 119 transitions, 1287 flow [2024-06-14 15:44:27,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 119 transitions, 1196 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 15:44:27,091 INFO L231 Difference]: Finished difference. Result has 102 places, 99 transitions, 959 flow [2024-06-14 15:44:27,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=959, PETRI_PLACES=102, PETRI_TRANSITIONS=99} [2024-06-14 15:44:27,092 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2024-06-14 15:44:27,092 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 99 transitions, 959 flow [2024-06-14 15:44:27,092 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:44:27,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:27,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:27,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:44:27,093 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:44:27,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:27,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1953762734, now seen corresponding path program 5 times [2024-06-14 15:44:27,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:27,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134237177] [2024-06-14 15:44:27,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:27,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:31,298 INFO L134 CoverageAnalysis]: 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:31,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:31,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134237177] [2024-06-14 15:44:31,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134237177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:31,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:31,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:31,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135190909] [2024-06-14 15:44:31,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:31,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:31,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:31,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:31,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:44:31,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 99 transitions, 959 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:44:31,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:31,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:44:31,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:31,670 INFO L124 PetriNetUnfolderBase]: 323/573 cut-off events. [2024-06-14 15:44:31,670 INFO L125 PetriNetUnfolderBase]: For 7174/7174 co-relation queries the response was YES. [2024-06-14 15:44:31,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3171 conditions, 573 events. 323/573 cut-off events. For 7174/7174 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2347 event pairs, 107 based on Foata normal form. 3/576 useless extension candidates. Maximal degree in co-relation 3120. Up to 532 conditions per place. [2024-06-14 15:44:31,675 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 96 selfloop transitions, 15 changer transitions 0/113 dead transitions. [2024-06-14 15:44:31,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 113 transitions, 1246 flow [2024-06-14 15:44:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:44:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:44:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 15:44:31,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-14 15:44:31,681 INFO L175 Difference]: Start difference. First operand has 102 places, 99 transitions, 959 flow. Second operand 9 states and 98 transitions. [2024-06-14 15:44:31,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 113 transitions, 1246 flow [2024-06-14 15:44:31,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 113 transitions, 1167 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 15:44:31,696 INFO L231 Difference]: Finished difference. Result has 106 places, 102 transitions, 957 flow [2024-06-14 15:44:31,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=957, PETRI_PLACES=106, PETRI_TRANSITIONS=102} [2024-06-14 15:44:31,696 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2024-06-14 15:44:31,696 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 102 transitions, 957 flow [2024-06-14 15:44:31,697 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:44:31,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:31,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:31,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:44:31,697 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:44:31,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:31,698 INFO L85 PathProgramCache]: Analyzing trace with hash 278017642, now seen corresponding path program 6 times [2024-06-14 15:44:31,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:31,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029949484] [2024-06-14 15:44:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:31,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:36,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:36,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029949484] [2024-06-14 15:44:36,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029949484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:36,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:36,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:36,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041579772] [2024-06-14 15:44:36,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:36,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:36,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:36,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:36,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:36,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:44:36,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 102 transitions, 957 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:44:36,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:36,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:44:36,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:36,526 INFO L124 PetriNetUnfolderBase]: 317/563 cut-off events. [2024-06-14 15:44:36,526 INFO L125 PetriNetUnfolderBase]: For 6482/6482 co-relation queries the response was YES. [2024-06-14 15:44:36,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 563 events. 317/563 cut-off events. For 6482/6482 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2301 event pairs, 101 based on Foata normal form. 3/566 useless extension candidates. Maximal degree in co-relation 2943. Up to 511 conditions per place. [2024-06-14 15:44:36,532 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 95 selfloop transitions, 18 changer transitions 0/115 dead transitions. [2024-06-14 15:44:36,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 115 transitions, 1220 flow [2024-06-14 15:44:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:44:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:44:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-14 15:44:36,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-14 15:44:36,536 INFO L175 Difference]: Start difference. First operand has 106 places, 102 transitions, 957 flow. Second operand 9 states and 102 transitions. [2024-06-14 15:44:36,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 115 transitions, 1220 flow [2024-06-14 15:44:36,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 115 transitions, 1178 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:44:36,551 INFO L231 Difference]: Finished difference. Result has 108 places, 102 transitions, 957 flow [2024-06-14 15:44:36,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=957, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2024-06-14 15:44:36,552 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2024-06-14 15:44:36,552 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 957 flow [2024-06-14 15:44:36,552 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:44:36,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:36,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:36,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:44:36,553 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:44:36,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:36,553 INFO L85 PathProgramCache]: Analyzing trace with hash 278227109, now seen corresponding path program 1 times [2024-06-14 15:44:36,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:36,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530730141] [2024-06-14 15:44:36,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:36,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:40,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:44:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:40,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530730141] [2024-06-14 15:44:40,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530730141] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:40,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:40,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:40,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85290148] [2024-06-14 15:44:40,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:40,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:40,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:40,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:40,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:44:40,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 957 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:44:40,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:40,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:44:40,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:41,088 INFO L124 PetriNetUnfolderBase]: 313/557 cut-off events. [2024-06-14 15:44:41,088 INFO L125 PetriNetUnfolderBase]: For 6480/6480 co-relation queries the response was YES. [2024-06-14 15:44:41,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 557 events. 313/557 cut-off events. For 6480/6480 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2266 event pairs, 101 based on Foata normal form. 2/559 useless extension candidates. Maximal degree in co-relation 2912. Up to 525 conditions per place. [2024-06-14 15:44:41,092 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 98 selfloop transitions, 13 changer transitions 0/113 dead transitions. [2024-06-14 15:44:41,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 1217 flow [2024-06-14 15:44:41,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:41,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-14 15:44:41,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355 [2024-06-14 15:44:41,095 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 957 flow. Second operand 8 states and 89 transitions. [2024-06-14 15:44:41,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 1217 flow [2024-06-14 15:44:41,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 113 transitions, 1146 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:44:41,109 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 939 flow [2024-06-14 15:44:41,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=939, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2024-06-14 15:44:41,110 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2024-06-14 15:44:41,110 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 939 flow [2024-06-14 15:44:41,110 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:44:41,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:41,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:41,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:44:41,111 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:44:41,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:41,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1480269047, now seen corresponding path program 1 times [2024-06-14 15:44:41,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:41,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431752586] [2024-06-14 15:44:41,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:41,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:47,170 INFO L134 CoverageAnalysis]: 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:47,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:47,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431752586] [2024-06-14 15:44:47,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431752586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:47,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:47,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:44:47,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926793992] [2024-06-14 15:44:47,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:47,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:44:47,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:47,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:44:47,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:44:47,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:44:47,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 939 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:44:47,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:47,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:44:47,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:47,703 INFO L124 PetriNetUnfolderBase]: 310/552 cut-off events. [2024-06-14 15:44:47,704 INFO L125 PetriNetUnfolderBase]: For 6401/6401 co-relation queries the response was YES. [2024-06-14 15:44:47,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2895 conditions, 552 events. 310/552 cut-off events. For 6401/6401 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2228 event pairs, 100 based on Foata normal form. 2/554 useless extension candidates. Maximal degree in co-relation 2842. Up to 522 conditions per place. [2024-06-14 15:44:47,709 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 99 selfloop transitions, 12 changer transitions 0/113 dead transitions. [2024-06-14 15:44:47,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 1181 flow [2024-06-14 15:44:47,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-14 15:44:47,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-14 15:44:47,710 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 939 flow. Second operand 8 states and 87 transitions. [2024-06-14 15:44:47,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 1181 flow [2024-06-14 15:44:47,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 113 transitions, 1141 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:44:47,722 INFO L231 Difference]: Finished difference. Result has 110 places, 104 transitions, 927 flow [2024-06-14 15:44:47,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=927, PETRI_PLACES=110, PETRI_TRANSITIONS=104} [2024-06-14 15:44:47,723 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places. [2024-06-14 15:44:47,723 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 104 transitions, 927 flow [2024-06-14 15:44:47,723 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:44:47,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:47,724 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:44:47,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:44:47,724 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:44:47,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1410209669, now seen corresponding path program 1 times [2024-06-14 15:44:47,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:47,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948574220] [2024-06-14 15:44:47,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:47,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:54,419 INFO L134 CoverageAnalysis]: 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:54,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:54,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948574220] [2024-06-14 15:44:54,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948574220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:54,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:54,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:54,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645321676] [2024-06-14 15:44:54,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:54,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:54,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:54,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:54,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:54,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:44:54,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 104 transitions, 927 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:44:54,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:54,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:44:54,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:54,844 INFO L124 PetriNetUnfolderBase]: 330/594 cut-off events. [2024-06-14 15:44:54,844 INFO L125 PetriNetUnfolderBase]: For 7568/7568 co-relation queries the response was YES. [2024-06-14 15:44:54,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3075 conditions, 594 events. 330/594 cut-off events. For 7568/7568 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2542 event pairs, 64 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 3021. Up to 473 conditions per place. [2024-06-14 15:44:54,848 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 94 selfloop transitions, 28 changer transitions 0/124 dead transitions. [2024-06-14 15:44:54,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 124 transitions, 1285 flow [2024-06-14 15:44:54,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:44:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:44:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-14 15:44:54,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-14 15:44:54,849 INFO L175 Difference]: Start difference. First operand has 110 places, 104 transitions, 927 flow. Second operand 9 states and 110 transitions. [2024-06-14 15:44:54,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 124 transitions, 1285 flow [2024-06-14 15:44:54,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 124 transitions, 1252 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 15:44:54,863 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 994 flow [2024-06-14 15:44:54,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=994, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2024-06-14 15:44:54,863 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places. [2024-06-14 15:44:54,864 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 994 flow [2024-06-14 15:44:54,864 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:44:54,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:54,864 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:44:54,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:44:54,864 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:44:54,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:54,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1038420903, now seen corresponding path program 1 times [2024-06-14 15:44:54,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:54,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613234759] [2024-06-14 15:44:54,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:54,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:01,145 INFO L134 CoverageAnalysis]: 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:01,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:01,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613234759] [2024-06-14 15:45:01,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613234759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:01,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:01,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:01,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195184608] [2024-06-14 15:45:01,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:01,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:01,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:01,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:01,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:01,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:45:01,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 994 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:45:01,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:01,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:45:01,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:01,572 INFO L124 PetriNetUnfolderBase]: 348/623 cut-off events. [2024-06-14 15:45:01,572 INFO L125 PetriNetUnfolderBase]: For 8831/8831 co-relation queries the response was YES. [2024-06-14 15:45:01,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3334 conditions, 623 events. 348/623 cut-off events. For 8831/8831 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2696 event pairs, 69 based on Foata normal form. 1/624 useless extension candidates. Maximal degree in co-relation 3279. Up to 436 conditions per place. [2024-06-14 15:45:01,577 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 94 selfloop transitions, 36 changer transitions 0/132 dead transitions. [2024-06-14 15:45:01,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 132 transitions, 1394 flow [2024-06-14 15:45:01,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 15:45:01,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157706093189964 [2024-06-14 15:45:01,578 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 994 flow. Second operand 9 states and 116 transitions. [2024-06-14 15:45:01,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 132 transitions, 1394 flow [2024-06-14 15:45:01,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 132 transitions, 1350 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 15:45:01,592 INFO L231 Difference]: Finished difference. Result has 118 places, 113 transitions, 1079 flow [2024-06-14 15:45:01,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1079, PETRI_PLACES=118, PETRI_TRANSITIONS=113} [2024-06-14 15:45:01,593 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2024-06-14 15:45:01,593 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 113 transitions, 1079 flow [2024-06-14 15:45:01,593 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:45:01,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:01,593 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:45:01,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:45:01,594 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:45:01,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1038420779, now seen corresponding path program 2 times [2024-06-14 15:45:01,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:01,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119884466] [2024-06-14 15:45:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:08,206 INFO L134 CoverageAnalysis]: 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:08,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:08,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119884466] [2024-06-14 15:45:08,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119884466] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:08,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:08,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:08,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089393917] [2024-06-14 15:45:08,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:08,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:08,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:08,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:08,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:08,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:45:08,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 113 transitions, 1079 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:45:08,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:08,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:45:08,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:08,728 INFO L124 PetriNetUnfolderBase]: 352/631 cut-off events. [2024-06-14 15:45:08,728 INFO L125 PetriNetUnfolderBase]: For 10087/10087 co-relation queries the response was YES. [2024-06-14 15:45:08,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3555 conditions, 631 events. 352/631 cut-off events. For 10087/10087 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2750 event pairs, 71 based on Foata normal form. 2/633 useless extension candidates. Maximal degree in co-relation 3497. Up to 539 conditions per place. [2024-06-14 15:45:08,731 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 99 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2024-06-14 15:45:08,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 127 transitions, 1372 flow [2024-06-14 15:45:08,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-14 15:45:08,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-14 15:45:08,733 INFO L175 Difference]: Start difference. First operand has 118 places, 113 transitions, 1079 flow. Second operand 9 states and 107 transitions. [2024-06-14 15:45:08,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 127 transitions, 1372 flow [2024-06-14 15:45:08,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 127 transitions, 1323 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 15:45:08,748 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 1097 flow [2024-06-14 15:45:08,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1097, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2024-06-14 15:45:08,749 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 92 predicate places. [2024-06-14 15:45:08,749 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 1097 flow [2024-06-14 15:45:08,749 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:45:08,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:08,750 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:45:08,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:45:08,750 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:45:08,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:08,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1413907473, now seen corresponding path program 2 times [2024-06-14 15:45:08,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:08,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865754377] [2024-06-14 15:45:08,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:08,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:15,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:15,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865754377] [2024-06-14 15:45:15,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865754377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:15,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:15,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:15,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691896758] [2024-06-14 15:45:15,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:15,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:15,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:15,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:15,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:45:15,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 1097 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:45:15,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:15,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:45:15,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:15,571 INFO L124 PetriNetUnfolderBase]: 361/646 cut-off events. [2024-06-14 15:45:15,571 INFO L125 PetriNetUnfolderBase]: For 11119/11119 co-relation queries the response was YES. [2024-06-14 15:45:15,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3696 conditions, 646 events. 361/646 cut-off events. For 11119/11119 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2862 event pairs, 58 based on Foata normal form. 3/649 useless extension candidates. Maximal degree in co-relation 3636. Up to 499 conditions per place. [2024-06-14 15:45:15,576 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 99 selfloop transitions, 35 changer transitions 0/136 dead transitions. [2024-06-14 15:45:15,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 136 transitions, 1460 flow [2024-06-14 15:45:15,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 15:45:15,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157706093189964 [2024-06-14 15:45:15,577 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 1097 flow. Second operand 9 states and 116 transitions. [2024-06-14 15:45:15,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 136 transitions, 1460 flow [2024-06-14 15:45:15,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 136 transitions, 1406 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 15:45:15,594 INFO L231 Difference]: Finished difference. Result has 124 places, 117 transitions, 1148 flow [2024-06-14 15:45:15,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1148, PETRI_PLACES=124, PETRI_TRANSITIONS=117} [2024-06-14 15:45:15,595 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 94 predicate places. [2024-06-14 15:45:15,595 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 117 transitions, 1148 flow [2024-06-14 15:45:15,596 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:45:15,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:15,596 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:45:15,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:45:15,596 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:45:15,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:15,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1401390603, now seen corresponding path program 3 times [2024-06-14 15:45:15,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:15,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480883306] [2024-06-14 15:45:15,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:15,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:20,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480883306] [2024-06-14 15:45:20,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480883306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:20,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:20,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:20,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065714284] [2024-06-14 15:45:20,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:20,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:20,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:20,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:20,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:45:20,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 117 transitions, 1148 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:45:20,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:20,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:45:20,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:20,686 INFO L124 PetriNetUnfolderBase]: 364/651 cut-off events. [2024-06-14 15:45:20,687 INFO L125 PetriNetUnfolderBase]: For 11389/11389 co-relation queries the response was YES. [2024-06-14 15:45:20,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3817 conditions, 651 events. 364/651 cut-off events. For 11389/11389 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2856 event pairs, 70 based on Foata normal form. 1/652 useless extension candidates. Maximal degree in co-relation 3756. Up to 438 conditions per place. [2024-06-14 15:45:20,693 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 85 selfloop transitions, 49 changer transitions 0/136 dead transitions. [2024-06-14 15:45:20,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 136 transitions, 1490 flow [2024-06-14 15:45:20,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 15:45:20,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265232974910394 [2024-06-14 15:45:20,697 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 1148 flow. Second operand 9 states and 119 transitions. [2024-06-14 15:45:20,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 136 transitions, 1490 flow [2024-06-14 15:45:20,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 136 transitions, 1416 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:45:20,716 INFO L231 Difference]: Finished difference. Result has 126 places, 119 transitions, 1199 flow [2024-06-14 15:45:20,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1199, PETRI_PLACES=126, PETRI_TRANSITIONS=119} [2024-06-14 15:45:20,716 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 96 predicate places. [2024-06-14 15:45:20,716 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 119 transitions, 1199 flow [2024-06-14 15:45:20,716 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:45:20,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:20,717 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:45:20,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:45:20,717 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:45:20,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:20,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1041217289, now seen corresponding path program 3 times [2024-06-14 15:45:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:20,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935085765] [2024-06-14 15:45:20,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:20,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:27,150 INFO L134 CoverageAnalysis]: 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,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:27,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935085765] [2024-06-14 15:45:27,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935085765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:27,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:27,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:27,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250178424] [2024-06-14 15:45:27,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:27,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:27,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:27,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:27,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:27,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:45:27,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 119 transitions, 1199 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:45:27,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:27,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:45:27,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:27,629 INFO L124 PetriNetUnfolderBase]: 361/646 cut-off events. [2024-06-14 15:45:27,629 INFO L125 PetriNetUnfolderBase]: For 11826/11826 co-relation queries the response was YES. [2024-06-14 15:45:27,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3802 conditions, 646 events. 361/646 cut-off events. For 11826/11826 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2826 event pairs, 70 based on Foata normal form. 2/648 useless extension candidates. Maximal degree in co-relation 3740. Up to 568 conditions per place. [2024-06-14 15:45:27,634 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 104 selfloop transitions, 25 changer transitions 0/131 dead transitions. [2024-06-14 15:45:27,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 131 transitions, 1487 flow [2024-06-14 15:45:27,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 15:45:27,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-14 15:45:27,641 INFO L175 Difference]: Start difference. First operand has 126 places, 119 transitions, 1199 flow. Second operand 9 states and 106 transitions. [2024-06-14 15:45:27,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 131 transitions, 1487 flow [2024-06-14 15:45:27,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 131 transitions, 1382 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:45:27,668 INFO L231 Difference]: Finished difference. Result has 128 places, 119 transitions, 1148 flow [2024-06-14 15:45:27,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1148, PETRI_PLACES=128, PETRI_TRANSITIONS=119} [2024-06-14 15:45:27,670 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 98 predicate places. [2024-06-14 15:45:27,670 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 119 transitions, 1148 flow [2024-06-14 15:45:27,670 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:45:27,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:27,671 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:45:27,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:45:27,671 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:45:27,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash -952215625, now seen corresponding path program 4 times [2024-06-14 15:45:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:27,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766269447] [2024-06-14 15:45:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:27,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:33,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:33,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766269447] [2024-06-14 15:45:33,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766269447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:33,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:33,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:33,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395141675] [2024-06-14 15:45:33,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:33,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:33,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:33,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:33,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:33,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:45:33,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 119 transitions, 1148 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:45:33,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:33,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:45:33,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:33,976 INFO L124 PetriNetUnfolderBase]: 370/665 cut-off events. [2024-06-14 15:45:33,977 INFO L125 PetriNetUnfolderBase]: For 12364/12364 co-relation queries the response was YES. [2024-06-14 15:45:33,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3817 conditions, 665 events. 370/665 cut-off events. For 12364/12364 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2955 event pairs, 51 based on Foata normal form. 2/667 useless extension candidates. Maximal degree in co-relation 3754. Up to 461 conditions per place. [2024-06-14 15:45:33,981 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 95 selfloop transitions, 41 changer transitions 0/138 dead transitions. [2024-06-14 15:45:33,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 138 transitions, 1536 flow [2024-06-14 15:45:33,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-14 15:45:33,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-14 15:45:33,983 INFO L175 Difference]: Start difference. First operand has 128 places, 119 transitions, 1148 flow. Second operand 9 states and 107 transitions. [2024-06-14 15:45:33,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 138 transitions, 1536 flow [2024-06-14 15:45:34,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 138 transitions, 1484 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 15:45:34,003 INFO L231 Difference]: Finished difference. Result has 131 places, 121 transitions, 1204 flow [2024-06-14 15:45:34,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1204, PETRI_PLACES=131, PETRI_TRANSITIONS=121} [2024-06-14 15:45:34,004 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 101 predicate places. [2024-06-14 15:45:34,004 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 121 transitions, 1204 flow [2024-06-14 15:45:34,004 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:45:34,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:34,004 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:45:34,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:45:34,004 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:45:34,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:34,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1035938771, now seen corresponding path program 5 times [2024-06-14 15:45:34,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:34,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252416915] [2024-06-14 15:45:34,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:34,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:40,712 INFO L134 CoverageAnalysis]: 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:40,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:40,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252416915] [2024-06-14 15:45:40,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252416915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:40,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:40,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:40,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630376188] [2024-06-14 15:45:40,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:40,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:40,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:40,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:40,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:40,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:45:40,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 121 transitions, 1204 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:45:40,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:40,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:45:40,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:41,162 INFO L124 PetriNetUnfolderBase]: 386/697 cut-off events. [2024-06-14 15:45:41,162 INFO L125 PetriNetUnfolderBase]: For 14270/14270 co-relation queries the response was YES. [2024-06-14 15:45:41,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4106 conditions, 697 events. 386/697 cut-off events. For 14270/14270 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3184 event pairs, 74 based on Foata normal form. 2/699 useless extension candidates. Maximal degree in co-relation 4041. Up to 561 conditions per place. [2024-06-14 15:45:41,167 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 103 selfloop transitions, 36 changer transitions 0/141 dead transitions. [2024-06-14 15:45:41,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 141 transitions, 1620 flow [2024-06-14 15:45:41,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 15:45:41,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-14 15:45:41,182 INFO L175 Difference]: Start difference. First operand has 131 places, 121 transitions, 1204 flow. Second operand 9 states and 111 transitions. [2024-06-14 15:45:41,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 141 transitions, 1620 flow [2024-06-14 15:45:41,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 141 transitions, 1503 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 15:45:41,217 INFO L231 Difference]: Finished difference. Result has 134 places, 124 transitions, 1207 flow [2024-06-14 15:45:41,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1207, PETRI_PLACES=134, PETRI_TRANSITIONS=124} [2024-06-14 15:45:41,217 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 104 predicate places. [2024-06-14 15:45:41,218 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 124 transitions, 1207 flow [2024-06-14 15:45:41,218 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:45:41,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:41,219 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:45:41,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:45:41,219 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:41,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:41,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2088271203, now seen corresponding path program 4 times [2024-06-14 15:45:41,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:41,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653428175] [2024-06-14 15:45:41,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:41,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:47,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:47,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653428175] [2024-06-14 15:45:47,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653428175] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:47,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:47,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:47,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890677558] [2024-06-14 15:45:47,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:47,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:47,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:47,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:47,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:47,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:45:47,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 124 transitions, 1207 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:45:47,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:47,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:45:47,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:48,170 INFO L124 PetriNetUnfolderBase]: 389/702 cut-off events. [2024-06-14 15:45:48,171 INFO L125 PetriNetUnfolderBase]: For 14526/14526 co-relation queries the response was YES. [2024-06-14 15:45:48,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4084 conditions, 702 events. 389/702 cut-off events. For 14526/14526 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3227 event pairs, 64 based on Foata normal form. 1/703 useless extension candidates. Maximal degree in co-relation 4019. Up to 516 conditions per place. [2024-06-14 15:45:48,177 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 104 selfloop transitions, 46 changer transitions 0/152 dead transitions. [2024-06-14 15:45:48,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 152 transitions, 1728 flow [2024-06-14 15:45:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:48,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 15:45:48,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-14 15:45:48,179 INFO L175 Difference]: Start difference. First operand has 134 places, 124 transitions, 1207 flow. Second operand 9 states and 111 transitions. [2024-06-14 15:45:48,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 152 transitions, 1728 flow [2024-06-14 15:45:48,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 152 transitions, 1657 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:45:48,211 INFO L231 Difference]: Finished difference. Result has 139 places, 134 transitions, 1395 flow [2024-06-14 15:45:48,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1395, PETRI_PLACES=139, PETRI_TRANSITIONS=134} [2024-06-14 15:45:48,211 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2024-06-14 15:45:48,212 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 134 transitions, 1395 flow [2024-06-14 15:45:48,212 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:45:48,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:48,212 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:45:48,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:45:48,212 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:45:48,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1047617711, now seen corresponding path program 6 times [2024-06-14 15:45:48,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:48,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456022297] [2024-06-14 15:45:48,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:48,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:54,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:54,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456022297] [2024-06-14 15:45:54,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456022297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:54,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:54,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:45:54,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490526833] [2024-06-14 15:45:54,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:54,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:45:54,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:54,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:45:54,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:45:54,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:45:54,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 134 transitions, 1395 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:45:54,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:54,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:45:54,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:55,155 INFO L124 PetriNetUnfolderBase]: 386/697 cut-off events. [2024-06-14 15:45:55,155 INFO L125 PetriNetUnfolderBase]: For 15264/15264 co-relation queries the response was YES. [2024-06-14 15:45:55,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4211 conditions, 697 events. 386/697 cut-off events. For 15264/15264 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3176 event pairs, 77 based on Foata normal form. 2/699 useless extension candidates. Maximal degree in co-relation 4143. Up to 582 conditions per place. [2024-06-14 15:45:55,161 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 111 selfloop transitions, 35 changer transitions 0/148 dead transitions. [2024-06-14 15:45:55,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 148 transitions, 1723 flow [2024-06-14 15:45:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-14 15:45:55,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-14 15:45:55,163 INFO L175 Difference]: Start difference. First operand has 139 places, 134 transitions, 1395 flow. Second operand 9 states and 107 transitions. [2024-06-14 15:45:55,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 148 transitions, 1723 flow [2024-06-14 15:45:55,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 148 transitions, 1673 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-14 15:45:55,200 INFO L231 Difference]: Finished difference. Result has 143 places, 134 transitions, 1419 flow [2024-06-14 15:45:55,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1419, PETRI_PLACES=143, PETRI_TRANSITIONS=134} [2024-06-14 15:45:55,201 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 113 predicate places. [2024-06-14 15:45:55,201 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 134 transitions, 1419 flow [2024-06-14 15:45:55,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:45:55,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:55,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:45:55,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:45:55,202 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:45:55,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:55,202 INFO L85 PathProgramCache]: Analyzing trace with hash 176267719, now seen corresponding path program 5 times [2024-06-14 15:45:55,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:55,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442068833] [2024-06-14 15:45:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:01,341 INFO L134 CoverageAnalysis]: 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:01,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:01,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442068833] [2024-06-14 15:46:01,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442068833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:01,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:01,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:01,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169395752] [2024-06-14 15:46:01,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:01,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:01,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:01,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:01,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:01,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:46:01,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 134 transitions, 1419 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:46:01,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:01,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:46:01,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:01,931 INFO L124 PetriNetUnfolderBase]: 393/709 cut-off events. [2024-06-14 15:46:01,931 INFO L125 PetriNetUnfolderBase]: For 15652/15652 co-relation queries the response was YES. [2024-06-14 15:46:01,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4359 conditions, 709 events. 393/709 cut-off events. For 15652/15652 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3286 event pairs, 67 based on Foata normal form. 1/710 useless extension candidates. Maximal degree in co-relation 4290. Up to 541 conditions per place. [2024-06-14 15:46:01,938 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 115 selfloop transitions, 42 changer transitions 0/159 dead transitions. [2024-06-14 15:46:01,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 159 transitions, 1928 flow [2024-06-14 15:46:01,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-14 15:46:01,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4336917562724014 [2024-06-14 15:46:01,940 INFO L175 Difference]: Start difference. First operand has 143 places, 134 transitions, 1419 flow. Second operand 9 states and 121 transitions. [2024-06-14 15:46:01,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 159 transitions, 1928 flow [2024-06-14 15:46:01,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 159 transitions, 1856 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:01,971 INFO L231 Difference]: Finished difference. Result has 146 places, 138 transitions, 1514 flow [2024-06-14 15:46:01,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1349, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1514, PETRI_PLACES=146, PETRI_TRANSITIONS=138} [2024-06-14 15:46:01,972 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 116 predicate places. [2024-06-14 15:46:01,972 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 138 transitions, 1514 flow [2024-06-14 15:46:01,972 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:46:01,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:01,973 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:46:01,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:46:01,973 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:46:01,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:01,973 INFO L85 PathProgramCache]: Analyzing trace with hash 176445349, now seen corresponding path program 6 times [2024-06-14 15:46:01,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:01,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313470940] [2024-06-14 15:46:01,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:01,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:08,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313470940] [2024-06-14 15:46:08,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313470940] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:08,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:08,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:08,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089372729] [2024-06-14 15:46:08,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:08,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:08,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:08,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:08,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:08,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:46:08,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 138 transitions, 1514 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:46:08,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:08,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:46:08,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:09,227 INFO L124 PetriNetUnfolderBase]: 402/725 cut-off events. [2024-06-14 15:46:09,227 INFO L125 PetriNetUnfolderBase]: For 18051/18051 co-relation queries the response was YES. [2024-06-14 15:46:09,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4569 conditions, 725 events. 402/725 cut-off events. For 18051/18051 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3363 event pairs, 66 based on Foata normal form. 3/728 useless extension candidates. Maximal degree in co-relation 4498. Up to 577 conditions per place. [2024-06-14 15:46:09,233 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 122 selfloop transitions, 39 changer transitions 0/163 dead transitions. [2024-06-14 15:46:09,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 163 transitions, 1972 flow [2024-06-14 15:46:09,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:46:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:46:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:46:09,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096774193548387 [2024-06-14 15:46:09,237 INFO L175 Difference]: Start difference. First operand has 146 places, 138 transitions, 1514 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:46:09,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 163 transitions, 1972 flow [2024-06-14 15:46:09,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 163 transitions, 1857 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:09,286 INFO L231 Difference]: Finished difference. Result has 149 places, 142 transitions, 1559 flow [2024-06-14 15:46:09,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1559, PETRI_PLACES=149, PETRI_TRANSITIONS=142} [2024-06-14 15:46:09,287 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 119 predicate places. [2024-06-14 15:46:09,287 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 142 transitions, 1559 flow [2024-06-14 15:46:09,287 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:46:09,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:09,288 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:46:09,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:46:09,288 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:46:09,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:09,288 INFO L85 PathProgramCache]: Analyzing trace with hash 184315939, now seen corresponding path program 7 times [2024-06-14 15:46:09,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:09,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942281287] [2024-06-14 15:46:09,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:09,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:15,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:15,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942281287] [2024-06-14 15:46:15,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942281287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:15,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:15,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:15,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408971420] [2024-06-14 15:46:15,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:15,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:15,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:15,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:15,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:15,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:46:15,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 142 transitions, 1559 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:46:15,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:15,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:46:15,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:16,344 INFO L124 PetriNetUnfolderBase]: 396/715 cut-off events. [2024-06-14 15:46:16,344 INFO L125 PetriNetUnfolderBase]: For 17140/17140 co-relation queries the response was YES. [2024-06-14 15:46:16,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4413 conditions, 715 events. 396/715 cut-off events. For 17140/17140 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3325 event pairs, 67 based on Foata normal form. 3/718 useless extension candidates. Maximal degree in co-relation 4341. Up to 568 conditions per place. [2024-06-14 15:46:16,350 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 123 selfloop transitions, 38 changer transitions 0/163 dead transitions. [2024-06-14 15:46:16,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 163 transitions, 1953 flow [2024-06-14 15:46:16,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 15:46:16,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265232974910394 [2024-06-14 15:46:16,351 INFO L175 Difference]: Start difference. First operand has 149 places, 142 transitions, 1559 flow. Second operand 9 states and 119 transitions. [2024-06-14 15:46:16,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 163 transitions, 1953 flow [2024-06-14 15:46:16,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 163 transitions, 1837 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-14 15:46:16,384 INFO L231 Difference]: Finished difference. Result has 150 places, 142 transitions, 1527 flow [2024-06-14 15:46:16,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1527, PETRI_PLACES=150, PETRI_TRANSITIONS=142} [2024-06-14 15:46:16,385 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 120 predicate places. [2024-06-14 15:46:16,385 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 142 transitions, 1527 flow [2024-06-14 15:46:16,385 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:46:16,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:16,386 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:46:16,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:46:16,386 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:46:16,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:16,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1485588375, now seen corresponding path program 7 times [2024-06-14 15:46:16,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:16,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008538745] [2024-06-14 15:46:16,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:16,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:21,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:21,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008538745] [2024-06-14 15:46:21,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008538745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:21,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:21,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:21,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860034987] [2024-06-14 15:46:21,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:21,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:21,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:21,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:21,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:21,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:46:21,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 142 transitions, 1527 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:46:21,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:21,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:46:21,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:21,848 INFO L124 PetriNetUnfolderBase]: 400/723 cut-off events. [2024-06-14 15:46:21,848 INFO L125 PetriNetUnfolderBase]: For 17425/17425 co-relation queries the response was YES. [2024-06-14 15:46:21,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4426 conditions, 723 events. 400/723 cut-off events. For 17425/17425 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3337 event pairs, 51 based on Foata normal form. 2/725 useless extension candidates. Maximal degree in co-relation 4353. Up to 489 conditions per place. [2024-06-14 15:46:21,854 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 108 selfloop transitions, 47 changer transitions 0/157 dead transitions. [2024-06-14 15:46:21,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 157 transitions, 1952 flow [2024-06-14 15:46:21,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 15:46:21,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-14 15:46:21,857 INFO L175 Difference]: Start difference. First operand has 150 places, 142 transitions, 1527 flow. Second operand 8 states and 97 transitions. [2024-06-14 15:46:21,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 157 transitions, 1952 flow [2024-06-14 15:46:21,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 157 transitions, 1866 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:21,910 INFO L231 Difference]: Finished difference. Result has 151 places, 143 transitions, 1556 flow [2024-06-14 15:46:21,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1556, PETRI_PLACES=151, PETRI_TRANSITIONS=143} [2024-06-14 15:46:21,910 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-14 15:46:21,910 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 143 transitions, 1556 flow [2024-06-14 15:46:21,911 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:46:21,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:21,911 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:46:21,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:46:21,911 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:46:21,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:21,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1485648825, now seen corresponding path program 8 times [2024-06-14 15:46:21,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:21,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682984717] [2024-06-14 15:46:21,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:21,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:26,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:26,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:26,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682984717] [2024-06-14 15:46:26,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682984717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:26,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:26,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195718915] [2024-06-14 15:46:26,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:26,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:26,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:26,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:26,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:26,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:46:26,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 143 transitions, 1556 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:46:26,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:26,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:46:26,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:27,239 INFO L124 PetriNetUnfolderBase]: 404/731 cut-off events. [2024-06-14 15:46:27,240 INFO L125 PetriNetUnfolderBase]: For 18337/18337 co-relation queries the response was YES. [2024-06-14 15:46:27,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4519 conditions, 731 events. 404/731 cut-off events. For 18337/18337 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3395 event pairs, 78 based on Foata normal form. 2/733 useless extension candidates. Maximal degree in co-relation 4445. Up to 600 conditions per place. [2024-06-14 15:46:27,245 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 114 selfloop transitions, 40 changer transitions 0/156 dead transitions. [2024-06-14 15:46:27,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 156 transitions, 1907 flow [2024-06-14 15:46:27,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 15:46:27,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-14 15:46:27,247 INFO L175 Difference]: Start difference. First operand has 151 places, 143 transitions, 1556 flow. Second operand 8 states and 97 transitions. [2024-06-14 15:46:27,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 156 transitions, 1907 flow [2024-06-14 15:46:27,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 156 transitions, 1821 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 15:46:27,285 INFO L231 Difference]: Finished difference. Result has 151 places, 144 transitions, 1573 flow [2024-06-14 15:46:27,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1573, PETRI_PLACES=151, PETRI_TRANSITIONS=144} [2024-06-14 15:46:27,285 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-14 15:46:27,285 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 1573 flow [2024-06-14 15:46:27,286 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:46:27,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:27,286 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:46:27,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:46:27,286 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:46:27,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash -768338773, now seen corresponding path program 8 times [2024-06-14 15:46:27,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269657162] [2024-06-14 15:46:27,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:32,997 INFO L134 CoverageAnalysis]: 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:32,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:32,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269657162] [2024-06-14 15:46:32,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269657162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:32,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:32,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:32,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506578879] [2024-06-14 15:46:32,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:32,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:32,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:32,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:32,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:33,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:46:33,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 1573 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:46:33,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:33,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:46:33,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:33,395 INFO L124 PetriNetUnfolderBase]: 417/752 cut-off events. [2024-06-14 15:46:33,395 INFO L125 PetriNetUnfolderBase]: For 17200/17200 co-relation queries the response was YES. [2024-06-14 15:46:33,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4617 conditions, 752 events. 417/752 cut-off events. For 17200/17200 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3511 event pairs, 82 based on Foata normal form. 1/753 useless extension candidates. Maximal degree in co-relation 4545. Up to 421 conditions per place. [2024-06-14 15:46:33,400 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 79 selfloop transitions, 81 changer transitions 0/162 dead transitions. [2024-06-14 15:46:33,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 162 transitions, 2033 flow [2024-06-14 15:46:33,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:46:33,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42338709677419356 [2024-06-14 15:46:33,401 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 1573 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:46:33,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 162 transitions, 2033 flow [2024-06-14 15:46:33,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 162 transitions, 1943 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 15:46:33,435 INFO L231 Difference]: Finished difference. Result has 152 places, 148 transitions, 1754 flow [2024-06-14 15:46:33,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1754, PETRI_PLACES=152, PETRI_TRANSITIONS=148} [2024-06-14 15:46:33,435 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 122 predicate places. [2024-06-14 15:46:33,436 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 148 transitions, 1754 flow [2024-06-14 15:46:33,436 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:46:33,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:33,436 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:46:33,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:46:33,437 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:46:33,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:33,437 INFO L85 PathProgramCache]: Analyzing trace with hash -768218803, now seen corresponding path program 9 times [2024-06-14 15:46:33,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:33,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818161730] [2024-06-14 15:46:33,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:33,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:38,467 INFO L134 CoverageAnalysis]: 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:38,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:38,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818161730] [2024-06-14 15:46:38,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818161730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:38,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:38,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:38,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854127925] [2024-06-14 15:46:38,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:38,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:38,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:38,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:38,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:38,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:46:38,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 148 transitions, 1754 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:46:38,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:38,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:46:38,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:38,867 INFO L124 PetriNetUnfolderBase]: 434/780 cut-off events. [2024-06-14 15:46:38,868 INFO L125 PetriNetUnfolderBase]: For 18764/18764 co-relation queries the response was YES. [2024-06-14 15:46:38,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 780 events. 434/780 cut-off events. For 18764/18764 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3672 event pairs, 75 based on Foata normal form. 3/783 useless extension candidates. Maximal degree in co-relation 4903. Up to 542 conditions per place. [2024-06-14 15:46:38,873 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 109 selfloop transitions, 62 changer transitions 0/173 dead transitions. [2024-06-14 15:46:38,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 173 transitions, 2290 flow [2024-06-14 15:46:38,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-14 15:46:38,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42338709677419356 [2024-06-14 15:46:38,874 INFO L175 Difference]: Start difference. First operand has 152 places, 148 transitions, 1754 flow. Second operand 8 states and 105 transitions. [2024-06-14 15:46:38,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 173 transitions, 2290 flow [2024-06-14 15:46:38,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 173 transitions, 2168 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:46:38,909 INFO L231 Difference]: Finished difference. Result has 156 places, 157 transitions, 1916 flow [2024-06-14 15:46:38,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1916, PETRI_PLACES=156, PETRI_TRANSITIONS=157} [2024-06-14 15:46:38,910 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-14 15:46:38,910 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 157 transitions, 1916 flow [2024-06-14 15:46:38,910 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:46:38,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:38,910 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:46:38,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:46:38,910 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:46:38,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:38,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1488445335, now seen corresponding path program 9 times [2024-06-14 15:46:38,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:38,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648655353] [2024-06-14 15:46:38,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:38,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:45,416 INFO L134 CoverageAnalysis]: 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,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:45,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648655353] [2024-06-14 15:46:45,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648655353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:45,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:45,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:45,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329339816] [2024-06-14 15:46:45,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:45,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:45,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:45,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:45,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:45,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:46:45,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 157 transitions, 1916 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:46:45,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:45,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:46:45,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:45,791 INFO L124 PetriNetUnfolderBase]: 431/775 cut-off events. [2024-06-14 15:46:45,792 INFO L125 PetriNetUnfolderBase]: For 17430/17430 co-relation queries the response was YES. [2024-06-14 15:46:45,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5109 conditions, 775 events. 431/775 cut-off events. For 17430/17430 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3632 event pairs, 85 based on Foata normal form. 2/777 useless extension candidates. Maximal degree in co-relation 5035. Up to 688 conditions per place. [2024-06-14 15:46:45,797 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 135 selfloop transitions, 30 changer transitions 0/167 dead transitions. [2024-06-14 15:46:45,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 167 transitions, 2270 flow [2024-06-14 15:46:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:45,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-14 15:46:45,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-14 15:46:45,799 INFO L175 Difference]: Start difference. First operand has 156 places, 157 transitions, 1916 flow. Second operand 8 states and 94 transitions. [2024-06-14 15:46:45,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 167 transitions, 2270 flow [2024-06-14 15:46:45,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 167 transitions, 2180 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-14 15:46:45,838 INFO L231 Difference]: Finished difference. Result has 159 places, 157 transitions, 1892 flow [2024-06-14 15:46:45,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1892, PETRI_PLACES=159, PETRI_TRANSITIONS=157} [2024-06-14 15:46:45,838 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2024-06-14 15:46:45,839 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 157 transitions, 1892 flow [2024-06-14 15:46:45,839 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:46:45,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:45,839 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:46:45,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:46:45,839 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:46:45,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:45,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1599267979, now seen corresponding path program 10 times [2024-06-14 15:46:45,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:45,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313137499] [2024-06-14 15:46:45,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:45,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:51,126 INFO L134 CoverageAnalysis]: 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:51,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:51,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313137499] [2024-06-14 15:46:51,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313137499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:51,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:51,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:51,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784201919] [2024-06-14 15:46:51,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:51,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:51,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:51,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:51,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:51,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:46:51,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 157 transitions, 1892 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:46:51,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:51,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:46:51,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:51,579 INFO L124 PetriNetUnfolderBase]: 434/780 cut-off events. [2024-06-14 15:46:51,579 INFO L125 PetriNetUnfolderBase]: For 16969/16969 co-relation queries the response was YES. [2024-06-14 15:46:51,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5062 conditions, 780 events. 434/780 cut-off events. For 16969/16969 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3691 event pairs, 73 based on Foata normal form. 1/781 useless extension candidates. Maximal degree in co-relation 4987. Up to 550 conditions per place. [2024-06-14 15:46:51,585 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 107 selfloop transitions, 64 changer transitions 0/173 dead transitions. [2024-06-14 15:46:51,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 173 transitions, 2312 flow [2024-06-14 15:46:51,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:51,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-14 15:46:51,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-14 15:46:51,586 INFO L175 Difference]: Start difference. First operand has 159 places, 157 transitions, 1892 flow. Second operand 8 states and 104 transitions. [2024-06-14 15:46:51,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 173 transitions, 2312 flow [2024-06-14 15:46:51,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 173 transitions, 2226 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 15:46:51,624 INFO L231 Difference]: Finished difference. Result has 159 places, 159 transitions, 1974 flow [2024-06-14 15:46:51,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1974, PETRI_PLACES=159, PETRI_TRANSITIONS=159} [2024-06-14 15:46:51,624 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2024-06-14 15:46:51,624 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 159 transitions, 1974 flow [2024-06-14 15:46:51,625 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:46:51,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:51,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:51,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:46:51,625 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:46:51,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:51,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1443349887, now seen corresponding path program 11 times [2024-06-14 15:46:51,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:51,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394152804] [2024-06-14 15:46:51,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:51,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:57,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:57,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:57,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394152804] [2024-06-14 15:46:57,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394152804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:57,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:57,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:46:57,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878703292] [2024-06-14 15:46:57,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:57,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:46:57,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:57,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:46:57,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:46:57,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:46:57,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 159 transitions, 1974 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:46:57,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:57,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:46:57,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:57,513 INFO L124 PetriNetUnfolderBase]: 437/785 cut-off events. [2024-06-14 15:46:57,513 INFO L125 PetriNetUnfolderBase]: For 17001/17001 co-relation queries the response was YES. [2024-06-14 15:46:57,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5168 conditions, 785 events. 437/785 cut-off events. For 17001/17001 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3725 event pairs, 63 based on Foata normal form. 1/786 useless extension candidates. Maximal degree in co-relation 5093. Up to 501 conditions per place. [2024-06-14 15:46:57,518 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 102 selfloop transitions, 77 changer transitions 0/181 dead transitions. [2024-06-14 15:46:57,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 181 transitions, 2502 flow [2024-06-14 15:46:57,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:46:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:46:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-14 15:46:57,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-14 15:46:57,519 INFO L175 Difference]: Start difference. First operand has 159 places, 159 transitions, 1974 flow. Second operand 8 states and 112 transitions. [2024-06-14 15:46:57,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 181 transitions, 2502 flow [2024-06-14 15:46:57,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 181 transitions, 2363 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:57,555 INFO L231 Difference]: Finished difference. Result has 160 places, 161 transitions, 2031 flow [2024-06-14 15:46:57,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2031, PETRI_PLACES=160, PETRI_TRANSITIONS=161} [2024-06-14 15:46:57,556 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 130 predicate places. [2024-06-14 15:46:57,556 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 161 transitions, 2031 flow [2024-06-14 15:46:57,556 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:46:57,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:57,556 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:46:57,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:46:57,556 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:46:57,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:57,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1603741279, now seen corresponding path program 12 times [2024-06-14 15:46:57,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:57,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425794472] [2024-06-14 15:46:57,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:57,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:02,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:02,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425794472] [2024-06-14 15:47:02,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425794472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:02,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:02,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:47:02,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308063281] [2024-06-14 15:47:02,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:02,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:47:02,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:02,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:47:02,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:47:02,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:47:02,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 161 transitions, 2031 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:47:02,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:02,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:47:02,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:02,648 INFO L124 PetriNetUnfolderBase]: 446/802 cut-off events. [2024-06-14 15:47:02,648 INFO L125 PetriNetUnfolderBase]: For 18069/18069 co-relation queries the response was YES. [2024-06-14 15:47:02,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5325 conditions, 802 events. 446/802 cut-off events. For 18069/18069 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3840 event pairs, 77 based on Foata normal form. 3/805 useless extension candidates. Maximal degree in co-relation 5250. Up to 582 conditions per place. [2024-06-14 15:47:02,653 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 122 selfloop transitions, 61 changer transitions 0/185 dead transitions. [2024-06-14 15:47:02,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 185 transitions, 2545 flow [2024-06-14 15:47:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:47:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:47:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-14 15:47:02,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2024-06-14 15:47:02,654 INFO L175 Difference]: Start difference. First operand has 160 places, 161 transitions, 2031 flow. Second operand 8 states and 108 transitions. [2024-06-14 15:47:02,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 185 transitions, 2545 flow [2024-06-14 15:47:02,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 185 transitions, 2348 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:47:02,692 INFO L231 Difference]: Finished difference. Result has 161 places, 165 transitions, 2042 flow [2024-06-14 15:47:02,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2042, PETRI_PLACES=161, PETRI_TRANSITIONS=165} [2024-06-14 15:47:02,692 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2024-06-14 15:47:02,693 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 165 transitions, 2042 flow [2024-06-14 15:47:02,693 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:47:02,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:02,693 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:47:02,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:47:02,693 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:47:02,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:02,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1443527517, now seen corresponding path program 13 times [2024-06-14 15:47:02,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:02,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218056276] [2024-06-14 15:47:02,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:08,266 INFO L134 CoverageAnalysis]: 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:08,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:08,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218056276] [2024-06-14 15:47:08,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218056276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:08,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:08,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:08,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748599159] [2024-06-14 15:47:08,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:08,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:08,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:08,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:08,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:08,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:47:08,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 165 transitions, 2042 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:47:08,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:08,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:47:08,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:08,861 INFO L124 PetriNetUnfolderBase]: 455/815 cut-off events. [2024-06-14 15:47:08,861 INFO L125 PetriNetUnfolderBase]: For 18304/18304 co-relation queries the response was YES. [2024-06-14 15:47:08,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5371 conditions, 815 events. 455/815 cut-off events. For 18304/18304 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3892 event pairs, 70 based on Foata normal form. 3/818 useless extension candidates. Maximal degree in co-relation 5296. Up to 597 conditions per place. [2024-06-14 15:47:08,866 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 127 selfloop transitions, 58 changer transitions 0/187 dead transitions. [2024-06-14 15:47:08,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 187 transitions, 2548 flow [2024-06-14 15:47:08,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:08,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:47:08,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40860215053763443 [2024-06-14 15:47:08,867 INFO L175 Difference]: Start difference. First operand has 161 places, 165 transitions, 2042 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:47:08,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 187 transitions, 2548 flow [2024-06-14 15:47:08,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 187 transitions, 2406 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 15:47:08,901 INFO L231 Difference]: Finished difference. Result has 163 places, 169 transitions, 2102 flow [2024-06-14 15:47:08,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1900, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2102, PETRI_PLACES=163, PETRI_TRANSITIONS=169} [2024-06-14 15:47:08,902 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2024-06-14 15:47:08,902 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 169 transitions, 2102 flow [2024-06-14 15:47:08,902 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:47:08,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:08,902 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:47:08,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:47:08,902 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:47:08,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:08,903 INFO L85 PathProgramCache]: Analyzing trace with hash 437103439, now seen corresponding path program 14 times [2024-06-14 15:47:08,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:08,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827469524] [2024-06-14 15:47:08,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:08,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:14,350 INFO L134 CoverageAnalysis]: 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:14,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:14,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827469524] [2024-06-14 15:47:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827469524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:14,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:14,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40581320] [2024-06-14 15:47:14,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:14,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:14,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:14,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:14,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:14,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:47:14,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 169 transitions, 2102 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:47:14,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:14,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:47:14,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:14,821 INFO L124 PetriNetUnfolderBase]: 464/830 cut-off events. [2024-06-14 15:47:14,821 INFO L125 PetriNetUnfolderBase]: For 18659/18659 co-relation queries the response was YES. [2024-06-14 15:47:14,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5478 conditions, 830 events. 464/830 cut-off events. For 18659/18659 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3966 event pairs, 147 based on Foata normal form. 3/833 useless extension candidates. Maximal degree in co-relation 5403. Up to 777 conditions per place. [2024-06-14 15:47:14,827 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 166 selfloop transitions, 18 changer transitions 0/186 dead transitions. [2024-06-14 15:47:14,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 186 transitions, 2590 flow [2024-06-14 15:47:14,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-14 15:47:14,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-14 15:47:14,829 INFO L175 Difference]: Start difference. First operand has 163 places, 169 transitions, 2102 flow. Second operand 9 states and 102 transitions. [2024-06-14 15:47:14,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 186 transitions, 2590 flow [2024-06-14 15:47:14,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 186 transitions, 2446 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 15:47:14,868 INFO L231 Difference]: Finished difference. Result has 164 places, 173 transitions, 2082 flow [2024-06-14 15:47:14,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1958, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2082, PETRI_PLACES=164, PETRI_TRANSITIONS=173} [2024-06-14 15:47:14,868 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 134 predicate places. [2024-06-14 15:47:14,868 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 173 transitions, 2082 flow [2024-06-14 15:47:14,869 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:47:14,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:14,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:14,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:47:14,869 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:47:14,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:14,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1119811021, now seen corresponding path program 15 times [2024-06-14 15:47:14,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:14,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193352616] [2024-06-14 15:47:14,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:14,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:20,120 INFO L134 CoverageAnalysis]: 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,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:20,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193352616] [2024-06-14 15:47:20,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193352616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:20,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:20,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784293514] [2024-06-14 15:47:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:20,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:20,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:20,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:20,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:20,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:47:20,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 173 transitions, 2082 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:47:20,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:20,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:47:20,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:20,640 INFO L124 PetriNetUnfolderBase]: 458/821 cut-off events. [2024-06-14 15:47:20,640 INFO L125 PetriNetUnfolderBase]: For 16490/16490 co-relation queries the response was YES. [2024-06-14 15:47:20,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5189 conditions, 821 events. 458/821 cut-off events. For 16490/16490 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3913 event pairs, 142 based on Foata normal form. 3/824 useless extension candidates. Maximal degree in co-relation 5114. Up to 756 conditions per place. [2024-06-14 15:47:20,646 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 165 selfloop transitions, 21 changer transitions 0/188 dead transitions. [2024-06-14 15:47:20,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 188 transitions, 2515 flow [2024-06-14 15:47:20,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 15:47:20,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-14 15:47:20,647 INFO L175 Difference]: Start difference. First operand has 164 places, 173 transitions, 2082 flow. Second operand 9 states and 106 transitions. [2024-06-14 15:47:20,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 188 transitions, 2515 flow [2024-06-14 15:47:20,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 188 transitions, 2419 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-14 15:47:20,685 INFO L231 Difference]: Finished difference. Result has 166 places, 173 transitions, 2036 flow [2024-06-14 15:47:20,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1986, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2036, PETRI_PLACES=166, PETRI_TRANSITIONS=173} [2024-06-14 15:47:20,686 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 136 predicate places. [2024-06-14 15:47:20,686 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 173 transitions, 2036 flow [2024-06-14 15:47:20,686 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:47:20,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:20,686 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:47:20,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:47:20,686 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:47:20,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:20,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1355993077, now seen corresponding path program 1 times [2024-06-14 15:47:20,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:20,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864738992] [2024-06-14 15:47:20,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:20,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:25,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:25,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864738992] [2024-06-14 15:47:25,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864738992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:25,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:25,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:25,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317549899] [2024-06-14 15:47:25,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:25,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:25,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:25,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:25,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:25,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:47:25,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 173 transitions, 2036 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:47:25,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:25,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:47:25,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:25,623 INFO L124 PetriNetUnfolderBase]: 452/812 cut-off events. [2024-06-14 15:47:25,623 INFO L125 PetriNetUnfolderBase]: For 15350/15350 co-relation queries the response was YES. [2024-06-14 15:47:25,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5022 conditions, 812 events. 452/812 cut-off events. For 15350/15350 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3856 event pairs, 149 based on Foata normal form. 3/815 useless extension candidates. Maximal degree in co-relation 4946. Up to 766 conditions per place. [2024-06-14 15:47:25,629 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 163 selfloop transitions, 20 changer transitions 0/185 dead transitions. [2024-06-14 15:47:25,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 185 transitions, 2448 flow [2024-06-14 15:47:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:47:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:47:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 15:47:25,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-14 15:47:25,629 INFO L175 Difference]: Start difference. First operand has 166 places, 173 transitions, 2036 flow. Second operand 10 states and 106 transitions. [2024-06-14 15:47:25,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 185 transitions, 2448 flow [2024-06-14 15:47:25,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 185 transitions, 2299 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-14 15:47:25,664 INFO L231 Difference]: Finished difference. Result has 167 places, 175 transitions, 1958 flow [2024-06-14 15:47:25,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1958, PETRI_PLACES=167, PETRI_TRANSITIONS=175} [2024-06-14 15:47:25,664 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2024-06-14 15:47:25,664 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 175 transitions, 1958 flow [2024-06-14 15:47:25,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:25,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:25,665 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:47:25,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:47:25,665 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:47:25,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:25,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2123210819, now seen corresponding path program 1 times [2024-06-14 15:47:25,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:25,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313322651] [2024-06-14 15:47:25,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:25,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:32,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:32,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313322651] [2024-06-14 15:47:32,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313322651] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:32,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:32,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849165699] [2024-06-14 15:47:32,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:32,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:32,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:32,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:32,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:32,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:47:32,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 175 transitions, 1958 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:47:32,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:32,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:47:32,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:32,866 INFO L124 PetriNetUnfolderBase]: 492/894 cut-off events. [2024-06-14 15:47:32,866 INFO L125 PetriNetUnfolderBase]: For 22648/22648 co-relation queries the response was YES. [2024-06-14 15:47:32,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5587 conditions, 894 events. 492/894 cut-off events. For 22648/22648 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4365 event pairs, 96 based on Foata normal form. 2/896 useless extension candidates. Maximal degree in co-relation 5511. Up to 538 conditions per place. [2024-06-14 15:47:32,873 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 147 selfloop transitions, 55 changer transitions 0/204 dead transitions. [2024-06-14 15:47:32,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 204 transitions, 2554 flow [2024-06-14 15:47:32,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:47:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:47:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-14 15:47:32,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2024-06-14 15:47:32,874 INFO L175 Difference]: Start difference. First operand has 167 places, 175 transitions, 1958 flow. Second operand 10 states and 132 transitions. [2024-06-14 15:47:32,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 204 transitions, 2554 flow [2024-06-14 15:47:32,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 204 transitions, 2501 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:47:32,918 INFO L231 Difference]: Finished difference. Result has 169 places, 177 transitions, 2037 flow [2024-06-14 15:47:32,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2037, PETRI_PLACES=169, PETRI_TRANSITIONS=177} [2024-06-14 15:47:32,918 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 139 predicate places. [2024-06-14 15:47:32,919 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 177 transitions, 2037 flow [2024-06-14 15:47:32,919 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:47:32,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:32,919 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:47:32,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:47:32,919 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:47:32,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:32,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2126277781, now seen corresponding path program 2 times [2024-06-14 15:47:32,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:32,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792553708] [2024-06-14 15:47:32,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:32,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:39,869 INFO L134 CoverageAnalysis]: 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:39,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:39,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792553708] [2024-06-14 15:47:39,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792553708] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:39,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:39,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:39,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231808461] [2024-06-14 15:47:39,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:39,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:39,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:39,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:39,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:40,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:47:40,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 177 transitions, 2037 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:47:40,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:40,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:47:40,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:40,427 INFO L124 PetriNetUnfolderBase]: 496/902 cut-off events. [2024-06-14 15:47:40,427 INFO L125 PetriNetUnfolderBase]: For 24264/24264 co-relation queries the response was YES. [2024-06-14 15:47:40,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5760 conditions, 902 events. 496/902 cut-off events. For 24264/24264 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4433 event pairs, 104 based on Foata normal form. 2/904 useless extension candidates. Maximal degree in co-relation 5683. Up to 695 conditions per place. [2024-06-14 15:47:40,434 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 140 selfloop transitions, 55 changer transitions 0/197 dead transitions. [2024-06-14 15:47:40,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 197 transitions, 2501 flow [2024-06-14 15:47:40,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:47:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:47:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:47:40,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:47:40,435 INFO L175 Difference]: Start difference. First operand has 169 places, 177 transitions, 2037 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:47:40,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 197 transitions, 2501 flow [2024-06-14 15:47:40,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 197 transitions, 2427 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 15:47:40,485 INFO L231 Difference]: Finished difference. Result has 173 places, 178 transitions, 2089 flow [2024-06-14 15:47:40,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1963, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2089, PETRI_PLACES=173, PETRI_TRANSITIONS=178} [2024-06-14 15:47:40,486 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 143 predicate places. [2024-06-14 15:47:40,486 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 178 transitions, 2089 flow [2024-06-14 15:47:40,486 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:47:40,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:40,486 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:47:40,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:47:40,487 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:47:40,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:40,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2126274061, now seen corresponding path program 3 times [2024-06-14 15:47:40,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:40,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299310515] [2024-06-14 15:47:40,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:40,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:47,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:47,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299310515] [2024-06-14 15:47:47,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299310515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:47,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:47,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:47,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759565660] [2024-06-14 15:47:47,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:47,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:47,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:47,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:47,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:47,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:47:47,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 178 transitions, 2089 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:47:47,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:47,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:47:47,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:47,953 INFO L124 PetriNetUnfolderBase]: 500/910 cut-off events. [2024-06-14 15:47:47,953 INFO L125 PetriNetUnfolderBase]: For 25566/25566 co-relation queries the response was YES. [2024-06-14 15:47:47,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5931 conditions, 910 events. 500/910 cut-off events. For 25566/25566 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4490 event pairs, 102 based on Foata normal form. 2/912 useless extension candidates. Maximal degree in co-relation 5852. Up to 689 conditions per place. [2024-06-14 15:47:47,960 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 141 selfloop transitions, 56 changer transitions 0/199 dead transitions. [2024-06-14 15:47:47,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 199 transitions, 2561 flow [2024-06-14 15:47:47,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:47:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:47:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:47:47,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-14 15:47:47,961 INFO L175 Difference]: Start difference. First operand has 173 places, 178 transitions, 2089 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:47:47,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 199 transitions, 2561 flow [2024-06-14 15:47:48,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 199 transitions, 2447 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 15:47:48,010 INFO L231 Difference]: Finished difference. Result has 175 places, 179 transitions, 2105 flow [2024-06-14 15:47:48,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2105, PETRI_PLACES=175, PETRI_TRANSITIONS=179} [2024-06-14 15:47:48,010 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 145 predicate places. [2024-06-14 15:47:48,010 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 179 transitions, 2105 flow [2024-06-14 15:47:48,011 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:47:48,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:48,011 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:47:48,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:47:48,011 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:47:48,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:48,012 INFO L85 PathProgramCache]: Analyzing trace with hash -56260730, now seen corresponding path program 1 times [2024-06-14 15:47:48,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:48,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908799064] [2024-06-14 15:47:48,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:48,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:53,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:53,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908799064] [2024-06-14 15:47:53,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908799064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:53,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:53,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:53,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206873091] [2024-06-14 15:47:53,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:53,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:53,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:53,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:53,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:47:53,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 179 transitions, 2105 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:47:53,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:53,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:47:53,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:54,028 INFO L124 PetriNetUnfolderBase]: 516/936 cut-off events. [2024-06-14 15:47:54,028 INFO L125 PetriNetUnfolderBase]: For 28264/28264 co-relation queries the response was YES. [2024-06-14 15:47:54,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6176 conditions, 936 events. 516/936 cut-off events. For 28264/28264 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4635 event pairs, 109 based on Foata normal form. 2/938 useless extension candidates. Maximal degree in co-relation 6096. Up to 635 conditions per place. [2024-06-14 15:47:54,036 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 132 selfloop transitions, 68 changer transitions 0/202 dead transitions. [2024-06-14 15:47:54,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 202 transitions, 2691 flow [2024-06-14 15:47:54,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:47:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:47:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 15:47:54,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-14 15:47:54,040 INFO L175 Difference]: Start difference. First operand has 175 places, 179 transitions, 2105 flow. Second operand 10 states and 129 transitions. [2024-06-14 15:47:54,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 202 transitions, 2691 flow [2024-06-14 15:47:54,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 202 transitions, 2573 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 15:47:54,099 INFO L231 Difference]: Finished difference. Result has 177 places, 183 transitions, 2184 flow [2024-06-14 15:47:54,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2184, PETRI_PLACES=177, PETRI_TRANSITIONS=183} [2024-06-14 15:47:54,099 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2024-06-14 15:47:54,099 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 183 transitions, 2184 flow [2024-06-14 15:47:54,099 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:47:54,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:54,100 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:47:54,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:47:54,100 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:47:54,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash 881459563, now seen corresponding path program 4 times [2024-06-14 15:47:54,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:54,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194468133] [2024-06-14 15:47:54,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:00,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:00,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194468133] [2024-06-14 15:48:00,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194468133] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:00,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:00,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:00,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823399902] [2024-06-14 15:48:00,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:00,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:00,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:00,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:00,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:01,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:48:01,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 183 transitions, 2184 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:48:01,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:01,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:48:01,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:01,643 INFO L124 PetriNetUnfolderBase]: 536/978 cut-off events. [2024-06-14 15:48:01,643 INFO L125 PetriNetUnfolderBase]: For 37735/37735 co-relation queries the response was YES. [2024-06-14 15:48:01,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6427 conditions, 978 events. 536/978 cut-off events. For 37735/37735 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4932 event pairs, 104 based on Foata normal form. 12/990 useless extension candidates. Maximal degree in co-relation 6346. Up to 783 conditions per place. [2024-06-14 15:48:01,650 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 161 selfloop transitions, 37 changer transitions 8/208 dead transitions. [2024-06-14 15:48:01,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 208 transitions, 2717 flow [2024-06-14 15:48:01,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 15:48:01,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-14 15:48:01,651 INFO L175 Difference]: Start difference. First operand has 177 places, 183 transitions, 2184 flow. Second operand 10 states and 129 transitions. [2024-06-14 15:48:01,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 208 transitions, 2717 flow [2024-06-14 15:48:01,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 208 transitions, 2662 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-14 15:48:01,716 INFO L231 Difference]: Finished difference. Result has 182 places, 181 transitions, 2183 flow [2024-06-14 15:48:01,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2183, PETRI_PLACES=182, PETRI_TRANSITIONS=181} [2024-06-14 15:48:01,717 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2024-06-14 15:48:01,717 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 181 transitions, 2183 flow [2024-06-14 15:48:01,717 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:48:01,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:01,717 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:48:01,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:48:01,718 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:48:01,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:01,718 INFO L85 PathProgramCache]: Analyzing trace with hash 493580898, now seen corresponding path program 2 times [2024-06-14 15:48:01,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:01,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196088148] [2024-06-14 15:48:01,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:01,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:07,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:07,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196088148] [2024-06-14 15:48:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196088148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:07,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:07,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:07,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169278160] [2024-06-14 15:48:07,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:07,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:07,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:07,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:07,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:07,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:48:07,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 181 transitions, 2183 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:48:07,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:07,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:48:07,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:08,135 INFO L124 PetriNetUnfolderBase]: 516/938 cut-off events. [2024-06-14 15:48:08,136 INFO L125 PetriNetUnfolderBase]: For 31640/31640 co-relation queries the response was YES. [2024-06-14 15:48:08,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6357 conditions, 938 events. 516/938 cut-off events. For 31640/31640 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4675 event pairs, 96 based on Foata normal form. 2/940 useless extension candidates. Maximal degree in co-relation 6274. Up to 733 conditions per place. [2024-06-14 15:48:08,142 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 149 selfloop transitions, 49 changer transitions 0/200 dead transitions. [2024-06-14 15:48:08,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 200 transitions, 2658 flow [2024-06-14 15:48:08,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:48:08,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-14 15:48:08,143 INFO L175 Difference]: Start difference. First operand has 182 places, 181 transitions, 2183 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:48:08,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 200 transitions, 2658 flow [2024-06-14 15:48:08,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 200 transitions, 2576 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:08,201 INFO L231 Difference]: Finished difference. Result has 184 places, 183 transitions, 2234 flow [2024-06-14 15:48:08,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2101, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2234, PETRI_PLACES=184, PETRI_TRANSITIONS=183} [2024-06-14 15:48:08,202 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 154 predicate places. [2024-06-14 15:48:08,202 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 183 transitions, 2234 flow [2024-06-14 15:48:08,202 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:48:08,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:08,202 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:48:08,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:48:08,202 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:48:08,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:08,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2081997705, now seen corresponding path program 5 times [2024-06-14 15:48:08,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:08,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805296726] [2024-06-14 15:48:08,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:08,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:15,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:15,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805296726] [2024-06-14 15:48:15,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805296726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:15,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:15,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:15,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197926447] [2024-06-14 15:48:15,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:15,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:15,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:15,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:15,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:15,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:48:15,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 183 transitions, 2234 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:48:15,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:15,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:48:15,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:15,633 INFO L124 PetriNetUnfolderBase]: 520/946 cut-off events. [2024-06-14 15:48:15,633 INFO L125 PetriNetUnfolderBase]: For 33253/33253 co-relation queries the response was YES. [2024-06-14 15:48:15,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6453 conditions, 946 events. 520/946 cut-off events. For 33253/33253 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4740 event pairs, 101 based on Foata normal form. 2/948 useless extension candidates. Maximal degree in co-relation 6369. Up to 786 conditions per place. [2024-06-14 15:48:15,639 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 161 selfloop transitions, 43 changer transitions 0/206 dead transitions. [2024-06-14 15:48:15,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 206 transitions, 2743 flow [2024-06-14 15:48:15,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:15,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:48:15,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-14 15:48:15,641 INFO L175 Difference]: Start difference. First operand has 184 places, 183 transitions, 2234 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:48:15,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 206 transitions, 2743 flow [2024-06-14 15:48:15,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 206 transitions, 2630 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:15,701 INFO L231 Difference]: Finished difference. Result has 187 places, 186 transitions, 2262 flow [2024-06-14 15:48:15,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2262, PETRI_PLACES=187, PETRI_TRANSITIONS=186} [2024-06-14 15:48:15,702 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2024-06-14 15:48:15,702 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 186 transitions, 2262 flow [2024-06-14 15:48:15,702 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:48:15,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:15,702 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:48:15,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:48:15,703 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:48:15,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:15,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2081997550, now seen corresponding path program 3 times [2024-06-14 15:48:15,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:15,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612248159] [2024-06-14 15:48:15,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:15,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:21,116 INFO L134 CoverageAnalysis]: 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:21,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:21,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612248159] [2024-06-14 15:48:21,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612248159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:21,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:21,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:21,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691404] [2024-06-14 15:48:21,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:21,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:21,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:21,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:21,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:21,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:48:21,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 186 transitions, 2262 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:48:21,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:21,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:48:21,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:21,758 INFO L124 PetriNetUnfolderBase]: 526/956 cut-off events. [2024-06-14 15:48:21,758 INFO L125 PetriNetUnfolderBase]: For 34694/34694 co-relation queries the response was YES. [2024-06-14 15:48:21,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6630 conditions, 956 events. 526/956 cut-off events. For 34694/34694 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4764 event pairs, 98 based on Foata normal form. 2/958 useless extension candidates. Maximal degree in co-relation 6544. Up to 739 conditions per place. [2024-06-14 15:48:21,766 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 151 selfloop transitions, 53 changer transitions 0/206 dead transitions. [2024-06-14 15:48:21,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 206 transitions, 2767 flow [2024-06-14 15:48:21,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 15:48:21,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-14 15:48:21,767 INFO L175 Difference]: Start difference. First operand has 187 places, 186 transitions, 2262 flow. Second operand 10 states and 129 transitions. [2024-06-14 15:48:21,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 206 transitions, 2767 flow [2024-06-14 15:48:21,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 206 transitions, 2686 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:48:21,834 INFO L231 Difference]: Finished difference. Result has 190 places, 188 transitions, 2326 flow [2024-06-14 15:48:21,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2181, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2326, PETRI_PLACES=190, PETRI_TRANSITIONS=188} [2024-06-14 15:48:21,834 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 160 predicate places. [2024-06-14 15:48:21,834 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 188 transitions, 2326 flow [2024-06-14 15:48:21,835 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:48:21,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:21,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:21,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:48:21,835 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:48:21,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:21,835 INFO L85 PathProgramCache]: Analyzing trace with hash 493432873, now seen corresponding path program 6 times [2024-06-14 15:48:21,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:21,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988440598] [2024-06-14 15:48:21,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:21,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:28,913 INFO L134 CoverageAnalysis]: 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:28,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:28,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988440598] [2024-06-14 15:48:28,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988440598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:28,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:28,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:28,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171902029] [2024-06-14 15:48:28,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:28,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:28,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:28,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:28,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:29,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:48:29,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 188 transitions, 2326 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:48:29,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:29,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:48:29,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:29,562 INFO L124 PetriNetUnfolderBase]: 530/964 cut-off events. [2024-06-14 15:48:29,562 INFO L125 PetriNetUnfolderBase]: For 36620/36620 co-relation queries the response was YES. [2024-06-14 15:48:29,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6729 conditions, 964 events. 530/964 cut-off events. For 36620/36620 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4864 event pairs, 102 based on Foata normal form. 2/966 useless extension candidates. Maximal degree in co-relation 6642. Up to 793 conditions per place. [2024-06-14 15:48:29,571 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 165 selfloop transitions, 42 changer transitions 0/209 dead transitions. [2024-06-14 15:48:29,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 209 transitions, 2831 flow [2024-06-14 15:48:29,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:48:29,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-14 15:48:29,572 INFO L175 Difference]: Start difference. First operand has 190 places, 188 transitions, 2326 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:48:29,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 209 transitions, 2831 flow [2024-06-14 15:48:29,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 209 transitions, 2706 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:29,651 INFO L231 Difference]: Finished difference. Result has 192 places, 189 transitions, 2309 flow [2024-06-14 15:48:29,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2201, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2309, PETRI_PLACES=192, PETRI_TRANSITIONS=189} [2024-06-14 15:48:29,652 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 162 predicate places. [2024-06-14 15:48:29,652 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 189 transitions, 2309 flow [2024-06-14 15:48:29,652 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:48:29,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:29,652 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:48:29,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:48:29,653 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:48:29,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1566340949, now seen corresponding path program 7 times [2024-06-14 15:48:29,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:29,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285462870] [2024-06-14 15:48:29,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:29,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:36,563 INFO L134 CoverageAnalysis]: 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:36,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:36,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285462870] [2024-06-14 15:48:36,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285462870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:36,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:36,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:36,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997919805] [2024-06-14 15:48:36,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:36,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:36,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:36,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:36,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:36,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:48:36,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 189 transitions, 2309 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:48:36,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:36,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:48:36,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:37,233 INFO L124 PetriNetUnfolderBase]: 534/972 cut-off events. [2024-06-14 15:48:37,233 INFO L125 PetriNetUnfolderBase]: For 37837/37837 co-relation queries the response was YES. [2024-06-14 15:48:37,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6758 conditions, 972 events. 534/972 cut-off events. For 37837/37837 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4883 event pairs, 77 based on Foata normal form. 2/974 useless extension candidates. Maximal degree in co-relation 6670. Up to 537 conditions per place. [2024-06-14 15:48:37,243 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 137 selfloop transitions, 74 changer transitions 0/213 dead transitions. [2024-06-14 15:48:37,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 213 transitions, 2909 flow [2024-06-14 15:48:37,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-14 15:48:37,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-14 15:48:37,244 INFO L175 Difference]: Start difference. First operand has 192 places, 189 transitions, 2309 flow. Second operand 10 states and 119 transitions. [2024-06-14 15:48:37,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 213 transitions, 2909 flow [2024-06-14 15:48:37,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 213 transitions, 2811 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:37,322 INFO L231 Difference]: Finished difference. Result has 194 places, 190 transitions, 2375 flow [2024-06-14 15:48:37,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2213, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2375, PETRI_PLACES=194, PETRI_TRANSITIONS=190} [2024-06-14 15:48:37,322 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 164 predicate places. [2024-06-14 15:48:37,322 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 190 transitions, 2375 flow [2024-06-14 15:48:37,323 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:48:37,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:37,323 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:48:37,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:48:37,323 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:48:37,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:37,323 INFO L85 PathProgramCache]: Analyzing trace with hash -63096817, now seen corresponding path program 8 times [2024-06-14 15:48:37,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:37,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096566735] [2024-06-14 15:48:37,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:37,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:44,374 INFO L134 CoverageAnalysis]: 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:44,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:44,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096566735] [2024-06-14 15:48:44,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096566735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:44,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:44,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:44,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476422190] [2024-06-14 15:48:44,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:44,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:44,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:44,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:44,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:44,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:48:44,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 190 transitions, 2375 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:48:44,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:44,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:48:44,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:44,946 INFO L124 PetriNetUnfolderBase]: 545/993 cut-off events. [2024-06-14 15:48:44,946 INFO L125 PetriNetUnfolderBase]: For 41451/41451 co-relation queries the response was YES. [2024-06-14 15:48:44,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7041 conditions, 993 events. 545/993 cut-off events. For 41451/41451 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5047 event pairs, 99 based on Foata normal form. 2/995 useless extension candidates. Maximal degree in co-relation 6952. Up to 751 conditions per place. [2024-06-14 15:48:44,954 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 146 selfloop transitions, 67 changer transitions 0/215 dead transitions. [2024-06-14 15:48:44,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 215 transitions, 2995 flow [2024-06-14 15:48:44,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:44,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 15:48:44,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-14 15:48:44,956 INFO L175 Difference]: Start difference. First operand has 194 places, 190 transitions, 2375 flow. Second operand 10 states and 125 transitions. [2024-06-14 15:48:44,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 215 transitions, 2995 flow [2024-06-14 15:48:45,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 215 transitions, 2856 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-14 15:48:45,033 INFO L231 Difference]: Finished difference. Result has 197 places, 192 transitions, 2400 flow [2024-06-14 15:48:45,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2400, PETRI_PLACES=197, PETRI_TRANSITIONS=192} [2024-06-14 15:48:45,034 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places. [2024-06-14 15:48:45,034 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 192 transitions, 2400 flow [2024-06-14 15:48:45,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:48:45,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:45,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:48:45,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:48:45,035 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:48:45,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash 311466418, now seen corresponding path program 4 times [2024-06-14 15:48:45,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:45,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375723506] [2024-06-14 15:48:45,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:45,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:50,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:50,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375723506] [2024-06-14 15:48:50,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375723506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:50,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:50,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:50,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664214957] [2024-06-14 15:48:50,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:50,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:50,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:50,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:50,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:50,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:48:50,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 192 transitions, 2400 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:48:50,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:50,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:48:50,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:51,178 INFO L124 PetriNetUnfolderBase]: 551/1003 cut-off events. [2024-06-14 15:48:51,179 INFO L125 PetriNetUnfolderBase]: For 42752/42752 co-relation queries the response was YES. [2024-06-14 15:48:51,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7107 conditions, 1003 events. 551/1003 cut-off events. For 42752/42752 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5101 event pairs, 103 based on Foata normal form. 2/1005 useless extension candidates. Maximal degree in co-relation 7017. Up to 800 conditions per place. [2024-06-14 15:48:51,186 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 144 selfloop transitions, 67 changer transitions 0/213 dead transitions. [2024-06-14 15:48:51,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 213 transitions, 2926 flow [2024-06-14 15:48:51,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 15:48:51,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-14 15:48:51,187 INFO L175 Difference]: Start difference. First operand has 197 places, 192 transitions, 2400 flow. Second operand 10 states and 120 transitions. [2024-06-14 15:48:51,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 213 transitions, 2926 flow [2024-06-14 15:48:51,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 213 transitions, 2829 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:48:51,270 INFO L231 Difference]: Finished difference. Result has 201 places, 194 transitions, 2476 flow [2024-06-14 15:48:51,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2305, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2476, PETRI_PLACES=201, PETRI_TRANSITIONS=194} [2024-06-14 15:48:51,270 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 171 predicate places. [2024-06-14 15:48:51,270 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 194 transitions, 2476 flow [2024-06-14 15:48:51,271 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:48:51,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:51,271 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:48:51,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:48:51,271 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:48:51,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:51,271 INFO L85 PathProgramCache]: Analyzing trace with hash -61222867, now seen corresponding path program 9 times [2024-06-14 15:48:51,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:51,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922217751] [2024-06-14 15:48:51,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:51,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:58,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:58,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922217751] [2024-06-14 15:48:58,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922217751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:58,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:58,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:58,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536470249] [2024-06-14 15:48:58,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:58,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:58,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:58,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:58,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:48:58,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 194 transitions, 2476 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:48:58,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:58,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:48:58,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:59,208 INFO L124 PetriNetUnfolderBase]: 555/1011 cut-off events. [2024-06-14 15:48:59,208 INFO L125 PetriNetUnfolderBase]: For 44266/44266 co-relation queries the response was YES. [2024-06-14 15:48:59,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7292 conditions, 1011 events. 555/1011 cut-off events. For 44266/44266 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5162 event pairs, 101 based on Foata normal form. 2/1013 useless extension candidates. Maximal degree in co-relation 7200. Up to 791 conditions per place. [2024-06-14 15:48:59,215 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 147 selfloop transitions, 67 changer transitions 0/216 dead transitions. [2024-06-14 15:48:59,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 216 transitions, 3079 flow [2024-06-14 15:48:59,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 15:48:59,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-14 15:48:59,218 INFO L175 Difference]: Start difference. First operand has 201 places, 194 transitions, 2476 flow. Second operand 10 states and 122 transitions. [2024-06-14 15:48:59,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 216 transitions, 3079 flow [2024-06-14 15:48:59,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 216 transitions, 2924 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:59,306 INFO L231 Difference]: Finished difference. Result has 203 places, 195 transitions, 2466 flow [2024-06-14 15:48:59,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2321, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2466, PETRI_PLACES=203, PETRI_TRANSITIONS=195} [2024-06-14 15:48:59,306 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2024-06-14 15:48:59,307 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 195 transitions, 2466 flow [2024-06-14 15:48:59,307 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:48:59,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:59,307 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:48:59,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:48:59,307 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:48:59,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash 298954043, now seen corresponding path program 10 times [2024-06-14 15:48:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:59,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611144432] [2024-06-14 15:48:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:59,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:06,584 INFO L134 CoverageAnalysis]: 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,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:06,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611144432] [2024-06-14 15:49:06,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611144432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:06,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:06,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:06,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084498248] [2024-06-14 15:49:06,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:06,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:06,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:06,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:06,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:06,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:49:06,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 195 transitions, 2466 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:49:06,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:06,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:49:06,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:07,203 INFO L124 PetriNetUnfolderBase]: 552/1006 cut-off events. [2024-06-14 15:49:07,204 INFO L125 PetriNetUnfolderBase]: For 43618/43618 co-relation queries the response was YES. [2024-06-14 15:49:07,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7193 conditions, 1006 events. 552/1006 cut-off events. For 43618/43618 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5136 event pairs, 102 based on Foata normal form. 2/1008 useless extension candidates. Maximal degree in co-relation 7100. Up to 803 conditions per place. [2024-06-14 15:49:07,212 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 146 selfloop transitions, 66 changer transitions 0/214 dead transitions. [2024-06-14 15:49:07,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 214 transitions, 2960 flow [2024-06-14 15:49:07,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-14 15:49:07,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-14 15:49:07,214 INFO L175 Difference]: Start difference. First operand has 203 places, 195 transitions, 2466 flow. Second operand 10 states and 119 transitions. [2024-06-14 15:49:07,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 214 transitions, 2960 flow [2024-06-14 15:49:07,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 214 transitions, 2822 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:07,300 INFO L231 Difference]: Finished difference. Result has 205 places, 195 transitions, 2464 flow [2024-06-14 15:49:07,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2328, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2464, PETRI_PLACES=205, PETRI_TRANSITIONS=195} [2024-06-14 15:49:07,301 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2024-06-14 15:49:07,301 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 195 transitions, 2464 flow [2024-06-14 15:49:07,301 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:49:07,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:07,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:07,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:49:07,302 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:49:07,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:07,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1169329133, now seen corresponding path program 11 times [2024-06-14 15:49:07,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:07,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973119677] [2024-06-14 15:49:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:14,341 INFO L134 CoverageAnalysis]: 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:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:14,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973119677] [2024-06-14 15:49:14,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973119677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:14,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:14,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:14,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735852879] [2024-06-14 15:49:14,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:14,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:14,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:14,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:14,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:14,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:49:14,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 195 transitions, 2464 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:49:14,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:14,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:49:14,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:15,059 INFO L124 PetriNetUnfolderBase]: 561/1025 cut-off events. [2024-06-14 15:49:15,059 INFO L125 PetriNetUnfolderBase]: For 45249/45249 co-relation queries the response was YES. [2024-06-14 15:49:15,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7303 conditions, 1025 events. 561/1025 cut-off events. For 45249/45249 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5263 event pairs, 107 based on Foata normal form. 2/1027 useless extension candidates. Maximal degree in co-relation 7209. Up to 748 conditions per place. [2024-06-14 15:49:15,068 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 176 selfloop transitions, 48 changer transitions 0/226 dead transitions. [2024-06-14 15:49:15,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 226 transitions, 3173 flow [2024-06-14 15:49:15,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-14 15:49:15,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44193548387096776 [2024-06-14 15:49:15,069 INFO L175 Difference]: Start difference. First operand has 205 places, 195 transitions, 2464 flow. Second operand 10 states and 137 transitions. [2024-06-14 15:49:15,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 226 transitions, 3173 flow [2024-06-14 15:49:15,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 226 transitions, 3037 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-14 15:49:15,168 INFO L231 Difference]: Finished difference. Result has 207 places, 197 transitions, 2470 flow [2024-06-14 15:49:15,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2330, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2470, PETRI_PLACES=207, PETRI_TRANSITIONS=197} [2024-06-14 15:49:15,168 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 177 predicate places. [2024-06-14 15:49:15,168 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 197 transitions, 2470 flow [2024-06-14 15:49:15,169 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:49:15,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:15,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:15,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:49:15,169 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:49:15,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:15,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1013205658, now seen corresponding path program 5 times [2024-06-14 15:49:15,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:15,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223894352] [2024-06-14 15:49:15,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:15,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:21,193 INFO L134 CoverageAnalysis]: 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:21,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:21,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223894352] [2024-06-14 15:49:21,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223894352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:21,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:21,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:21,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465593824] [2024-06-14 15:49:21,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:21,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:21,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:21,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:21,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:21,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:49:21,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 197 transitions, 2470 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:49:21,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:21,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:49:21,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:21,774 INFO L124 PetriNetUnfolderBase]: 567/1035 cut-off events. [2024-06-14 15:49:21,774 INFO L125 PetriNetUnfolderBase]: For 47072/47072 co-relation queries the response was YES. [2024-06-14 15:49:21,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7398 conditions, 1035 events. 567/1035 cut-off events. For 47072/47072 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5340 event pairs, 111 based on Foata normal form. 2/1037 useless extension candidates. Maximal degree in co-relation 7302. Up to 789 conditions per place. [2024-06-14 15:49:21,783 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 160 selfloop transitions, 58 changer transitions 0/220 dead transitions. [2024-06-14 15:49:21,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 220 transitions, 3116 flow [2024-06-14 15:49:21,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 15:49:21,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290322580645161 [2024-06-14 15:49:21,784 INFO L175 Difference]: Start difference. First operand has 207 places, 197 transitions, 2470 flow. Second operand 10 states and 133 transitions. [2024-06-14 15:49:21,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 220 transitions, 3116 flow [2024-06-14 15:49:21,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 220 transitions, 2998 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:21,892 INFO L231 Difference]: Finished difference. Result has 209 places, 199 transitions, 2505 flow [2024-06-14 15:49:21,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2352, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2505, PETRI_PLACES=209, PETRI_TRANSITIONS=199} [2024-06-14 15:49:21,893 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2024-06-14 15:49:21,893 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 199 transitions, 2505 flow [2024-06-14 15:49:21,893 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:49:21,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:21,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:21,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:49:21,893 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:49:21,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1169332853, now seen corresponding path program 12 times [2024-06-14 15:49:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166127328] [2024-06-14 15:49:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:21,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:28,520 INFO L134 CoverageAnalysis]: 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:28,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:28,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166127328] [2024-06-14 15:49:28,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166127328] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:28,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:28,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:28,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200144961] [2024-06-14 15:49:28,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:28,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:28,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:28,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:28,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:49:28,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 199 transitions, 2505 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:49:28,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:28,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:49:28,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:29,229 INFO L124 PetriNetUnfolderBase]: 571/1043 cut-off events. [2024-06-14 15:49:29,229 INFO L125 PetriNetUnfolderBase]: For 49003/49003 co-relation queries the response was YES. [2024-06-14 15:49:29,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7467 conditions, 1043 events. 571/1043 cut-off events. For 49003/49003 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5382 event pairs, 113 based on Foata normal form. 2/1045 useless extension candidates. Maximal degree in co-relation 7370. Up to 868 conditions per place. [2024-06-14 15:49:29,237 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 174 selfloop transitions, 46 changer transitions 0/222 dead transitions. [2024-06-14 15:49:29,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 222 transitions, 3049 flow [2024-06-14 15:49:29,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 15:49:29,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-14 15:49:29,238 INFO L175 Difference]: Start difference. First operand has 209 places, 199 transitions, 2505 flow. Second operand 10 states and 129 transitions. [2024-06-14 15:49:29,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 222 transitions, 3049 flow [2024-06-14 15:49:29,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 222 transitions, 2898 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:29,343 INFO L231 Difference]: Finished difference. Result has 211 places, 200 transitions, 2470 flow [2024-06-14 15:49:29,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2354, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2470, PETRI_PLACES=211, PETRI_TRANSITIONS=200} [2024-06-14 15:49:29,343 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-14 15:49:29,343 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 200 transitions, 2470 flow [2024-06-14 15:49:29,343 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:49:29,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:29,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:29,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:49:29,344 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:49:29,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:29,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1169477003, now seen corresponding path program 13 times [2024-06-14 15:49:29,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:29,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849128649] [2024-06-14 15:49:29,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:29,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:36,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:36,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849128649] [2024-06-14 15:49:36,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849128649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:36,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:36,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913448812] [2024-06-14 15:49:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:36,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:36,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:36,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:49:36,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 200 transitions, 2470 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:49:36,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:36,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:49:36,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:36,733 INFO L124 PetriNetUnfolderBase]: 591/1087 cut-off events. [2024-06-14 15:49:36,733 INFO L125 PetriNetUnfolderBase]: For 63906/63906 co-relation queries the response was YES. [2024-06-14 15:49:36,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7630 conditions, 1087 events. 591/1087 cut-off events. For 63906/63906 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5696 event pairs, 113 based on Foata normal form. 12/1099 useless extension candidates. Maximal degree in co-relation 7532. Up to 892 conditions per place. [2024-06-14 15:49:36,742 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 183 selfloop transitions, 35 changer transitions 8/228 dead transitions. [2024-06-14 15:49:36,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 228 transitions, 3078 flow [2024-06-14 15:49:36,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-14 15:49:36,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2024-06-14 15:49:36,743 INFO L175 Difference]: Start difference. First operand has 211 places, 200 transitions, 2470 flow. Second operand 10 states and 132 transitions. [2024-06-14 15:49:36,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 228 transitions, 3078 flow [2024-06-14 15:49:36,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 228 transitions, 2976 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:36,858 INFO L231 Difference]: Finished difference. Result has 213 places, 198 transitions, 2415 flow [2024-06-14 15:49:36,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2368, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2415, PETRI_PLACES=213, PETRI_TRANSITIONS=198} [2024-06-14 15:49:36,859 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 183 predicate places. [2024-06-14 15:49:36,859 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 198 transitions, 2415 flow [2024-06-14 15:49:36,859 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:49:36,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:36,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:36,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:49:36,859 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:49:36,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:36,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1174839538, now seen corresponding path program 6 times [2024-06-14 15:49:36,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:36,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54478316] [2024-06-14 15:49:36,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:36,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:42,282 INFO L134 CoverageAnalysis]: 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:42,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:42,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54478316] [2024-06-14 15:49:42,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54478316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:42,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:42,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:42,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34503002] [2024-06-14 15:49:42,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:42,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:42,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:42,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:42,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:42,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:49:42,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 198 transitions, 2415 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:42,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:42,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:49:42,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:43,023 INFO L124 PetriNetUnfolderBase]: 571/1048 cut-off events. [2024-06-14 15:49:43,023 INFO L125 PetriNetUnfolderBase]: For 52322/52322 co-relation queries the response was YES. [2024-06-14 15:49:43,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7437 conditions, 1048 events. 571/1048 cut-off events. For 52322/52322 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5427 event pairs, 109 based on Foata normal form. 2/1050 useless extension candidates. Maximal degree in co-relation 7338. Up to 834 conditions per place. [2024-06-14 15:49:43,031 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 169 selfloop transitions, 50 changer transitions 0/221 dead transitions. [2024-06-14 15:49:43,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 221 transitions, 2969 flow [2024-06-14 15:49:43,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:49:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:49:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-14 15:49:43,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507 [2024-06-14 15:49:43,032 INFO L175 Difference]: Start difference. First operand has 213 places, 198 transitions, 2415 flow. Second operand 11 states and 139 transitions. [2024-06-14 15:49:43,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 221 transitions, 2969 flow [2024-06-14 15:49:43,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 221 transitions, 2887 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:43,151 INFO L231 Difference]: Finished difference. Result has 216 places, 200 transitions, 2474 flow [2024-06-14 15:49:43,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2333, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2474, PETRI_PLACES=216, PETRI_TRANSITIONS=200} [2024-06-14 15:49:43,152 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 186 predicate places. [2024-06-14 15:49:43,152 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 200 transitions, 2474 flow [2024-06-14 15:49:43,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:43,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:43,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:43,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 15:49:43,152 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:49:43,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:43,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1418827828, now seen corresponding path program 7 times [2024-06-14 15:49:43,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:43,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940753675] [2024-06-14 15:49:43,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:43,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:48,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:49:48,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:48,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940753675] [2024-06-14 15:49:48,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940753675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:48,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:48,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:49:48,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018430550] [2024-06-14 15:49:48,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:48,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:49:48,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:48,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:49:48,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:49:49,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:49:49,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 200 transitions, 2474 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:49:49,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:49,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:49:49,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:49,486 INFO L124 PetriNetUnfolderBase]: 567/1041 cut-off events. [2024-06-14 15:49:49,486 INFO L125 PetriNetUnfolderBase]: For 51089/51089 co-relation queries the response was YES. [2024-06-14 15:49:49,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7343 conditions, 1041 events. 567/1041 cut-off events. For 51089/51089 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5428 event pairs, 110 based on Foata normal form. 2/1043 useless extension candidates. Maximal degree in co-relation 7243. Up to 836 conditions per place. [2024-06-14 15:49:49,500 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 171 selfloop transitions, 47 changer transitions 0/220 dead transitions. [2024-06-14 15:49:49,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 220 transitions, 2990 flow [2024-06-14 15:49:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 15:49:49,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-14 15:49:49,501 INFO L175 Difference]: Start difference. First operand has 216 places, 200 transitions, 2474 flow. Second operand 10 states and 129 transitions. [2024-06-14 15:49:49,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 220 transitions, 2990 flow [2024-06-14 15:49:49,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 220 transitions, 2855 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-06-14 15:49:49,613 INFO L231 Difference]: Finished difference. Result has 217 places, 200 transitions, 2438 flow [2024-06-14 15:49:49,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2339, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2438, PETRI_PLACES=217, PETRI_TRANSITIONS=200} [2024-06-14 15:49:49,613 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 187 predicate places. [2024-06-14 15:49:49,613 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 200 transitions, 2438 flow [2024-06-14 15:49:49,614 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:49:49,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:49,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:49,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 15:49:49,614 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:49:49,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:49,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1174839383, now seen corresponding path program 14 times [2024-06-14 15:49:49,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:49,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319056577] [2024-06-14 15:49:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:49,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:56,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:56,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319056577] [2024-06-14 15:49:56,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319056577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:56,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:56,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:56,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468328848] [2024-06-14 15:49:56,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:56,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:56,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:56,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:56,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:57,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:49:57,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 200 transitions, 2438 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:57,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:57,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:49:57,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:57,765 INFO L124 PetriNetUnfolderBase]: 551/1014 cut-off events. [2024-06-14 15:49:57,765 INFO L125 PetriNetUnfolderBase]: For 49714/49714 co-relation queries the response was YES. [2024-06-14 15:49:57,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6552 conditions, 1014 events. 551/1014 cut-off events. For 49714/49714 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5288 event pairs, 96 based on Foata normal form. 12/1026 useless extension candidates. Maximal degree in co-relation 6451. Up to 818 conditions per place. [2024-06-14 15:49:57,773 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 182 selfloop transitions, 35 changer transitions 8/227 dead transitions. [2024-06-14 15:49:57,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 227 transitions, 3022 flow [2024-06-14 15:49:57,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:49:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:49:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-14 15:49:57,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41055718475073316 [2024-06-14 15:49:57,777 INFO L175 Difference]: Start difference. First operand has 217 places, 200 transitions, 2438 flow. Second operand 11 states and 140 transitions. [2024-06-14 15:49:57,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 227 transitions, 3022 flow [2024-06-14 15:49:57,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 227 transitions, 2890 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-14 15:49:57,882 INFO L231 Difference]: Finished difference. Result has 219 places, 197 transitions, 2333 flow [2024-06-14 15:49:57,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2306, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2333, PETRI_PLACES=219, PETRI_TRANSITIONS=197} [2024-06-14 15:49:57,883 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 189 predicate places. [2024-06-14 15:49:57,883 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 197 transitions, 2333 flow [2024-06-14 15:49:57,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:57,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:57,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:57,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 15:49:57,883 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:49:57,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:57,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2035713332, now seen corresponding path program 1 times [2024-06-14 15:49:57,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:57,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514502694] [2024-06-14 15:49:57,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:57,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:04,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:50:04,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:04,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514502694] [2024-06-14 15:50:04,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514502694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:04,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:04,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:04,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556699907] [2024-06-14 15:50:04,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:04,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:04,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:04,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:04,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:04,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:50:04,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 197 transitions, 2333 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:04,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:04,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:50:04,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:05,228 INFO L124 PetriNetUnfolderBase]: 533/979 cut-off events. [2024-06-14 15:50:05,228 INFO L125 PetriNetUnfolderBase]: For 38572/38572 co-relation queries the response was YES. [2024-06-14 15:50:05,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6310 conditions, 979 events. 533/979 cut-off events. For 38572/38572 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5121 event pairs, 98 based on Foata normal form. 4/983 useless extension candidates. Maximal degree in co-relation 6208. Up to 754 conditions per place. [2024-06-14 15:50:05,239 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 164 selfloop transitions, 52 changer transitions 0/218 dead transitions. [2024-06-14 15:50:05,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 218 transitions, 2865 flow [2024-06-14 15:50:05,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:05,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:50:05,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-14 15:50:05,241 INFO L175 Difference]: Start difference. First operand has 219 places, 197 transitions, 2333 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:50:05,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 218 transitions, 2865 flow [2024-06-14 15:50:05,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 218 transitions, 2714 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-14 15:50:05,355 INFO L231 Difference]: Finished difference. Result has 219 places, 201 transitions, 2345 flow [2024-06-14 15:50:05,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2185, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2345, PETRI_PLACES=219, PETRI_TRANSITIONS=201} [2024-06-14 15:50:05,356 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 189 predicate places. [2024-06-14 15:50:05,356 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 201 transitions, 2345 flow [2024-06-14 15:50:05,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:05,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:05,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:05,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 15:50:05,356 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:50:05,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1191399647, now seen corresponding path program 15 times [2024-06-14 15:50:05,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:05,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657611431] [2024-06-14 15:50:05,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:05,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:11,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:11,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657611431] [2024-06-14 15:50:11,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657611431] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:11,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:11,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:11,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821603793] [2024-06-14 15:50:11,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:11,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:11,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:11,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:11,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:11,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:50:11,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 201 transitions, 2345 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:50:11,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:11,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:50:11,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:12,025 INFO L124 PetriNetUnfolderBase]: 566/1046 cut-off events. [2024-06-14 15:50:12,026 INFO L125 PetriNetUnfolderBase]: For 52534/52534 co-relation queries the response was YES. [2024-06-14 15:50:12,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7055 conditions, 1046 events. 566/1046 cut-off events. For 52534/52534 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5488 event pairs, 72 based on Foata normal form. 2/1048 useless extension candidates. Maximal degree in co-relation 6953. Up to 358 conditions per place. [2024-06-14 15:50:12,036 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 112 selfloop transitions, 110 changer transitions 0/224 dead transitions. [2024-06-14 15:50:12,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 224 transitions, 3002 flow [2024-06-14 15:50:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 15:50:12,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-14 15:50:12,037 INFO L175 Difference]: Start difference. First operand has 219 places, 201 transitions, 2345 flow. Second operand 9 states and 117 transitions. [2024-06-14 15:50:12,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 224 transitions, 3002 flow [2024-06-14 15:50:12,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 224 transitions, 2883 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 15:50:12,148 INFO L231 Difference]: Finished difference. Result has 221 places, 202 transitions, 2465 flow [2024-06-14 15:50:12,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2465, PETRI_PLACES=221, PETRI_TRANSITIONS=202} [2024-06-14 15:50:12,148 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 191 predicate places. [2024-06-14 15:50:12,148 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 202 transitions, 2465 flow [2024-06-14 15:50:12,148 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:50:12,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:12,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:12,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 15:50:12,149 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:50:12,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:12,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1866543683, now seen corresponding path program 16 times [2024-06-14 15:50:12,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:12,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096048761] [2024-06-14 15:50:12,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:12,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:17,976 INFO L134 CoverageAnalysis]: 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:17,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:17,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096048761] [2024-06-14 15:50:17,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096048761] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:17,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:17,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:17,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206082377] [2024-06-14 15:50:17,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:17,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:17,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:17,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:17,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:18,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:50:18,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 202 transitions, 2465 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:50:18,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:18,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:50:18,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:18,515 INFO L124 PetriNetUnfolderBase]: 580/1070 cut-off events. [2024-06-14 15:50:18,516 INFO L125 PetriNetUnfolderBase]: For 57906/57906 co-relation queries the response was YES. [2024-06-14 15:50:18,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7492 conditions, 1070 events. 580/1070 cut-off events. For 57906/57906 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5625 event pairs, 103 based on Foata normal form. 2/1072 useless extension candidates. Maximal degree in co-relation 7389. Up to 699 conditions per place. [2024-06-14 15:50:18,562 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 118 selfloop transitions, 102 changer transitions 0/222 dead transitions. [2024-06-14 15:50:18,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 222 transitions, 3116 flow [2024-06-14 15:50:18,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-14 15:50:18,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154 [2024-06-14 15:50:18,565 INFO L175 Difference]: Start difference. First operand has 221 places, 202 transitions, 2465 flow. Second operand 9 states and 115 transitions. [2024-06-14 15:50:18,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 222 transitions, 3116 flow [2024-06-14 15:50:18,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 222 transitions, 2934 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 15:50:18,698 INFO L231 Difference]: Finished difference. Result has 222 places, 205 transitions, 2617 flow [2024-06-14 15:50:18,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2290, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2617, PETRI_PLACES=222, PETRI_TRANSITIONS=205} [2024-06-14 15:50:18,699 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 192 predicate places. [2024-06-14 15:50:18,699 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 205 transitions, 2617 flow [2024-06-14 15:50:18,699 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:50:18,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:18,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:18,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 15:50:18,700 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:50:18,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:18,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1189525697, now seen corresponding path program 17 times [2024-06-14 15:50:18,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:18,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381134924] [2024-06-14 15:50:18,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:18,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:24,421 INFO L134 CoverageAnalysis]: 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:24,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:24,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381134924] [2024-06-14 15:50:24,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381134924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:24,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:24,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:24,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40838903] [2024-06-14 15:50:24,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:24,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:24,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:24,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:24,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:24,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:50:24,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 205 transitions, 2617 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:50:24,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:24,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:50:24,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:24,939 INFO L124 PetriNetUnfolderBase]: 584/1078 cut-off events. [2024-06-14 15:50:24,939 INFO L125 PetriNetUnfolderBase]: For 55131/55131 co-relation queries the response was YES. [2024-06-14 15:50:24,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7658 conditions, 1078 events. 584/1078 cut-off events. For 55131/55131 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5714 event pairs, 97 based on Foata normal form. 2/1080 useless extension candidates. Maximal degree in co-relation 7556. Up to 665 conditions per place. [2024-06-14 15:50:24,949 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 117 selfloop transitions, 105 changer transitions 0/224 dead transitions. [2024-06-14 15:50:24,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 224 transitions, 3239 flow [2024-06-14 15:50:24,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 15:50:24,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-14 15:50:24,950 INFO L175 Difference]: Start difference. First operand has 222 places, 205 transitions, 2617 flow. Second operand 9 states and 117 transitions. [2024-06-14 15:50:24,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 224 transitions, 3239 flow [2024-06-14 15:50:25,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 224 transitions, 3086 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:50:25,137 INFO L231 Difference]: Finished difference. Result has 223 places, 206 transitions, 2700 flow [2024-06-14 15:50:25,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2468, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2700, PETRI_PLACES=223, PETRI_TRANSITIONS=206} [2024-06-14 15:50:25,137 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 193 predicate places. [2024-06-14 15:50:25,137 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 206 transitions, 2700 flow [2024-06-14 15:50:25,137 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:50:25,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:25,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:25,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 15:50:25,138 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:50:25,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1189521822, now seen corresponding path program 8 times [2024-06-14 15:50:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:25,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296706460] [2024-06-14 15:50:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:25,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:31,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:31,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296706460] [2024-06-14 15:50:31,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296706460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:31,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:31,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:31,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060982198] [2024-06-14 15:50:31,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:31,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:31,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:31,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:31,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:31,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:50:31,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 206 transitions, 2700 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:50:31,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:31,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:50:31,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:32,063 INFO L124 PetriNetUnfolderBase]: 595/1096 cut-off events. [2024-06-14 15:50:32,063 INFO L125 PetriNetUnfolderBase]: For 54945/54945 co-relation queries the response was YES. [2024-06-14 15:50:32,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7854 conditions, 1096 events. 595/1096 cut-off events. For 54945/54945 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5791 event pairs, 102 based on Foata normal form. 2/1098 useless extension candidates. Maximal degree in co-relation 7753. Up to 702 conditions per place. [2024-06-14 15:50:32,073 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 126 selfloop transitions, 98 changer transitions 0/226 dead transitions. [2024-06-14 15:50:32,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 226 transitions, 3372 flow [2024-06-14 15:50:32,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-14 15:50:32,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154 [2024-06-14 15:50:32,074 INFO L175 Difference]: Start difference. First operand has 223 places, 206 transitions, 2700 flow. Second operand 9 states and 115 transitions. [2024-06-14 15:50:32,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 226 transitions, 3372 flow [2024-06-14 15:50:32,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 226 transitions, 3152 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-14 15:50:32,216 INFO L231 Difference]: Finished difference. Result has 223 places, 210 transitions, 2759 flow [2024-06-14 15:50:32,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2484, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2759, PETRI_PLACES=223, PETRI_TRANSITIONS=210} [2024-06-14 15:50:32,217 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 193 predicate places. [2024-06-14 15:50:32,217 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 210 transitions, 2759 flow [2024-06-14 15:50:32,217 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:50:32,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:32,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:32,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 15:50:32,217 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:50:32,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:32,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1102685862, now seen corresponding path program 9 times [2024-06-14 15:50:32,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:32,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185484975] [2024-06-14 15:50:32,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:32,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:37,257 INFO L134 CoverageAnalysis]: 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:37,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:37,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185484975] [2024-06-14 15:50:37,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185484975] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:37,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:37,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:50:37,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231698683] [2024-06-14 15:50:37,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:37,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:50:37,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:37,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:50:37,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:50:37,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-14 15:50:37,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 210 transitions, 2759 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:37,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:37,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-14 15:50:37,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:37,797 INFO L124 PetriNetUnfolderBase]: 601/1106 cut-off events. [2024-06-14 15:50:37,797 INFO L125 PetriNetUnfolderBase]: For 53423/53423 co-relation queries the response was YES. [2024-06-14 15:50:37,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7920 conditions, 1106 events. 601/1106 cut-off events. For 53423/53423 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5853 event pairs, 108 based on Foata normal form. 2/1108 useless extension candidates. Maximal degree in co-relation 7820. Up to 884 conditions per place. [2024-06-14 15:50:37,812 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 167 selfloop transitions, 58 changer transitions 0/227 dead transitions. [2024-06-14 15:50:37,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 227 transitions, 3305 flow [2024-06-14 15:50:37,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:37,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-14 15:50:37,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43727598566308246 [2024-06-14 15:50:37,813 INFO L175 Difference]: Start difference. First operand has 223 places, 210 transitions, 2759 flow. Second operand 9 states and 122 transitions. [2024-06-14 15:50:37,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 227 transitions, 3305 flow [2024-06-14 15:50:37,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 227 transitions, 3212 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 15:50:37,946 INFO L231 Difference]: Finished difference. Result has 226 places, 212 transitions, 2830 flow [2024-06-14 15:50:37,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2670, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2830, PETRI_PLACES=226, PETRI_TRANSITIONS=212} [2024-06-14 15:50:37,946 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 196 predicate places. [2024-06-14 15:50:37,947 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 212 transitions, 2830 flow [2024-06-14 15:50:37,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:37,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:37,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:37,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 15:50:37,947 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:50:37,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:37,947 INFO L85 PathProgramCache]: Analyzing trace with hash -616991441, now seen corresponding path program 18 times [2024-06-14 15:50:37,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:37,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771206303] [2024-06-14 15:50:37,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:37,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:43,371 INFO L134 CoverageAnalysis]: 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:43,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:43,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771206303] [2024-06-14 15:50:43,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771206303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:43,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:43,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:43,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153658726] [2024-06-14 15:50:43,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:43,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:43,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:43,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:43,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:43,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:50:43,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 212 transitions, 2830 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:50:43,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:43,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:50:43,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:43,974 INFO L124 PetriNetUnfolderBase]: 621/1150 cut-off events. [2024-06-14 15:50:43,975 INFO L125 PetriNetUnfolderBase]: For 67891/67891 co-relation queries the response was YES. [2024-06-14 15:50:43,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8205 conditions, 1150 events. 621/1150 cut-off events. For 67891/67891 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6141 event pairs, 112 based on Foata normal form. 12/1162 useless extension candidates. Maximal degree in co-relation 8104. Up to 886 conditions per place. [2024-06-14 15:50:43,983 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 169 selfloop transitions, 53 changer transitions 8/232 dead transitions. [2024-06-14 15:50:43,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 232 transitions, 3404 flow [2024-06-14 15:50:43,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 15:50:43,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157706093189964 [2024-06-14 15:50:43,984 INFO L175 Difference]: Start difference. First operand has 226 places, 212 transitions, 2830 flow. Second operand 9 states and 116 transitions. [2024-06-14 15:50:43,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 232 transitions, 3404 flow [2024-06-14 15:50:44,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 232 transitions, 3269 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:50:44,125 INFO L231 Difference]: Finished difference. Result has 227 places, 210 transitions, 2784 flow [2024-06-14 15:50:44,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2695, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2784, PETRI_PLACES=227, PETRI_TRANSITIONS=210} [2024-06-14 15:50:44,126 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 197 predicate places. [2024-06-14 15:50:44,126 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 210 transitions, 2784 flow [2024-06-14 15:50:44,126 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:50:44,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:44,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:44,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 15:50:44,127 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:50:44,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:44,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1102830167, now seen corresponding path program 19 times [2024-06-14 15:50:44,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:44,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342388378] [2024-06-14 15:50:44,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:44,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:49,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:49,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342388378] [2024-06-14 15:50:49,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342388378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:49,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:49,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:49,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180234109] [2024-06-14 15:50:49,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:49,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:49,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:49,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:49,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:49,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:50:49,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 210 transitions, 2784 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:50:49,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:49,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:50:49,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:50,288 INFO L124 PetriNetUnfolderBase]: 599/1108 cut-off events. [2024-06-14 15:50:50,288 INFO L125 PetriNetUnfolderBase]: For 53243/53243 co-relation queries the response was YES. [2024-06-14 15:50:50,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7971 conditions, 1108 events. 599/1108 cut-off events. For 53243/53243 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5913 event pairs, 110 based on Foata normal form. 2/1110 useless extension candidates. Maximal degree in co-relation 7870. Up to 882 conditions per place. [2024-06-14 15:50:50,296 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 164 selfloop transitions, 59 changer transitions 0/225 dead transitions. [2024-06-14 15:50:50,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 225 transitions, 3296 flow [2024-06-14 15:50:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 15:50:50,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-14 15:50:50,298 INFO L175 Difference]: Start difference. First operand has 227 places, 210 transitions, 2784 flow. Second operand 9 states and 111 transitions. [2024-06-14 15:50:50,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 225 transitions, 3296 flow [2024-06-14 15:50:50,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 225 transitions, 3182 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:50:50,439 INFO L231 Difference]: Finished difference. Result has 228 places, 211 transitions, 2812 flow [2024-06-14 15:50:50,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2670, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2812, PETRI_PLACES=228, PETRI_TRANSITIONS=211} [2024-06-14 15:50:50,439 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 198 predicate places. [2024-06-14 15:50:50,439 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 211 transitions, 2812 flow [2024-06-14 15:50:50,439 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:50:50,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:50,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:50,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 15:50:50,440 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:50:50,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:50,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1102830012, now seen corresponding path program 10 times [2024-06-14 15:50:50,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:50,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899640766] [2024-06-14 15:50:50,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:50,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:56,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:50:56,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:56,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899640766] [2024-06-14 15:50:56,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899640766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:56,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:56,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:56,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127889167] [2024-06-14 15:50:56,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:56,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:56,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:56,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:56,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:56,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:50:56,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 211 transitions, 2812 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:50:56,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:56,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:50:56,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:56,563 INFO L124 PetriNetUnfolderBase]: 605/1118 cut-off events. [2024-06-14 15:50:56,563 INFO L125 PetriNetUnfolderBase]: For 53465/53465 co-relation queries the response was YES. [2024-06-14 15:50:56,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8049 conditions, 1118 events. 605/1118 cut-off events. For 53465/53465 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5960 event pairs, 110 based on Foata normal form. 2/1120 useless extension candidates. Maximal degree in co-relation 7948. Up to 880 conditions per place. [2024-06-14 15:50:56,573 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 163 selfloop transitions, 63 changer transitions 0/228 dead transitions. [2024-06-14 15:50:56,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 228 transitions, 3360 flow [2024-06-14 15:50:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:50:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:50:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:50:56,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40860215053763443 [2024-06-14 15:50:56,575 INFO L175 Difference]: Start difference. First operand has 228 places, 211 transitions, 2812 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:50:56,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 228 transitions, 3360 flow [2024-06-14 15:50:56,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 228 transitions, 3232 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 15:50:56,711 INFO L231 Difference]: Finished difference. Result has 229 places, 213 transitions, 2858 flow [2024-06-14 15:50:56,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2684, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2858, PETRI_PLACES=229, PETRI_TRANSITIONS=213} [2024-06-14 15:50:56,711 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-14 15:50:56,712 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 213 transitions, 2858 flow [2024-06-14 15:50:56,712 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:50:56,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:56,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:56,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 15:50:56,712 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:50:56,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:56,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1102833887, now seen corresponding path program 20 times [2024-06-14 15:50:56,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:56,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257014272] [2024-06-14 15:50:56,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:56,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:02,529 INFO L134 CoverageAnalysis]: 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:02,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:02,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257014272] [2024-06-14 15:51:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257014272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:02,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:02,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:51:02,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849690035] [2024-06-14 15:51:02,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:02,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:51:02,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:02,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:51:02,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:51:02,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:51:02,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 213 transitions, 2858 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:51:02,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:02,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:51:02,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:03,077 INFO L124 PetriNetUnfolderBase]: 609/1126 cut-off events. [2024-06-14 15:51:03,077 INFO L125 PetriNetUnfolderBase]: For 53591/53591 co-relation queries the response was YES. [2024-06-14 15:51:03,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8106 conditions, 1126 events. 609/1126 cut-off events. For 53591/53591 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6020 event pairs, 109 based on Foata normal form. 2/1128 useless extension candidates. Maximal degree in co-relation 8005. Up to 843 conditions per place. [2024-06-14 15:51:03,087 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 160 selfloop transitions, 68 changer transitions 0/230 dead transitions. [2024-06-14 15:51:03,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 3390 flow [2024-06-14 15:51:03,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:51:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:51:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-14 15:51:03,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050179211469534 [2024-06-14 15:51:03,089 INFO L175 Difference]: Start difference. First operand has 229 places, 213 transitions, 2858 flow. Second operand 9 states and 113 transitions. [2024-06-14 15:51:03,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 3390 flow [2024-06-14 15:51:03,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 230 transitions, 3241 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 15:51:03,235 INFO L231 Difference]: Finished difference. Result has 230 places, 214 transitions, 2871 flow [2024-06-14 15:51:03,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2709, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2871, PETRI_PLACES=230, PETRI_TRANSITIONS=214} [2024-06-14 15:51:03,236 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 200 predicate places. [2024-06-14 15:51:03,236 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 214 transitions, 2871 flow [2024-06-14 15:51:03,236 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:51:03,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:03,236 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:51:03,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 15:51:03,236 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:51:03,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:03,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1794170677, now seen corresponding path program 21 times [2024-06-14 15:51:03,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:03,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354772029] [2024-06-14 15:51:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:03,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:08,934 INFO L134 CoverageAnalysis]: 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:08,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:08,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354772029] [2024-06-14 15:51:08,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354772029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:08,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:51:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059136750] [2024-06-14 15:51:08,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:08,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:51:08,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:08,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:51:08,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:51:09,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:51:09,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 214 transitions, 2871 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:51:09,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:09,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:51:09,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:09,559 INFO L124 PetriNetUnfolderBase]: 613/1134 cut-off events. [2024-06-14 15:51:09,560 INFO L125 PetriNetUnfolderBase]: For 53525/53525 co-relation queries the response was YES. [2024-06-14 15:51:09,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8148 conditions, 1134 events. 613/1134 cut-off events. For 53525/53525 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6067 event pairs, 58 based on Foata normal form. 2/1136 useless extension candidates. Maximal degree in co-relation 8047. Up to 654 conditions per place. [2024-06-14 15:51:09,569 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 146 selfloop transitions, 93 changer transitions 0/241 dead transitions. [2024-06-14 15:51:09,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 241 transitions, 3604 flow [2024-06-14 15:51:09,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:51:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:51:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2024-06-14 15:51:09,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-14 15:51:09,571 INFO L175 Difference]: Start difference. First operand has 230 places, 214 transitions, 2871 flow. Second operand 9 states and 126 transitions. [2024-06-14 15:51:09,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 241 transitions, 3604 flow [2024-06-14 15:51:09,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 241 transitions, 3454 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 15:51:09,696 INFO L231 Difference]: Finished difference. Result has 231 places, 215 transitions, 2935 flow [2024-06-14 15:51:09,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2723, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2935, PETRI_PLACES=231, PETRI_TRANSITIONS=215} [2024-06-14 15:51:09,697 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places. [2024-06-14 15:51:09,697 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 215 transitions, 2935 flow [2024-06-14 15:51:09,697 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:51:09,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:09,697 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:51:09,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 15:51:09,698 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:51:09,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:09,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1823771038, now seen corresponding path program 11 times [2024-06-14 15:51:09,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:09,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314035070] [2024-06-14 15:51:09,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:09,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:15,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:15,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314035070] [2024-06-14 15:51:15,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314035070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:15,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:15,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:51:15,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681866244] [2024-06-14 15:51:15,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:15,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:51:15,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:15,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:51:15,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:51:15,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-14 15:51:15,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 215 transitions, 2935 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:15,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-14 15:51:15,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:15,703 INFO L124 PetriNetUnfolderBase]: 619/1144 cut-off events. [2024-06-14 15:51:15,703 INFO L125 PetriNetUnfolderBase]: For 53584/53584 co-relation queries the response was YES. [2024-06-14 15:51:15,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8306 conditions, 1144 events. 619/1144 cut-off events. For 53584/53584 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6159 event pairs, 91 based on Foata normal form. 2/1146 useless extension candidates. Maximal degree in co-relation 8205. Up to 798 conditions per place. [2024-06-14 15:51:15,713 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 144 selfloop transitions, 94 changer transitions 0/240 dead transitions. [2024-06-14 15:51:15,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 240 transitions, 3654 flow [2024-06-14 15:51:15,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:51:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:51:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2024-06-14 15:51:15,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2024-06-14 15:51:15,714 INFO L175 Difference]: Start difference. First operand has 231 places, 215 transitions, 2935 flow. Second operand 9 states and 132 transitions. [2024-06-14 15:51:15,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 240 transitions, 3654 flow [2024-06-14 15:51:15,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 240 transitions, 3428 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:51:15,851 INFO L231 Difference]: Finished difference. Result has 233 places, 218 transitions, 2983 flow [2024-06-14 15:51:15,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2711, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2983, PETRI_PLACES=233, PETRI_TRANSITIONS=218} [2024-06-14 15:51:15,852 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2024-06-14 15:51:15,852 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 218 transitions, 2983 flow [2024-06-14 15:51:15,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:15,852 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:51:15,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 15:51:15,852 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:51:15,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:15,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1823771193, now seen corresponding path program 22 times [2024-06-14 15:51:15,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:15,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677639263] [2024-06-14 15:51:15,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:15,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:21,527 INFO L134 CoverageAnalysis]: 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:21,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:21,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677639263] [2024-06-14 15:51:21,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677639263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:21,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:21,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:51:21,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362463662] [2024-06-14 15:51:21,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:21,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:51:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:21,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:51:21,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:51:21,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:51:21,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 218 transitions, 2983 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:51:21,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:21,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:51:21,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:22,099 INFO L124 PetriNetUnfolderBase]: 623/1152 cut-off events. [2024-06-14 15:51:22,100 INFO L125 PetriNetUnfolderBase]: For 53598/53598 co-relation queries the response was YES. [2024-06-14 15:51:22,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8379 conditions, 1152 events. 623/1152 cut-off events. For 53598/53598 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6235 event pairs, 92 based on Foata normal form. 2/1154 useless extension candidates. Maximal degree in co-relation 8277. Up to 861 conditions per place. [2024-06-14 15:51:22,110 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 153 selfloop transitions, 84 changer transitions 0/239 dead transitions. [2024-06-14 15:51:22,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 239 transitions, 3556 flow [2024-06-14 15:51:22,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:51:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:51:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-14 15:51:22,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2024-06-14 15:51:22,111 INFO L175 Difference]: Start difference. First operand has 233 places, 218 transitions, 2983 flow. Second operand 9 states and 120 transitions. [2024-06-14 15:51:22,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 239 transitions, 3556 flow [2024-06-14 15:51:22,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 239 transitions, 3454 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-14 15:51:22,256 INFO L231 Difference]: Finished difference. Result has 237 places, 219 transitions, 3077 flow [2024-06-14 15:51:22,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2881, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3077, PETRI_PLACES=237, PETRI_TRANSITIONS=219} [2024-06-14 15:51:22,256 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 207 predicate places. [2024-06-14 15:51:22,257 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 219 transitions, 3077 flow [2024-06-14 15:51:22,257 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:51:22,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:22,257 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:51:22,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 15:51:22,257 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:51:22,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:22,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1794318702, now seen corresponding path program 12 times [2024-06-14 15:51:22,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:22,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672463103] [2024-06-14 15:51:22,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:22,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:27,211 INFO L134 CoverageAnalysis]: 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:27,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:27,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672463103] [2024-06-14 15:51:27,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672463103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:27,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:27,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:51:27,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748556373] [2024-06-14 15:51:27,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:27,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:51:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:27,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:51:27,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:51:27,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-14 15:51:27,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 219 transitions, 3077 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:27,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:27,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-14 15:51:27,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:27,800 INFO L124 PetriNetUnfolderBase]: 629/1164 cut-off events. [2024-06-14 15:51:27,801 INFO L125 PetriNetUnfolderBase]: For 54203/54203 co-relation queries the response was YES. [2024-06-14 15:51:27,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8499 conditions, 1164 events. 629/1164 cut-off events. For 54203/54203 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6330 event pairs, 112 based on Foata normal form. 2/1166 useless extension candidates. Maximal degree in co-relation 8397. Up to 940 conditions per place. [2024-06-14 15:51:27,812 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 180 selfloop transitions, 60 changer transitions 0/242 dead transitions. [2024-06-14 15:51:27,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 242 transitions, 3703 flow [2024-06-14 15:51:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:51:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:51:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2024-06-14 15:51:27,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551971326164875 [2024-06-14 15:51:27,813 INFO L175 Difference]: Start difference. First operand has 237 places, 219 transitions, 3077 flow. Second operand 9 states and 127 transitions. [2024-06-14 15:51:27,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 242 transitions, 3703 flow [2024-06-14 15:51:27,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 242 transitions, 3521 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 15:51:27,950 INFO L231 Difference]: Finished difference. Result has 238 places, 221 transitions, 3069 flow [2024-06-14 15:51:27,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2895, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3069, PETRI_PLACES=238, PETRI_TRANSITIONS=221} [2024-06-14 15:51:27,950 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2024-06-14 15:51:27,950 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 221 transitions, 3069 flow [2024-06-14 15:51:27,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:27,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:27,951 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:51:27,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 15:51:27,951 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:51:27,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1799896408, now seen corresponding path program 2 times [2024-06-14 15:51:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:27,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002297525] [2024-06-14 15:51:27,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:27,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:33,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:33,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002297525] [2024-06-14 15:51:33,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002297525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:33,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:33,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:51:33,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686546724] [2024-06-14 15:51:33,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:33,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:51:33,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:33,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:51:33,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:51:33,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:51:33,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 221 transitions, 3069 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:51:33,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:33,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:51:33,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:33,841 INFO L124 PetriNetUnfolderBase]: 637/1179 cut-off events. [2024-06-14 15:51:33,841 INFO L125 PetriNetUnfolderBase]: For 57620/57620 co-relation queries the response was YES. [2024-06-14 15:51:33,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8503 conditions, 1179 events. 637/1179 cut-off events. For 57620/57620 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6416 event pairs, 113 based on Foata normal form. 4/1183 useless extension candidates. Maximal degree in co-relation 8401. Up to 941 conditions per place. [2024-06-14 15:51:33,851 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 177 selfloop transitions, 59 changer transitions 0/238 dead transitions. [2024-06-14 15:51:33,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 238 transitions, 3630 flow [2024-06-14 15:51:33,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:51:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:51:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 15:51:33,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-14 15:51:33,853 INFO L175 Difference]: Start difference. First operand has 238 places, 221 transitions, 3069 flow. Second operand 9 states and 111 transitions. [2024-06-14 15:51:33,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 238 transitions, 3630 flow [2024-06-14 15:51:33,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 238 transitions, 3481 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 15:51:33,997 INFO L231 Difference]: Finished difference. Result has 240 places, 225 transitions, 3111 flow [2024-06-14 15:51:33,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2922, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3111, PETRI_PLACES=240, PETRI_TRANSITIONS=225} [2024-06-14 15:51:33,997 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 210 predicate places. [2024-06-14 15:51:33,998 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 225 transitions, 3111 flow [2024-06-14 15:51:33,998 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:51:33,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:33,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:33,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 15:51:33,998 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:51:33,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:33,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1332570087, now seen corresponding path program 23 times [2024-06-14 15:51:33,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:33,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257121120] [2024-06-14 15:51:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:33,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:39,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:39,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257121120] [2024-06-14 15:51:39,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257121120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:39,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:39,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:39,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167627315] [2024-06-14 15:51:39,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:39,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:39,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:39,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:39,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:39,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:51:39,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 225 transitions, 3111 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:39,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:39,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:51:39,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:40,320 INFO L124 PetriNetUnfolderBase]: 657/1223 cut-off events. [2024-06-14 15:51:40,320 INFO L125 PetriNetUnfolderBase]: For 69320/69320 co-relation queries the response was YES. [2024-06-14 15:51:40,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8706 conditions, 1223 events. 657/1223 cut-off events. For 69320/69320 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6709 event pairs, 113 based on Foata normal form. 12/1235 useless extension candidates. Maximal degree in co-relation 8603. Up to 958 conditions per place. [2024-06-14 15:51:40,332 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 185 selfloop transitions, 53 changer transitions 8/248 dead transitions. [2024-06-14 15:51:40,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 248 transitions, 3744 flow [2024-06-14 15:51:40,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:51:40,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096774193548387 [2024-06-14 15:51:40,333 INFO L175 Difference]: Start difference. First operand has 240 places, 225 transitions, 3111 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:51:40,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 248 transitions, 3744 flow [2024-06-14 15:51:40,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 248 transitions, 3622 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-14 15:51:40,458 INFO L231 Difference]: Finished difference. Result has 245 places, 223 transitions, 3080 flow [2024-06-14 15:51:40,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2989, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3080, PETRI_PLACES=245, PETRI_TRANSITIONS=223} [2024-06-14 15:51:40,458 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2024-06-14 15:51:40,458 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 223 transitions, 3080 flow [2024-06-14 15:51:40,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:40,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:40,459 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:51:40,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 15:51:40,459 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:51:40,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:40,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1794318547, now seen corresponding path program 24 times [2024-06-14 15:51:40,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:40,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760287456] [2024-06-14 15:51:40,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:40,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:45,558 INFO L134 CoverageAnalysis]: 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:45,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:45,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760287456] [2024-06-14 15:51:45,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760287456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:45,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:45,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:51:45,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925647082] [2024-06-14 15:51:45,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:45,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:51:45,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:45,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:51:45,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:51:45,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:51:45,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 223 transitions, 3080 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:51:45,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:45,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:51:45,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:46,166 INFO L124 PetriNetUnfolderBase]: 651/1216 cut-off events. [2024-06-14 15:51:46,166 INFO L125 PetriNetUnfolderBase]: For 69103/69103 co-relation queries the response was YES. [2024-06-14 15:51:46,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8624 conditions, 1216 events. 651/1216 cut-off events. For 69103/69103 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6671 event pairs, 118 based on Foata normal form. 12/1228 useless extension candidates. Maximal degree in co-relation 8520. Up to 952 conditions per place. [2024-06-14 15:51:46,177 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 184 selfloop transitions, 55 changer transitions 8/249 dead transitions. [2024-06-14 15:51:46,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 249 transitions, 3746 flow [2024-06-14 15:51:46,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:51:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:51:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-14 15:51:46,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4336917562724014 [2024-06-14 15:51:46,178 INFO L175 Difference]: Start difference. First operand has 245 places, 223 transitions, 3080 flow. Second operand 9 states and 121 transitions. [2024-06-14 15:51:46,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 249 transitions, 3746 flow [2024-06-14 15:51:46,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 249 transitions, 3624 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 15:51:46,305 INFO L231 Difference]: Finished difference. Result has 245 places, 221 transitions, 3054 flow [2024-06-14 15:51:46,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2958, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3054, PETRI_PLACES=245, PETRI_TRANSITIONS=221} [2024-06-14 15:51:46,306 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2024-06-14 15:51:46,306 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 221 transitions, 3054 flow [2024-06-14 15:51:46,306 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:51:46,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:46,306 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:51:46,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 15:51:46,306 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:51:46,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1332569932, now seen corresponding path program 13 times [2024-06-14 15:51:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:46,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132311334] [2024-06-14 15:51:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:46,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:51,844 INFO L134 CoverageAnalysis]: 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:51,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:51,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132311334] [2024-06-14 15:51:51,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132311334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:51,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:51,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:51,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401677251] [2024-06-14 15:51:51,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:51,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:51,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:51,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:51,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:52,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:51:52,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 221 transitions, 3054 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:52,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:52,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:51:52,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:52,553 INFO L124 PetriNetUnfolderBase]: 631/1176 cut-off events. [2024-06-14 15:51:52,553 INFO L125 PetriNetUnfolderBase]: For 55114/55114 co-relation queries the response was YES. [2024-06-14 15:51:52,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8450 conditions, 1176 events. 631/1176 cut-off events. For 55114/55114 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6448 event pairs, 206 based on Foata normal form. 2/1178 useless extension candidates. Maximal degree in co-relation 8346. Up to 1039 conditions per place. [2024-06-14 15:51:52,564 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 203 selfloop transitions, 34 changer transitions 0/239 dead transitions. [2024-06-14 15:51:52,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 239 transitions, 3650 flow [2024-06-14 15:51:52,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:51:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:51:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-14 15:51:52,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-14 15:51:52,565 INFO L175 Difference]: Start difference. First operand has 245 places, 221 transitions, 3054 flow. Second operand 11 states and 127 transitions. [2024-06-14 15:51:52,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 239 transitions, 3650 flow [2024-06-14 15:51:52,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 239 transitions, 3520 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:51:52,746 INFO L231 Difference]: Finished difference. Result has 248 places, 223 transitions, 3049 flow [2024-06-14 15:51:52,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2926, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3049, PETRI_PLACES=248, PETRI_TRANSITIONS=223} [2024-06-14 15:51:52,747 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2024-06-14 15:51:52,747 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 223 transitions, 3049 flow [2024-06-14 15:51:52,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:52,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:52,748 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:51:52,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 15:51:52,748 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:51:52,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash 931544772, now seen corresponding path program 3 times [2024-06-14 15:51:52,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:52,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856046690] [2024-06-14 15:51:52,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:52,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:58,742 INFO L134 CoverageAnalysis]: 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:58,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:58,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856046690] [2024-06-14 15:51:58,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856046690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:58,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:58,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:51:58,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947615740] [2024-06-14 15:51:58,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:58,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:51:58,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:58,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:51:58,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:51:58,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-14 15:51:58,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 223 transitions, 3049 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:58,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:58,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-14 15:51:58,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:59,211 INFO L124 PetriNetUnfolderBase]: 635/1185 cut-off events. [2024-06-14 15:51:59,211 INFO L125 PetriNetUnfolderBase]: For 54871/54871 co-relation queries the response was YES. [2024-06-14 15:51:59,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8411 conditions, 1185 events. 635/1185 cut-off events. For 54871/54871 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6492 event pairs, 210 based on Foata normal form. 2/1187 useless extension candidates. Maximal degree in co-relation 8307. Up to 1144 conditions per place. [2024-06-14 15:51:59,222 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 219 selfloop transitions, 13 changer transitions 0/234 dead transitions. [2024-06-14 15:51:59,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 234 transitions, 3551 flow [2024-06-14 15:51:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:51:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:51:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 15:51:59,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951612903225806 [2024-06-14 15:51:59,224 INFO L175 Difference]: Start difference. First operand has 248 places, 223 transitions, 3049 flow. Second operand 8 states and 98 transitions. [2024-06-14 15:51:59,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 234 transitions, 3551 flow [2024-06-14 15:51:59,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 234 transitions, 3460 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-14 15:51:59,344 INFO L231 Difference]: Finished difference. Result has 248 places, 224 transitions, 3006 flow [2024-06-14 15:51:59,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2958, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3006, PETRI_PLACES=248, PETRI_TRANSITIONS=224} [2024-06-14 15:51:59,345 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2024-06-14 15:51:59,345 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 224 transitions, 3006 flow [2024-06-14 15:51:59,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:59,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:59,345 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:51:59,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 15:51:59,345 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:51:59,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash -904682038, now seen corresponding path program 4 times [2024-06-14 15:51:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067621667] [2024-06-14 15:51:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:04,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:04,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067621667] [2024-06-14 15:52:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067621667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:04,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:04,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:04,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719153914] [2024-06-14 15:52:04,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:04,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:04,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:04,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:04,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:04,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:52:04,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 224 transitions, 3006 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:04,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:04,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:52:04,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:04,638 INFO L124 PetriNetUnfolderBase]: 639/1193 cut-off events. [2024-06-14 15:52:04,638 INFO L125 PetriNetUnfolderBase]: For 56499/56499 co-relation queries the response was YES. [2024-06-14 15:52:04,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8401 conditions, 1193 events. 639/1193 cut-off events. For 56499/56499 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6560 event pairs, 210 based on Foata normal form. 2/1195 useless extension candidates. Maximal degree in co-relation 8297. Up to 1149 conditions per place. [2024-06-14 15:52:04,650 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 216 selfloop transitions, 17 changer transitions 0/235 dead transitions. [2024-06-14 15:52:04,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 235 transitions, 3514 flow [2024-06-14 15:52:04,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:52:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:52:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-14 15:52:04,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-14 15:52:04,651 INFO L175 Difference]: Start difference. First operand has 248 places, 224 transitions, 3006 flow. Second operand 9 states and 98 transitions. [2024-06-14 15:52:04,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 235 transitions, 3514 flow [2024-06-14 15:52:04,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 235 transitions, 3476 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:52:04,807 INFO L231 Difference]: Finished difference. Result has 251 places, 225 transitions, 3027 flow [2024-06-14 15:52:04,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3027, PETRI_PLACES=251, PETRI_TRANSITIONS=225} [2024-06-14 15:52:04,807 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 221 predicate places. [2024-06-14 15:52:04,808 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 225 transitions, 3027 flow [2024-06-14 15:52:04,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:04,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:04,808 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:52:04,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 15:52:04,808 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:52:04,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:04,808 INFO L85 PathProgramCache]: Analyzing trace with hash -913886744, now seen corresponding path program 14 times [2024-06-14 15:52:04,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:04,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107671200] [2024-06-14 15:52:04,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:04,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:09,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:09,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107671200] [2024-06-14 15:52:09,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107671200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:09,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:09,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:09,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654888037] [2024-06-14 15:52:09,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:09,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:09,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:09,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:09,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:09,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:52:09,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 225 transitions, 3027 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:09,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:09,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:52:09,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:10,316 INFO L124 PetriNetUnfolderBase]: 633/1184 cut-off events. [2024-06-14 15:52:10,316 INFO L125 PetriNetUnfolderBase]: For 54915/54915 co-relation queries the response was YES. [2024-06-14 15:52:10,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8201 conditions, 1184 events. 633/1184 cut-off events. For 54915/54915 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6501 event pairs, 209 based on Foata normal form. 3/1187 useless extension candidates. Maximal degree in co-relation 8095. Up to 1126 conditions per place. [2024-06-14 15:52:10,325 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 211 selfloop transitions, 25 changer transitions 0/238 dead transitions. [2024-06-14 15:52:10,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 238 transitions, 3565 flow [2024-06-14 15:52:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 15:52:10,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-14 15:52:10,326 INFO L175 Difference]: Start difference. First operand has 251 places, 225 transitions, 3027 flow. Second operand 10 states and 109 transitions. [2024-06-14 15:52:10,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 238 transitions, 3565 flow [2024-06-14 15:52:10,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 238 transitions, 3508 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 15:52:10,455 INFO L231 Difference]: Finished difference. Result has 254 places, 227 transitions, 3069 flow [2024-06-14 15:52:10,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2970, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3069, PETRI_PLACES=254, PETRI_TRANSITIONS=227} [2024-06-14 15:52:10,456 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 224 predicate places. [2024-06-14 15:52:10,456 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 227 transitions, 3069 flow [2024-06-14 15:52:10,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:10,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:10,456 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:52:10,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 15:52:10,457 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:52:10,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:10,457 INFO L85 PathProgramCache]: Analyzing trace with hash 598689134, now seen corresponding path program 5 times [2024-06-14 15:52:10,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:10,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244792443] [2024-06-14 15:52:10,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:10,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:16,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:16,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244792443] [2024-06-14 15:52:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244792443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:16,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:16,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094332248] [2024-06-14 15:52:16,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:16,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:16,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:16,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:52:16,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 227 transitions, 3069 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:16,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:16,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:52:16,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:17,053 INFO L124 PetriNetUnfolderBase]: 637/1192 cut-off events. [2024-06-14 15:52:17,053 INFO L125 PetriNetUnfolderBase]: For 55110/55110 co-relation queries the response was YES. [2024-06-14 15:52:17,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8292 conditions, 1192 events. 637/1192 cut-off events. For 55110/55110 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6560 event pairs, 201 based on Foata normal form. 2/1194 useless extension candidates. Maximal degree in co-relation 8185. Up to 1135 conditions per place. [2024-06-14 15:52:17,064 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 221 selfloop transitions, 20 changer transitions 0/243 dead transitions. [2024-06-14 15:52:17,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 243 transitions, 3644 flow [2024-06-14 15:52:17,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:52:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:52:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-14 15:52:17,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-14 15:52:17,066 INFO L175 Difference]: Start difference. First operand has 254 places, 227 transitions, 3069 flow. Second operand 9 states and 102 transitions. [2024-06-14 15:52:17,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 243 transitions, 3644 flow [2024-06-14 15:52:17,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 243 transitions, 3505 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-14 15:52:17,230 INFO L231 Difference]: Finished difference. Result has 255 places, 230 transitions, 3024 flow [2024-06-14 15:52:17,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2930, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3024, PETRI_PLACES=255, PETRI_TRANSITIONS=230} [2024-06-14 15:52:17,231 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places. [2024-06-14 15:52:17,231 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 230 transitions, 3024 flow [2024-06-14 15:52:17,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:17,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:17,231 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:52:17,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 15:52:17,232 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:52:17,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:17,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1170379318, now seen corresponding path program 6 times [2024-06-14 15:52:17,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:17,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118876762] [2024-06-14 15:52:17,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:17,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:22,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:22,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118876762] [2024-06-14 15:52:22,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118876762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:22,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:22,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:22,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193263892] [2024-06-14 15:52:22,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:22,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:22,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:22,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:22,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:22,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:52:22,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 230 transitions, 3024 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:22,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:22,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:52:22,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:23,427 INFO L124 PetriNetUnfolderBase]: 634/1187 cut-off events. [2024-06-14 15:52:23,428 INFO L125 PetriNetUnfolderBase]: For 53023/53023 co-relation queries the response was YES. [2024-06-14 15:52:23,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8059 conditions, 1187 events. 634/1187 cut-off events. For 53023/53023 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6547 event pairs, 202 based on Foata normal form. 2/1189 useless extension candidates. Maximal degree in co-relation 7951. Up to 1142 conditions per place. [2024-06-14 15:52:23,441 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 224 selfloop transitions, 17 changer transitions 0/243 dead transitions. [2024-06-14 15:52:23,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 243 transitions, 3563 flow [2024-06-14 15:52:23,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:52:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:52:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-14 15:52:23,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35842293906810035 [2024-06-14 15:52:23,442 INFO L175 Difference]: Start difference. First operand has 255 places, 230 transitions, 3024 flow. Second operand 9 states and 100 transitions. [2024-06-14 15:52:23,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 243 transitions, 3563 flow [2024-06-14 15:52:23,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 243 transitions, 3436 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 15:52:23,592 INFO L231 Difference]: Finished difference. Result has 258 places, 232 transitions, 2970 flow [2024-06-14 15:52:23,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2899, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2970, PETRI_PLACES=258, PETRI_TRANSITIONS=232} [2024-06-14 15:52:23,593 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 228 predicate places. [2024-06-14 15:52:23,593 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 232 transitions, 2970 flow [2024-06-14 15:52:23,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:23,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:23,593 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:52:23,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 15:52:23,593 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:52:23,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:23,593 INFO L85 PathProgramCache]: Analyzing trace with hash -637990773, now seen corresponding path program 25 times [2024-06-14 15:52:23,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:23,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035331082] [2024-06-14 15:52:23,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:23,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:29,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:29,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035331082] [2024-06-14 15:52:29,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035331082] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:29,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:29,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:29,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301710110] [2024-06-14 15:52:29,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:29,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:29,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:29,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:29,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:29,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:52:29,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 232 transitions, 2970 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:29,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:29,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:52:29,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:29,757 INFO L124 PetriNetUnfolderBase]: 670/1266 cut-off events. [2024-06-14 15:52:29,757 INFO L125 PetriNetUnfolderBase]: For 88214/88214 co-relation queries the response was YES. [2024-06-14 15:52:29,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8349 conditions, 1266 events. 670/1266 cut-off events. For 88214/88214 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7073 event pairs, 206 based on Foata normal form. 22/1288 useless extension candidates. Maximal degree in co-relation 8240. Up to 1098 conditions per place. [2024-06-14 15:52:29,768 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 217 selfloop transitions, 21 changer transitions 12/252 dead transitions. [2024-06-14 15:52:29,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 252 transitions, 3602 flow [2024-06-14 15:52:29,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:29,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-14 15:52:29,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-14 15:52:29,769 INFO L175 Difference]: Start difference. First operand has 258 places, 232 transitions, 2970 flow. Second operand 10 states and 116 transitions. [2024-06-14 15:52:29,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 252 transitions, 3602 flow [2024-06-14 15:52:29,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 252 transitions, 3509 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-14 15:52:29,919 INFO L231 Difference]: Finished difference. Result has 260 places, 226 transitions, 2867 flow [2024-06-14 15:52:29,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2877, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2867, PETRI_PLACES=260, PETRI_TRANSITIONS=226} [2024-06-14 15:52:29,920 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 230 predicate places. [2024-06-14 15:52:29,920 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 226 transitions, 2867 flow [2024-06-14 15:52:29,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:29,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:29,920 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:52:29,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 15:52:29,920 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:52:29,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:29,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1170594644, now seen corresponding path program 15 times [2024-06-14 15:52:29,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:29,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752093707] [2024-06-14 15:52:29,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:29,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:34,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:34,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752093707] [2024-06-14 15:52:34,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752093707] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:34,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:34,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:52:34,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610642257] [2024-06-14 15:52:34,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:34,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:52:34,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:34,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:52:34,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:52:35,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-14 15:52:35,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 226 transitions, 2867 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:35,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:35,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-14 15:52:35,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:35,654 INFO L124 PetriNetUnfolderBase]: 624/1176 cut-off events. [2024-06-14 15:52:35,654 INFO L125 PetriNetUnfolderBase]: For 55365/55365 co-relation queries the response was YES. [2024-06-14 15:52:35,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7946 conditions, 1176 events. 624/1176 cut-off events. For 55365/55365 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6517 event pairs, 200 based on Foata normal form. 2/1178 useless extension candidates. Maximal degree in co-relation 7837. Up to 1125 conditions per place. [2024-06-14 15:52:35,665 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 221 selfloop transitions, 18 changer transitions 0/241 dead transitions. [2024-06-14 15:52:35,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 241 transitions, 3451 flow [2024-06-14 15:52:35,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 15:52:35,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-14 15:52:35,666 INFO L175 Difference]: Start difference. First operand has 260 places, 226 transitions, 2867 flow. Second operand 10 states and 120 transitions. [2024-06-14 15:52:35,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 241 transitions, 3451 flow [2024-06-14 15:52:35,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 241 transitions, 3218 flow, removed 13 selfloop flow, removed 11 redundant places. [2024-06-14 15:52:35,821 INFO L231 Difference]: Finished difference. Result has 259 places, 228 transitions, 2729 flow [2024-06-14 15:52:35,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2636, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2729, PETRI_PLACES=259, PETRI_TRANSITIONS=228} [2024-06-14 15:52:35,821 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places. [2024-06-14 15:52:35,821 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 228 transitions, 2729 flow [2024-06-14 15:52:35,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:35,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:35,821 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:52:35,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 15:52:35,822 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:52:35,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:35,822 INFO L85 PathProgramCache]: Analyzing trace with hash 354404298, now seen corresponding path program 16 times [2024-06-14 15:52:35,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:35,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036630480] [2024-06-14 15:52:35,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:35,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:41,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:41,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036630480] [2024-06-14 15:52:41,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036630480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:41,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:41,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:52:41,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55937450] [2024-06-14 15:52:41,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:41,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:52:41,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:41,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:52:41,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:52:41,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-14 15:52:41,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 228 transitions, 2729 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:41,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:41,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-14 15:52:41,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:41,974 INFO L124 PetriNetUnfolderBase]: 620/1170 cut-off events. [2024-06-14 15:52:41,974 INFO L125 PetriNetUnfolderBase]: For 52341/52341 co-relation queries the response was YES. [2024-06-14 15:52:41,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7641 conditions, 1170 events. 620/1170 cut-off events. For 52341/52341 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6464 event pairs, 193 based on Foata normal form. 2/1172 useless extension candidates. Maximal degree in co-relation 7531. Up to 1099 conditions per place. [2024-06-14 15:52:41,985 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 216 selfloop transitions, 25 changer transitions 0/243 dead transitions. [2024-06-14 15:52:41,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 243 transitions, 3279 flow [2024-06-14 15:52:41,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 15:52:41,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-14 15:52:41,986 INFO L175 Difference]: Start difference. First operand has 259 places, 228 transitions, 2729 flow. Second operand 10 states and 126 transitions. [2024-06-14 15:52:41,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 243 transitions, 3279 flow [2024-06-14 15:52:42,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 243 transitions, 3184 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-14 15:52:42,108 INFO L231 Difference]: Finished difference. Result has 261 places, 228 transitions, 2689 flow [2024-06-14 15:52:42,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2634, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2689, PETRI_PLACES=261, PETRI_TRANSITIONS=228} [2024-06-14 15:52:42,109 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 231 predicate places. [2024-06-14 15:52:42,109 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 228 transitions, 2689 flow [2024-06-14 15:52:42,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:42,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:42,109 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:52:42,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 15:52:42,109 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:52:42,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:42,110 INFO L85 PathProgramCache]: Analyzing trace with hash 354404143, now seen corresponding path program 26 times [2024-06-14 15:52:42,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:42,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847448064] [2024-06-14 15:52:42,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:42,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:47,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:47,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847448064] [2024-06-14 15:52:47,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847448064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:47,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:47,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:47,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300726270] [2024-06-14 15:52:47,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:47,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:47,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:47,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:47,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:47,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:52:47,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 228 transitions, 2689 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:47,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:47,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:52:47,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:48,298 INFO L124 PetriNetUnfolderBase]: 604/1142 cut-off events. [2024-06-14 15:52:48,298 INFO L125 PetriNetUnfolderBase]: For 49357/49357 co-relation queries the response was YES. [2024-06-14 15:52:48,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6730 conditions, 1142 events. 604/1142 cut-off events. For 49357/49357 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6356 event pairs, 179 based on Foata normal form. 12/1154 useless extension candidates. Maximal degree in co-relation 6619. Up to 1029 conditions per place. [2024-06-14 15:52:48,308 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 216 selfloop transitions, 21 changer transitions 8/247 dead transitions. [2024-06-14 15:52:48,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 247 transitions, 3283 flow [2024-06-14 15:52:48,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:52:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:52:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-14 15:52:48,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-14 15:52:48,309 INFO L175 Difference]: Start difference. First operand has 261 places, 228 transitions, 2689 flow. Second operand 10 states and 119 transitions. [2024-06-14 15:52:48,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 247 transitions, 3283 flow [2024-06-14 15:52:48,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 247 transitions, 3106 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-06-14 15:52:48,390 INFO L231 Difference]: Finished difference. Result has 261 places, 225 transitions, 2532 flow [2024-06-14 15:52:48,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2512, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2532, PETRI_PLACES=261, PETRI_TRANSITIONS=225} [2024-06-14 15:52:48,391 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 231 predicate places. [2024-06-14 15:52:48,391 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 225 transitions, 2532 flow [2024-06-14 15:52:48,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:48,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:48,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:48,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 15:52:48,392 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:52:48,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1839162242, now seen corresponding path program 1 times [2024-06-14 15:52:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:48,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104979908] [2024-06-14 15:52:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:54,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:54,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104979908] [2024-06-14 15:52:54,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104979908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:54,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:54,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:52:54,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668496779] [2024-06-14 15:52:54,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:54,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:52:54,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:54,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:52:54,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:52:54,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:52:54,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 225 transitions, 2532 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:52:54,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:54,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:52:54,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:55,137 INFO L124 PetriNetUnfolderBase]: 619/1179 cut-off events. [2024-06-14 15:52:55,137 INFO L125 PetriNetUnfolderBase]: For 61800/61800 co-relation queries the response was YES. [2024-06-14 15:52:55,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7285 conditions, 1179 events. 619/1179 cut-off events. For 61800/61800 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6619 event pairs, 122 based on Foata normal form. 8/1187 useless extension candidates. Maximal degree in co-relation 7174. Up to 610 conditions per place. [2024-06-14 15:52:55,146 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 182 selfloop transitions, 56 changer transitions 15/255 dead transitions. [2024-06-14 15:52:55,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 255 transitions, 3300 flow [2024-06-14 15:52:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:52:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:52:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-14 15:52:55,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281524926686217 [2024-06-14 15:52:55,147 INFO L175 Difference]: Start difference. First operand has 261 places, 225 transitions, 2532 flow. Second operand 11 states and 146 transitions. [2024-06-14 15:52:55,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 255 transitions, 3300 flow [2024-06-14 15:52:55,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 255 transitions, 3170 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-14 15:52:55,292 INFO L231 Difference]: Finished difference. Result has 262 places, 220 transitions, 2456 flow [2024-06-14 15:52:55,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2404, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2456, PETRI_PLACES=262, PETRI_TRANSITIONS=220} [2024-06-14 15:52:55,293 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 232 predicate places. [2024-06-14 15:52:55,293 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 220 transitions, 2456 flow [2024-06-14 15:52:55,293 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:52:55,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:55,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:55,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 15:52:55,293 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:52:55,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1744086420, now seen corresponding path program 2 times [2024-06-14 15:52:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:55,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583376037] [2024-06-14 15:52:55,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:55,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:01,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:01,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583376037] [2024-06-14 15:53:01,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583376037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:01,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:01,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:01,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491958627] [2024-06-14 15:53:01,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:01,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:01,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:01,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:01,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:53:01,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 220 transitions, 2456 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:53:01,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:01,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:53:01,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:01,854 INFO L124 PetriNetUnfolderBase]: 628/1204 cut-off events. [2024-06-14 15:53:01,854 INFO L125 PetriNetUnfolderBase]: For 81432/81432 co-relation queries the response was YES. [2024-06-14 15:53:01,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7871 conditions, 1204 events. 628/1204 cut-off events. For 81432/81432 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6813 event pairs, 136 based on Foata normal form. 8/1212 useless extension candidates. Maximal degree in co-relation 7760. Up to 830 conditions per place. [2024-06-14 15:53:01,865 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 184 selfloop transitions, 55 changer transitions 7/248 dead transitions. [2024-06-14 15:53:01,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 248 transitions, 3208 flow [2024-06-14 15:53:01,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-14 15:53:01,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222873900293255 [2024-06-14 15:53:01,867 INFO L175 Difference]: Start difference. First operand has 262 places, 220 transitions, 2456 flow. Second operand 11 states and 144 transitions. [2024-06-14 15:53:01,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 248 transitions, 3208 flow [2024-06-14 15:53:02,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 248 transitions, 3101 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 15:53:02,015 INFO L231 Difference]: Finished difference. Result has 260 places, 218 transitions, 2440 flow [2024-06-14 15:53:02,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2351, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2440, PETRI_PLACES=260, PETRI_TRANSITIONS=218} [2024-06-14 15:53:02,015 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 230 predicate places. [2024-06-14 15:53:02,015 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 218 transitions, 2440 flow [2024-06-14 15:53:02,016 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:53:02,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:02,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:02,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 15:53:02,016 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:53:02,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:02,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1744201740, now seen corresponding path program 3 times [2024-06-14 15:53:02,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:02,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621247055] [2024-06-14 15:53:02,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:02,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:07,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:53:07,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:07,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621247055] [2024-06-14 15:53:07,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621247055] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:07,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:07,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:07,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543277523] [2024-06-14 15:53:07,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:07,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:07,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:07,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:07,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:07,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:53:07,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 218 transitions, 2440 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:53:07,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:07,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:53:07,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:08,369 INFO L124 PetriNetUnfolderBase]: 622/1194 cut-off events. [2024-06-14 15:53:08,370 INFO L125 PetriNetUnfolderBase]: For 81332/81332 co-relation queries the response was YES. [2024-06-14 15:53:08,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7853 conditions, 1194 events. 622/1194 cut-off events. For 81332/81332 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6760 event pairs, 134 based on Foata normal form. 8/1202 useless extension candidates. Maximal degree in co-relation 7743. Up to 812 conditions per place. [2024-06-14 15:53:08,381 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 182 selfloop transitions, 53 changer transitions 10/247 dead transitions. [2024-06-14 15:53:08,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 247 transitions, 3192 flow [2024-06-14 15:53:08,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:53:08,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736 [2024-06-14 15:53:08,382 INFO L175 Difference]: Start difference. First operand has 260 places, 218 transitions, 2440 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:53:08,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 247 transitions, 3192 flow [2024-06-14 15:53:08,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 247 transitions, 3078 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:08,560 INFO L231 Difference]: Finished difference. Result has 260 places, 215 transitions, 2396 flow [2024-06-14 15:53:08,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2328, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2396, PETRI_PLACES=260, PETRI_TRANSITIONS=215} [2024-06-14 15:53:08,561 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 230 predicate places. [2024-06-14 15:53:08,561 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 215 transitions, 2396 flow [2024-06-14 15:53:08,561 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:53:08,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:08,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:08,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 15:53:08,561 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:53:08,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:08,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1744081770, now seen corresponding path program 4 times [2024-06-14 15:53:08,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:08,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438744230] [2024-06-14 15:53:08,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:08,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:14,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:14,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438744230] [2024-06-14 15:53:14,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438744230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:14,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:14,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:14,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899696535] [2024-06-14 15:53:14,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:14,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:14,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:14,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:14,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:14,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:53:14,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 215 transitions, 2396 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:53:14,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:14,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:53:14,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:14,621 INFO L124 PetriNetUnfolderBase]: 587/1125 cut-off events. [2024-06-14 15:53:14,622 INFO L125 PetriNetUnfolderBase]: For 65696/65696 co-relation queries the response was YES. [2024-06-14 15:53:14,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6953 conditions, 1125 events. 587/1125 cut-off events. For 65696/65696 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6291 event pairs, 120 based on Foata normal form. 10/1135 useless extension candidates. Maximal degree in co-relation 6843. Up to 795 conditions per place. [2024-06-14 15:53:14,633 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 167 selfloop transitions, 51 changer transitions 18/238 dead transitions. [2024-06-14 15:53:14,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 238 transitions, 2970 flow [2024-06-14 15:53:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:53:14,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2024-06-14 15:53:14,634 INFO L175 Difference]: Start difference. First operand has 260 places, 215 transitions, 2396 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:53:14,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 238 transitions, 2970 flow [2024-06-14 15:53:14,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 238 transitions, 2860 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 15:53:14,758 INFO L231 Difference]: Finished difference. Result has 259 places, 208 transitions, 2302 flow [2024-06-14 15:53:14,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2286, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2302, PETRI_PLACES=259, PETRI_TRANSITIONS=208} [2024-06-14 15:53:14,758 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places. [2024-06-14 15:53:14,758 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 208 transitions, 2302 flow [2024-06-14 15:53:14,758 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:53:14,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:14,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:14,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 15:53:14,759 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:53:14,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:14,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1678740864, now seen corresponding path program 5 times [2024-06-14 15:53:14,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:14,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384328498] [2024-06-14 15:53:14,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:14,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:20,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:20,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384328498] [2024-06-14 15:53:20,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384328498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:20,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:20,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:20,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714117143] [2024-06-14 15:53:20,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:20,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:20,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:20,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:20,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:20,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:53:20,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 208 transitions, 2302 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:53:20,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:20,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:53:20,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:21,118 INFO L124 PetriNetUnfolderBase]: 573/1100 cut-off events. [2024-06-14 15:53:21,119 INFO L125 PetriNetUnfolderBase]: For 65593/65593 co-relation queries the response was YES. [2024-06-14 15:53:21,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6775 conditions, 1100 events. 573/1100 cut-off events. For 65593/65593 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6143 event pairs, 118 based on Foata normal form. 10/1110 useless extension candidates. Maximal degree in co-relation 6665. Up to 836 conditions per place. [2024-06-14 15:53:21,128 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 175 selfloop transitions, 42 changer transitions 11/230 dead transitions. [2024-06-14 15:53:21,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 230 transitions, 2856 flow [2024-06-14 15:53:21,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-14 15:53:21,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507 [2024-06-14 15:53:21,130 INFO L175 Difference]: Start difference. First operand has 259 places, 208 transitions, 2302 flow. Second operand 11 states and 139 transitions. [2024-06-14 15:53:21,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 230 transitions, 2856 flow [2024-06-14 15:53:21,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 230 transitions, 2717 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-14 15:53:21,252 INFO L231 Difference]: Finished difference. Result has 251 places, 205 transitions, 2220 flow [2024-06-14 15:53:21,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2220, PETRI_PLACES=251, PETRI_TRANSITIONS=205} [2024-06-14 15:53:21,253 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 221 predicate places. [2024-06-14 15:53:21,253 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 205 transitions, 2220 flow [2024-06-14 15:53:21,253 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:53:21,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:21,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:21,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 15:53:21,254 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:53:21,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:21,254 INFO L85 PathProgramCache]: Analyzing trace with hash 947828340, now seen corresponding path program 6 times [2024-06-14 15:53:21,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:21,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355651613] [2024-06-14 15:53:21,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:21,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:26,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:26,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355651613] [2024-06-14 15:53:26,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355651613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:26,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:26,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:26,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154489786] [2024-06-14 15:53:26,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:26,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:26,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:26,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:26,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:26,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:53:26,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 205 transitions, 2220 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:53:26,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:26,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:53:26,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:27,172 INFO L124 PetriNetUnfolderBase]: 561/1080 cut-off events. [2024-06-14 15:53:27,172 INFO L125 PetriNetUnfolderBase]: For 61429/61429 co-relation queries the response was YES. [2024-06-14 15:53:27,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6578 conditions, 1080 events. 561/1080 cut-off events. For 61429/61429 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6024 event pairs, 114 based on Foata normal form. 8/1088 useless extension candidates. Maximal degree in co-relation 6471. Up to 826 conditions per place. [2024-06-14 15:53:27,182 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 173 selfloop transitions, 40 changer transitions 11/226 dead transitions. [2024-06-14 15:53:27,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 226 transitions, 2750 flow [2024-06-14 15:53:27,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 15:53:27,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-14 15:53:27,183 INFO L175 Difference]: Start difference. First operand has 251 places, 205 transitions, 2220 flow. Second operand 11 states and 136 transitions. [2024-06-14 15:53:27,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 226 transitions, 2750 flow [2024-06-14 15:53:27,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 226 transitions, 2660 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:27,285 INFO L231 Difference]: Finished difference. Result has 250 places, 202 transitions, 2171 flow [2024-06-14 15:53:27,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2171, PETRI_PLACES=250, PETRI_TRANSITIONS=202} [2024-06-14 15:53:27,286 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 220 predicate places. [2024-06-14 15:53:27,286 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 202 transitions, 2171 flow [2024-06-14 15:53:27,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:53:27,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:27,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:53:27,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 15:53:27,286 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:53:27,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash -117533720, now seen corresponding path program 7 times [2024-06-14 15:53:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965939334] [2024-06-14 15:53:27,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:33,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:33,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965939334] [2024-06-14 15:53:33,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965939334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:33,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:33,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:33,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462762404] [2024-06-14 15:53:33,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:33,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:33,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:33,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:33,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:33,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:53:33,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 202 transitions, 2171 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:53:33,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:33,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:53:33,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:33,884 INFO L124 PetriNetUnfolderBase]: 583/1126 cut-off events. [2024-06-14 15:53:33,884 INFO L125 PetriNetUnfolderBase]: For 80994/80994 co-relation queries the response was YES. [2024-06-14 15:53:33,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7338 conditions, 1126 events. 583/1126 cut-off events. For 80994/80994 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6288 event pairs, 124 based on Foata normal form. 8/1134 useless extension candidates. Maximal degree in co-relation 7231. Up to 797 conditions per place. [2024-06-14 15:53:33,894 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 179 selfloop transitions, 39 changer transitions 10/230 dead transitions. [2024-06-14 15:53:33,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 230 transitions, 2885 flow [2024-06-14 15:53:33,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:53:33,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736 [2024-06-14 15:53:33,895 INFO L175 Difference]: Start difference. First operand has 250 places, 202 transitions, 2171 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:53:33,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 230 transitions, 2885 flow [2024-06-14 15:53:34,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 230 transitions, 2795 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:53:34,050 INFO L231 Difference]: Finished difference. Result has 248 places, 199 transitions, 2122 flow [2024-06-14 15:53:34,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2083, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2122, PETRI_PLACES=248, PETRI_TRANSITIONS=199} [2024-06-14 15:53:34,050 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2024-06-14 15:53:34,050 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 199 transitions, 2122 flow [2024-06-14 15:53:34,051 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:53:34,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:34,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:34,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 15:53:34,051 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:53:34,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash -117413750, now seen corresponding path program 8 times [2024-06-14 15:53:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:34,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079804908] [2024-06-14 15:53:34,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:34,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:39,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:53:39,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:39,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079804908] [2024-06-14 15:53:39,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079804908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:39,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:39,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:39,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640058189] [2024-06-14 15:53:39,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:39,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:39,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:39,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:39,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:40,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:53:40,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 199 transitions, 2122 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:53:40,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:40,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:53:40,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:40,671 INFO L124 PetriNetUnfolderBase]: 570/1103 cut-off events. [2024-06-14 15:53:40,671 INFO L125 PetriNetUnfolderBase]: For 80934/80934 co-relation queries the response was YES. [2024-06-14 15:53:40,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7090 conditions, 1103 events. 570/1103 cut-off events. For 80934/80934 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6144 event pairs, 133 based on Foata normal form. 10/1113 useless extension candidates. Maximal degree in co-relation 6983. Up to 853 conditions per place. [2024-06-14 15:53:40,681 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 170 selfloop transitions, 38 changer transitions 11/221 dead transitions. [2024-06-14 15:53:40,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 221 transitions, 2658 flow [2024-06-14 15:53:40,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-14 15:53:40,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40175953079178883 [2024-06-14 15:53:40,682 INFO L175 Difference]: Start difference. First operand has 248 places, 199 transitions, 2122 flow. Second operand 11 states and 137 transitions. [2024-06-14 15:53:40,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 221 transitions, 2658 flow [2024-06-14 15:53:40,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 221 transitions, 2556 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:53:40,808 INFO L231 Difference]: Finished difference. Result has 245 places, 196 transitions, 2067 flow [2024-06-14 15:53:40,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2020, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2067, PETRI_PLACES=245, PETRI_TRANSITIONS=196} [2024-06-14 15:53:40,809 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2024-06-14 15:53:40,809 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 196 transitions, 2067 flow [2024-06-14 15:53:40,809 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:53:40,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:40,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:40,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-14 15:53:40,809 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:53:40,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:40,809 INFO L85 PathProgramCache]: Analyzing trace with hash -117418400, now seen corresponding path program 9 times [2024-06-14 15:53:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:40,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448135329] [2024-06-14 15:53:40,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:40,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:45,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448135329] [2024-06-14 15:53:45,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448135329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:45,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:45,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:45,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550820106] [2024-06-14 15:53:45,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:45,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:45,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:45,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:45,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:46,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:53:46,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 196 transitions, 2067 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:53:46,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:46,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:53:46,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:46,689 INFO L124 PetriNetUnfolderBase]: 536/1037 cut-off events. [2024-06-14 15:53:46,689 INFO L125 PetriNetUnfolderBase]: For 61263/61263 co-relation queries the response was YES. [2024-06-14 15:53:46,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6271 conditions, 1037 events. 536/1037 cut-off events. For 61263/61263 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5726 event pairs, 111 based on Foata normal form. 8/1045 useless extension candidates. Maximal degree in co-relation 6165. Up to 797 conditions per place. [2024-06-14 15:53:46,698 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 167 selfloop transitions, 35 changer transitions 13/217 dead transitions. [2024-06-14 15:53:46,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 217 transitions, 2579 flow [2024-06-14 15:53:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 15:53:46,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-14 15:53:46,699 INFO L175 Difference]: Start difference. First operand has 245 places, 196 transitions, 2067 flow. Second operand 11 states and 134 transitions. [2024-06-14 15:53:46,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 217 transitions, 2579 flow [2024-06-14 15:53:46,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 217 transitions, 2497 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:46,847 INFO L231 Difference]: Finished difference. Result has 244 places, 192 transitions, 2005 flow [2024-06-14 15:53:46,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1985, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2005, PETRI_PLACES=244, PETRI_TRANSITIONS=192} [2024-06-14 15:53:46,847 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2024-06-14 15:53:46,848 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 192 transitions, 2005 flow [2024-06-14 15:53:46,848 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:53:46,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:46,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:46,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-14 15:53:46,848 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:53:46,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:46,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1311928148, now seen corresponding path program 10 times [2024-06-14 15:53:46,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:46,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324542039] [2024-06-14 15:53:46,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:52,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:52,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324542039] [2024-06-14 15:53:52,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324542039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:52,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:52,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:52,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695372295] [2024-06-14 15:53:52,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:52,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:52,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:52,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:52,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:53:52,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:53:52,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 192 transitions, 2005 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:53:52,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:52,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:53:52,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:53,432 INFO L124 PetriNetUnfolderBase]: 528/1021 cut-off events. [2024-06-14 15:53:53,433 INFO L125 PetriNetUnfolderBase]: For 61161/61161 co-relation queries the response was YES. [2024-06-14 15:53:53,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6169 conditions, 1021 events. 528/1021 cut-off events. For 61161/61161 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5579 event pairs, 64 based on Foata normal form. 8/1029 useless extension candidates. Maximal degree in co-relation 6063. Up to 579 conditions per place. [2024-06-14 15:53:53,441 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 123 selfloop transitions, 73 changer transitions 17/215 dead transitions. [2024-06-14 15:53:53,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 215 transitions, 2507 flow [2024-06-14 15:53:53,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:53,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-14 15:53:53,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-14 15:53:53,442 INFO L175 Difference]: Start difference. First operand has 244 places, 192 transitions, 2005 flow. Second operand 11 states and 129 transitions. [2024-06-14 15:53:53,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 215 transitions, 2507 flow [2024-06-14 15:53:53,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 215 transitions, 2418 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:53,567 INFO L231 Difference]: Finished difference. Result has 238 places, 188 transitions, 2036 flow [2024-06-14 15:53:53,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2036, PETRI_PLACES=238, PETRI_TRANSITIONS=188} [2024-06-14 15:53:53,568 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2024-06-14 15:53:53,568 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 188 transitions, 2036 flow [2024-06-14 15:53:53,568 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:53:53,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:53,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:53,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-14 15:53:53,568 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:53:53,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:53,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1956000312, now seen corresponding path program 11 times [2024-06-14 15:53:53,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:53,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597357182] [2024-06-14 15:53:53,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:53,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:59,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:59,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597357182] [2024-06-14 15:53:59,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597357182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:59,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:59,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:53:59,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939283685] [2024-06-14 15:53:59,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:59,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:53:59,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:59,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:53:59,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:00,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:54:00,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 188 transitions, 2036 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:54:00,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:00,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:54:00,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:00,626 INFO L124 PetriNetUnfolderBase]: 542/1049 cut-off events. [2024-06-14 15:54:00,627 INFO L125 PetriNetUnfolderBase]: For 78323/78323 co-relation queries the response was YES. [2024-06-14 15:54:00,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6994 conditions, 1049 events. 542/1049 cut-off events. For 78323/78323 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5729 event pairs, 93 based on Foata normal form. 8/1057 useless extension candidates. Maximal degree in co-relation 6889. Up to 719 conditions per place. [2024-06-14 15:54:00,633 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 145 selfloop transitions, 56 changer transitions 15/218 dead transitions. [2024-06-14 15:54:00,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 218 transitions, 2720 flow [2024-06-14 15:54:00,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:54:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:54:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2024-06-14 15:54:00,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40053763440860213 [2024-06-14 15:54:00,635 INFO L175 Difference]: Start difference. First operand has 238 places, 188 transitions, 2036 flow. Second operand 12 states and 149 transitions. [2024-06-14 15:54:00,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 218 transitions, 2720 flow [2024-06-14 15:54:00,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 218 transitions, 2518 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:54:00,796 INFO L231 Difference]: Finished difference. Result has 233 places, 184 transitions, 1915 flow [2024-06-14 15:54:00,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1915, PETRI_PLACES=233, PETRI_TRANSITIONS=184} [2024-06-14 15:54:00,796 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2024-06-14 15:54:00,796 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 184 transitions, 1915 flow [2024-06-14 15:54:00,797 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:54:00,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:00,797 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:54:00,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-14 15:54:00,797 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:54:00,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:00,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1065520576, now seen corresponding path program 12 times [2024-06-14 15:54:00,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:00,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277143764] [2024-06-14 15:54:00,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:00,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:06,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:06,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277143764] [2024-06-14 15:54:06,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277143764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:06,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:06,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:06,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555549990] [2024-06-14 15:54:06,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:06,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:06,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:06,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:06,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:06,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:54:06,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 184 transitions, 1915 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:54:06,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:06,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:54:06,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:07,271 INFO L124 PetriNetUnfolderBase]: 548/1065 cut-off events. [2024-06-14 15:54:07,271 INFO L125 PetriNetUnfolderBase]: For 92952/92952 co-relation queries the response was YES. [2024-06-14 15:54:07,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7386 conditions, 1065 events. 548/1065 cut-off events. For 92952/92952 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5846 event pairs, 105 based on Foata normal form. 8/1073 useless extension candidates. Maximal degree in co-relation 7282. Up to 783 conditions per place. [2024-06-14 15:54:07,280 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 144 selfloop transitions, 57 changer transitions 8/211 dead transitions. [2024-06-14 15:54:07,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 211 transitions, 2577 flow [2024-06-14 15:54:07,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:54:07,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:54:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-14 15:54:07,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3844086021505376 [2024-06-14 15:54:07,281 INFO L175 Difference]: Start difference. First operand has 233 places, 184 transitions, 1915 flow. Second operand 12 states and 143 transitions. [2024-06-14 15:54:07,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 211 transitions, 2577 flow [2024-06-14 15:54:07,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 211 transitions, 2455 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 15:54:07,455 INFO L231 Difference]: Finished difference. Result has 230 places, 182 transitions, 1895 flow [2024-06-14 15:54:07,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1895, PETRI_PLACES=230, PETRI_TRANSITIONS=182} [2024-06-14 15:54:07,456 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 200 predicate places. [2024-06-14 15:54:07,456 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 182 transitions, 1895 flow [2024-06-14 15:54:07,456 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:54:07,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:07,456 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:54:07,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-14 15:54:07,456 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:54:07,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:07,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1897787892, now seen corresponding path program 13 times [2024-06-14 15:54:07,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:07,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521140102] [2024-06-14 15:54:07,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:07,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:13,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:13,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521140102] [2024-06-14 15:54:13,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521140102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:13,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:13,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:13,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424532759] [2024-06-14 15:54:13,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:13,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:13,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:13,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:13,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:13,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:54:13,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 182 transitions, 1895 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:54:13,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:13,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:54:13,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:14,485 INFO L124 PetriNetUnfolderBase]: 517/1004 cut-off events. [2024-06-14 15:54:14,485 INFO L125 PetriNetUnfolderBase]: For 77822/77822 co-relation queries the response was YES. [2024-06-14 15:54:14,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6543 conditions, 1004 events. 517/1004 cut-off events. For 77822/77822 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5442 event pairs, 98 based on Foata normal form. 10/1014 useless extension candidates. Maximal degree in co-relation 6440. Up to 783 conditions per place. [2024-06-14 15:54:14,494 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 134 selfloop transitions, 53 changer transitions 14/203 dead transitions. [2024-06-14 15:54:14,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 203 transitions, 2383 flow [2024-06-14 15:54:14,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-14 15:54:14,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-14 15:54:14,495 INFO L175 Difference]: Start difference. First operand has 230 places, 182 transitions, 1895 flow. Second operand 11 states and 129 transitions. [2024-06-14 15:54:14,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 203 transitions, 2383 flow [2024-06-14 15:54:14,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 203 transitions, 2267 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:54:14,684 INFO L231 Difference]: Finished difference. Result has 229 places, 178 transitions, 1850 flow [2024-06-14 15:54:14,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1779, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1850, PETRI_PLACES=229, PETRI_TRANSITIONS=178} [2024-06-14 15:54:14,685 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-14 15:54:14,685 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 178 transitions, 1850 flow [2024-06-14 15:54:14,685 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:54:14,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:14,685 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:54:14,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-14 15:54:14,686 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:54:14,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1897907862, now seen corresponding path program 14 times [2024-06-14 15:54:14,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:14,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593533939] [2024-06-14 15:54:14,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:14,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:21,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:21,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593533939] [2024-06-14 15:54:21,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593533939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:21,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:21,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:21,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075032229] [2024-06-14 15:54:21,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:21,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:21,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:21,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:21,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:21,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:54:21,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 178 transitions, 1850 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:54:21,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:21,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:54:21,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:22,114 INFO L124 PetriNetUnfolderBase]: 482/935 cut-off events. [2024-06-14 15:54:22,114 INFO L125 PetriNetUnfolderBase]: For 59003/59003 co-relation queries the response was YES. [2024-06-14 15:54:22,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5765 conditions, 935 events. 482/935 cut-off events. For 59003/59003 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4984 event pairs, 72 based on Foata normal form. 8/943 useless extension candidates. Maximal degree in co-relation 5662. Up to 719 conditions per place. [2024-06-14 15:54:22,121 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 128 selfloop transitions, 49 changer transitions 20/199 dead transitions. [2024-06-14 15:54:22,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 199 transitions, 2316 flow [2024-06-14 15:54:22,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-14 15:54:22,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-14 15:54:22,122 INFO L175 Difference]: Start difference. First operand has 229 places, 178 transitions, 1850 flow. Second operand 11 states and 127 transitions. [2024-06-14 15:54:22,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 199 transitions, 2316 flow [2024-06-14 15:54:22,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 199 transitions, 2166 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 15:54:22,233 INFO L231 Difference]: Finished difference. Result has 225 places, 172 transitions, 1740 flow [2024-06-14 15:54:22,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1700, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1740, PETRI_PLACES=225, PETRI_TRANSITIONS=172} [2024-06-14 15:54:22,233 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 195 predicate places. [2024-06-14 15:54:22,234 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 172 transitions, 1740 flow [2024-06-14 15:54:22,234 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:54:22,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:22,234 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:54:22,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-14 15:54:22,234 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:54:22,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:22,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1889465770, now seen corresponding path program 15 times [2024-06-14 15:54:22,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:22,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046767115] [2024-06-14 15:54:22,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:22,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:28,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:28,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046767115] [2024-06-14 15:54:28,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046767115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:28,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:28,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:28,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957114015] [2024-06-14 15:54:28,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:28,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:28,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:28,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:28,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:28,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:54:28,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 172 transitions, 1740 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:54:28,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:28,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:54:28,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:29,169 INFO L124 PetriNetUnfolderBase]: 468/901 cut-off events. [2024-06-14 15:54:29,170 INFO L125 PetriNetUnfolderBase]: For 58841/58841 co-relation queries the response was YES. [2024-06-14 15:54:29,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5574 conditions, 901 events. 468/901 cut-off events. For 58841/58841 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4740 event pairs, 69 based on Foata normal form. 8/909 useless extension candidates. Maximal degree in co-relation 5471. Up to 510 conditions per place. [2024-06-14 15:54:29,178 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 146 selfloop transitions, 42 changer transitions 12/202 dead transitions. [2024-06-14 15:54:29,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 202 transitions, 2406 flow [2024-06-14 15:54:29,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:54:29,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736 [2024-06-14 15:54:29,179 INFO L175 Difference]: Start difference. First operand has 225 places, 172 transitions, 1740 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:54:29,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 202 transitions, 2406 flow [2024-06-14 15:54:29,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 202 transitions, 2216 flow, removed 12 selfloop flow, removed 12 redundant places. [2024-06-14 15:54:29,297 INFO L231 Difference]: Finished difference. Result has 214 places, 169 transitions, 1616 flow [2024-06-14 15:54:29,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1616, PETRI_PLACES=214, PETRI_TRANSITIONS=169} [2024-06-14 15:54:29,297 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2024-06-14 15:54:29,298 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 169 transitions, 1616 flow [2024-06-14 15:54:29,298 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:54:29,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:29,298 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:54:29,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-14 15:54:29,298 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:54:29,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:29,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1889581090, now seen corresponding path program 16 times [2024-06-14 15:54:29,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:29,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454551343] [2024-06-14 15:54:29,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:29,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:35,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:35,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454551343] [2024-06-14 15:54:35,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454551343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:35,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:35,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:35,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813192563] [2024-06-14 15:54:35,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:35,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:35,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:35,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:35,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:35,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:54:35,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 169 transitions, 1616 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:54:35,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:35,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:54:35,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:36,419 INFO L124 PetriNetUnfolderBase]: 483/932 cut-off events. [2024-06-14 15:54:36,419 INFO L125 PetriNetUnfolderBase]: For 75617/75617 co-relation queries the response was YES. [2024-06-14 15:54:36,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6026 conditions, 932 events. 483/932 cut-off events. For 75617/75617 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4934 event pairs, 84 based on Foata normal form. 8/940 useless extension candidates. Maximal degree in co-relation 5928. Up to 601 conditions per place. [2024-06-14 15:54:36,426 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 146 selfloop transitions, 42 changer transitions 8/198 dead transitions. [2024-06-14 15:54:36,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 198 transitions, 2266 flow [2024-06-14 15:54:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:54:36,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736 [2024-06-14 15:54:36,427 INFO L175 Difference]: Start difference. First operand has 214 places, 169 transitions, 1616 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:54:36,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 198 transitions, 2266 flow [2024-06-14 15:54:36,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 198 transitions, 2181 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-14 15:54:36,572 INFO L231 Difference]: Finished difference. Result has 212 places, 167 transitions, 1599 flow [2024-06-14 15:54:36,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1533, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1599, PETRI_PLACES=212, PETRI_TRANSITIONS=167} [2024-06-14 15:54:36,572 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2024-06-14 15:54:36,572 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 167 transitions, 1599 flow [2024-06-14 15:54:36,572 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:54:36,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:36,572 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:54:36,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-14 15:54:36,573 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:54:36,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:36,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1889585740, now seen corresponding path program 17 times [2024-06-14 15:54:36,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:36,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998275403] [2024-06-14 15:54:36,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:36,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:42,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:42,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998275403] [2024-06-14 15:54:42,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998275403] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:42,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:42,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:54:42,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542946700] [2024-06-14 15:54:42,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:42,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:54:42,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:42,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:54:42,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:54:42,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:54:42,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 167 transitions, 1599 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:54:42,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:42,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:54:42,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:42,940 INFO L124 PetriNetUnfolderBase]: 452/871 cut-off events. [2024-06-14 15:54:42,940 INFO L125 PetriNetUnfolderBase]: For 60902/60902 co-relation queries the response was YES. [2024-06-14 15:54:42,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5211 conditions, 871 events. 452/871 cut-off events. For 60902/60902 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4558 event pairs, 75 based on Foata normal form. 10/881 useless extension candidates. Maximal degree in co-relation 5114. Up to 601 conditions per place. [2024-06-14 15:54:42,947 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 136 selfloop transitions, 38 changer transitions 15/191 dead transitions. [2024-06-14 15:54:42,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 191 transitions, 2083 flow [2024-06-14 15:54:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-14 15:54:42,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507 [2024-06-14 15:54:42,948 INFO L175 Difference]: Start difference. First operand has 212 places, 167 transitions, 1599 flow. Second operand 11 states and 139 transitions. [2024-06-14 15:54:42,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 191 transitions, 2083 flow [2024-06-14 15:54:43,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 191 transitions, 1997 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:54:43,046 INFO L231 Difference]: Finished difference. Result has 212 places, 162 transitions, 1535 flow [2024-06-14 15:54:43,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1535, PETRI_PLACES=212, PETRI_TRANSITIONS=162} [2024-06-14 15:54:43,047 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2024-06-14 15:54:43,047 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 162 transitions, 1535 flow [2024-06-14 15:54:43,047 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:54:43,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:43,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:43,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-14 15:54:43,048 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:54:43,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:43,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2060283520, now seen corresponding path program 18 times [2024-06-14 15:54:43,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:43,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862465931] [2024-06-14 15:54:43,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:43,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:49,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:49,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862465931] [2024-06-14 15:54:49,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862465931] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:49,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:49,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:49,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769082023] [2024-06-14 15:54:49,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:49,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:49,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:49,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:49,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:49,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:54:49,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 162 transitions, 1535 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:54:49,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:49,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:54:49,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:50,216 INFO L124 PetriNetUnfolderBase]: 465/900 cut-off events. [2024-06-14 15:54:50,217 INFO L125 PetriNetUnfolderBase]: For 75549/75549 co-relation queries the response was YES. [2024-06-14 15:54:50,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5838 conditions, 900 events. 465/900 cut-off events. For 75549/75549 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4732 event pairs, 82 based on Foata normal form. 8/908 useless extension candidates. Maximal degree in co-relation 5741. Up to 594 conditions per place. [2024-06-14 15:54:50,223 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 146 selfloop transitions, 36 changer transitions 7/191 dead transitions. [2024-06-14 15:54:50,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 191 transitions, 2172 flow [2024-06-14 15:54:50,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:54:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:54:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 150 transitions. [2024-06-14 15:54:50,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-14 15:54:50,224 INFO L175 Difference]: Start difference. First operand has 212 places, 162 transitions, 1535 flow. Second operand 12 states and 150 transitions. [2024-06-14 15:54:50,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 191 transitions, 2172 flow [2024-06-14 15:54:50,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 191 transitions, 2078 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 15:54:50,338 INFO L231 Difference]: Finished difference. Result has 208 places, 160 transitions, 1498 flow [2024-06-14 15:54:50,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1498, PETRI_PLACES=208, PETRI_TRANSITIONS=160} [2024-06-14 15:54:50,338 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-14 15:54:50,339 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 160 transitions, 1498 flow [2024-06-14 15:54:50,339 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:54:50,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:50,339 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:54:50,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-14 15:54:50,339 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:54:50,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:50,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1324070394, now seen corresponding path program 19 times [2024-06-14 15:54:50,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:50,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368698670] [2024-06-14 15:54:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:50,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:56,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:56,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368698670] [2024-06-14 15:54:56,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368698670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:56,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:56,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:56,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293120373] [2024-06-14 15:54:56,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:56,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:56,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:56,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:56,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:56,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:54:56,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 160 transitions, 1498 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:54:56,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:56,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:54:56,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:57,594 INFO L124 PetriNetUnfolderBase]: 434/839 cut-off events. [2024-06-14 15:54:57,594 INFO L125 PetriNetUnfolderBase]: For 60809/60809 co-relation queries the response was YES. [2024-06-14 15:54:57,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4987 conditions, 839 events. 434/839 cut-off events. For 60809/60809 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4342 event pairs, 74 based on Foata normal form. 10/849 useless extension candidates. Maximal degree in co-relation 4891. Up to 577 conditions per place. [2024-06-14 15:54:57,600 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 133 selfloop transitions, 36 changer transitions 13/184 dead transitions. [2024-06-14 15:54:57,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 184 transitions, 1969 flow [2024-06-14 15:54:57,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:54:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:54:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2024-06-14 15:54:57,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3897849462365591 [2024-06-14 15:54:57,601 INFO L175 Difference]: Start difference. First operand has 208 places, 160 transitions, 1498 flow. Second operand 12 states and 145 transitions. [2024-06-14 15:54:57,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 184 transitions, 1969 flow [2024-06-14 15:54:57,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 184 transitions, 1895 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:54:57,715 INFO L231 Difference]: Finished difference. Result has 208 places, 156 transitions, 1458 flow [2024-06-14 15:54:57,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1458, PETRI_PLACES=208, PETRI_TRANSITIONS=156} [2024-06-14 15:54:57,716 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-14 15:54:57,716 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 156 transitions, 1458 flow [2024-06-14 15:54:57,716 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:54:57,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:57,716 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:54:57,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-14 15:54:57,716 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:54:57,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:57,717 INFO L85 PathProgramCache]: Analyzing trace with hash -256625630, now seen corresponding path program 1 times [2024-06-14 15:54:57,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:57,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900976705] [2024-06-14 15:54:57,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:57,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:04,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:04,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900976705] [2024-06-14 15:55:04,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900976705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:04,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:04,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:55:04,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408753701] [2024-06-14 15:55:04,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:04,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:55:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:04,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:55:04,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:55:04,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:55:04,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 156 transitions, 1458 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:55:04,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:04,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:55:04,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:05,403 INFO L124 PetriNetUnfolderBase]: 415/802 cut-off events. [2024-06-14 15:55:05,403 INFO L125 PetriNetUnfolderBase]: For 46159/46159 co-relation queries the response was YES. [2024-06-14 15:55:05,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4835 conditions, 802 events. 415/802 cut-off events. For 46159/46159 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4115 event pairs, 69 based on Foata normal form. 2/804 useless extension candidates. Maximal degree in co-relation 4739. Up to 598 conditions per place. [2024-06-14 15:55:05,409 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 140 selfloop transitions, 37 changer transitions 0/179 dead transitions. [2024-06-14 15:55:05,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 179 transitions, 1910 flow [2024-06-14 15:55:05,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:55:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:55:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2024-06-14 15:55:05,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36228287841191065 [2024-06-14 15:55:05,411 INFO L175 Difference]: Start difference. First operand has 208 places, 156 transitions, 1458 flow. Second operand 13 states and 146 transitions. [2024-06-14 15:55:05,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 179 transitions, 1910 flow [2024-06-14 15:55:05,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 179 transitions, 1832 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:55:05,514 INFO L231 Difference]: Finished difference. Result has 206 places, 159 transitions, 1496 flow [2024-06-14 15:55:05,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1496, PETRI_PLACES=206, PETRI_TRANSITIONS=159} [2024-06-14 15:55:05,514 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 176 predicate places. [2024-06-14 15:55:05,514 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 159 transitions, 1496 flow [2024-06-14 15:55:05,514 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:55:05,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:05,515 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:55:05,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-14 15:55:05,515 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:55:05,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:05,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1033985918, now seen corresponding path program 20 times [2024-06-14 15:55:05,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:05,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198086847] [2024-06-14 15:55:05,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:05,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:11,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:11,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198086847] [2024-06-14 15:55:11,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198086847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:11,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:11,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:55:11,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37405367] [2024-06-14 15:55:11,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:11,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:55:11,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:11,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:55:11,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:55:11,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:55:11,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 159 transitions, 1496 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:55:11,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:11,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:55:11,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:12,064 INFO L124 PetriNetUnfolderBase]: 427/829 cut-off events. [2024-06-14 15:55:12,064 INFO L125 PetriNetUnfolderBase]: For 55297/55297 co-relation queries the response was YES. [2024-06-14 15:55:12,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4926 conditions, 829 events. 427/829 cut-off events. For 55297/55297 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4306 event pairs, 66 based on Foata normal form. 8/837 useless extension candidates. Maximal degree in co-relation 4830. Up to 503 conditions per place. [2024-06-14 15:55:12,071 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 140 selfloop transitions, 38 changer transitions 7/187 dead transitions. [2024-06-14 15:55:12,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 187 transitions, 2118 flow [2024-06-14 15:55:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:55:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:55:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-14 15:55:12,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-14 15:55:12,072 INFO L175 Difference]: Start difference. First operand has 206 places, 159 transitions, 1496 flow. Second operand 11 states and 143 transitions. [2024-06-14 15:55:12,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 187 transitions, 2118 flow [2024-06-14 15:55:12,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 187 transitions, 2036 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-14 15:55:12,172 INFO L231 Difference]: Finished difference. Result has 208 places, 157 transitions, 1472 flow [2024-06-14 15:55:12,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1472, PETRI_PLACES=208, PETRI_TRANSITIONS=157} [2024-06-14 15:55:12,172 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-14 15:55:12,172 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 157 transitions, 1472 flow [2024-06-14 15:55:12,172 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:55:12,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:12,173 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:55:12,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-14 15:55:12,173 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:55:12,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:12,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1894234314, now seen corresponding path program 2 times [2024-06-14 15:55:12,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:12,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320367780] [2024-06-14 15:55:12,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:12,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:18,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:18,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320367780] [2024-06-14 15:55:18,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320367780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:18,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:18,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:55:18,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166944147] [2024-06-14 15:55:18,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:18,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:55:18,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:18,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:55:18,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:55:18,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:55:18,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 157 transitions, 1472 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:55:18,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:18,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:55:18,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:19,377 INFO L124 PetriNetUnfolderBase]: 413/799 cut-off events. [2024-06-14 15:55:19,377 INFO L125 PetriNetUnfolderBase]: For 46171/46171 co-relation queries the response was YES. [2024-06-14 15:55:19,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4826 conditions, 799 events. 413/799 cut-off events. For 46171/46171 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4103 event pairs, 73 based on Foata normal form. 2/801 useless extension candidates. Maximal degree in co-relation 4729. Up to 596 conditions per place. [2024-06-14 15:55:19,384 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 138 selfloop transitions, 35 changer transitions 0/175 dead transitions. [2024-06-14 15:55:19,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 175 transitions, 1888 flow [2024-06-14 15:55:19,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:55:19,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:55:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-14 15:55:19,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-14 15:55:19,385 INFO L175 Difference]: Start difference. First operand has 208 places, 157 transitions, 1472 flow. Second operand 10 states and 122 transitions. [2024-06-14 15:55:19,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 175 transitions, 1888 flow [2024-06-14 15:55:19,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 175 transitions, 1792 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:55:19,479 INFO L231 Difference]: Finished difference. Result has 206 places, 158 transitions, 1464 flow [2024-06-14 15:55:19,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1464, PETRI_PLACES=206, PETRI_TRANSITIONS=158} [2024-06-14 15:55:19,480 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 176 predicate places. [2024-06-14 15:55:19,480 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 158 transitions, 1464 flow [2024-06-14 15:55:19,480 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:55:19,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:19,480 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:55:19,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-14 15:55:19,481 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:55:19,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:19,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2066963214, now seen corresponding path program 3 times [2024-06-14 15:55:19,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:19,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663294571] [2024-06-14 15:55:19,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:26,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:26,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663294571] [2024-06-14 15:55:26,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663294571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:26,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:26,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:55:26,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155583328] [2024-06-14 15:55:26,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:26,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:55:26,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:26,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:55:26,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:55:26,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:55:26,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 158 transitions, 1464 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:55:26,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:26,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:55:26,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:27,068 INFO L124 PetriNetUnfolderBase]: 424/821 cut-off events. [2024-06-14 15:55:27,068 INFO L125 PetriNetUnfolderBase]: For 50122/50122 co-relation queries the response was YES. [2024-06-14 15:55:27,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5009 conditions, 821 events. 424/821 cut-off events. For 50122/50122 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4245 event pairs, 68 based on Foata normal form. 2/823 useless extension candidates. Maximal degree in co-relation 4913. Up to 588 conditions per place. [2024-06-14 15:55:27,076 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 138 selfloop transitions, 41 changer transitions 0/181 dead transitions. [2024-06-14 15:55:27,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 181 transitions, 2036 flow [2024-06-14 15:55:27,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:55:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:55:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 148 transitions. [2024-06-14 15:55:27,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36724565756823824 [2024-06-14 15:55:27,077 INFO L175 Difference]: Start difference. First operand has 206 places, 158 transitions, 1464 flow. Second operand 13 states and 148 transitions. [2024-06-14 15:55:27,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 181 transitions, 2036 flow [2024-06-14 15:55:27,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 181 transitions, 1914 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-06-14 15:55:27,188 INFO L231 Difference]: Finished difference. Result has 208 places, 160 transitions, 1458 flow [2024-06-14 15:55:27,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1458, PETRI_PLACES=208, PETRI_TRANSITIONS=160} [2024-06-14 15:55:27,188 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-14 15:55:27,188 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 160 transitions, 1458 flow [2024-06-14 15:55:27,188 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:55:27,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:27,189 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:55:27,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-14 15:55:27,189 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:55:27,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:27,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1323890470, now seen corresponding path program 4 times [2024-06-14 15:55:27,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:27,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658879051] [2024-06-14 15:55:27,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:27,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:34,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:34,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658879051] [2024-06-14 15:55:34,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658879051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:34,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:34,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:55:34,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857564025] [2024-06-14 15:55:34,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:34,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:55:34,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:34,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:55:34,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:55:34,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:55:34,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 160 transitions, 1458 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:55:34,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:34,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:55:34,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:35,027 INFO L124 PetriNetUnfolderBase]: 421/816 cut-off events. [2024-06-14 15:55:35,027 INFO L125 PetriNetUnfolderBase]: For 47596/47596 co-relation queries the response was YES. [2024-06-14 15:55:35,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4844 conditions, 816 events. 421/816 cut-off events. For 47596/47596 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4230 event pairs, 68 based on Foata normal form. 2/818 useless extension candidates. Maximal degree in co-relation 4750. Up to 595 conditions per place. [2024-06-14 15:55:35,034 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 137 selfloop transitions, 39 changer transitions 0/178 dead transitions. [2024-06-14 15:55:35,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 178 transitions, 1872 flow [2024-06-14 15:55:35,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:55:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:55:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-14 15:55:35,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-14 15:55:35,035 INFO L175 Difference]: Start difference. First operand has 208 places, 160 transitions, 1458 flow. Second operand 11 states and 132 transitions. [2024-06-14 15:55:35,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 178 transitions, 1872 flow [2024-06-14 15:55:35,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 178 transitions, 1801 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:55:35,135 INFO L231 Difference]: Finished difference. Result has 210 places, 160 transitions, 1469 flow [2024-06-14 15:55:35,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1469, PETRI_PLACES=210, PETRI_TRANSITIONS=160} [2024-06-14 15:55:35,136 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2024-06-14 15:55:35,136 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 160 transitions, 1469 flow [2024-06-14 15:55:35,136 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:55:35,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:35,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:55:35,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-14 15:55:35,136 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:55:35,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:35,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2094768658, now seen corresponding path program 21 times [2024-06-14 15:55:35,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:35,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242889897] [2024-06-14 15:55:35,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:35,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:40,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:55:40,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:40,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242889897] [2024-06-14 15:55:40,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242889897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:40,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:40,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:55:40,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417968970] [2024-06-14 15:55:40,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:40,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:55:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:40,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:55:40,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:55:41,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:55:41,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 160 transitions, 1469 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:55:41,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:41,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:55:41,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:41,630 INFO L124 PetriNetUnfolderBase]: 408/792 cut-off events. [2024-06-14 15:55:41,631 INFO L125 PetriNetUnfolderBase]: For 44956/44956 co-relation queries the response was YES. [2024-06-14 15:55:41,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4180 conditions, 792 events. 408/792 cut-off events. For 44956/44956 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4119 event pairs, 54 based on Foata normal form. 10/802 useless extension candidates. Maximal degree in co-relation 4084. Up to 544 conditions per place. [2024-06-14 15:55:41,637 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 136 selfloop transitions, 32 changer transitions 13/183 dead transitions. [2024-06-14 15:55:41,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 183 transitions, 1933 flow [2024-06-14 15:55:41,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:55:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:55:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 15:55:41,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-14 15:55:41,638 INFO L175 Difference]: Start difference. First operand has 210 places, 160 transitions, 1469 flow. Second operand 11 states and 136 transitions. [2024-06-14 15:55:41,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 183 transitions, 1933 flow [2024-06-14 15:55:41,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 183 transitions, 1846 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:55:41,722 INFO L231 Difference]: Finished difference. Result has 211 places, 156 transitions, 1405 flow [2024-06-14 15:55:41,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1405, PETRI_PLACES=211, PETRI_TRANSITIONS=156} [2024-06-14 15:55:41,723 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-14 15:55:41,723 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 156 transitions, 1405 flow [2024-06-14 15:55:41,723 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:55:41,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:41,723 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:55:41,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-14 15:55:41,723 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:55:41,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:41,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1721317622, now seen corresponding path program 22 times [2024-06-14 15:55:41,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:41,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671068718] [2024-06-14 15:55:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:41,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:55:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:55:47,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:55:47,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671068718] [2024-06-14 15:55:47,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671068718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:55:47,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:55:47,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:55:47,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527695182] [2024-06-14 15:55:47,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:55:47,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:55:47,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:55:47,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:55:47,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:55:47,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-14 15:55:47,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 156 transitions, 1405 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:55:47,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:55:47,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-14 15:55:47,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:55:47,834 INFO L124 PetriNetUnfolderBase]: 417/816 cut-off events. [2024-06-14 15:55:47,835 INFO L125 PetriNetUnfolderBase]: For 58403/58403 co-relation queries the response was YES. [2024-06-14 15:55:47,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4713 conditions, 816 events. 417/816 cut-off events. For 58403/58403 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4210 event pairs, 71 based on Foata normal form. 8/824 useless extension candidates. Maximal degree in co-relation 4616. Up to 251 conditions per place. [2024-06-14 15:55:47,842 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 113 selfloop transitions, 52 changer transitions 13/180 dead transitions. [2024-06-14 15:55:47,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 180 transitions, 1995 flow [2024-06-14 15:55:47,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:55:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:55:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:55:47,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:55:47,843 INFO L175 Difference]: Start difference. First operand has 211 places, 156 transitions, 1405 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:55:47,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 180 transitions, 1995 flow [2024-06-14 15:55:47,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 180 transitions, 1902 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:55:47,930 INFO L231 Difference]: Finished difference. Result has 203 places, 153 transitions, 1404 flow [2024-06-14 15:55:47,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1404, PETRI_PLACES=203, PETRI_TRANSITIONS=153} [2024-06-14 15:55:47,930 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2024-06-14 15:55:47,930 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 153 transitions, 1404 flow [2024-06-14 15:55:47,930 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:55:47,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:55:47,931 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:55:47,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-14 15:55:47,931 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:55:47,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:55:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1779410072, now seen corresponding path program 23 times [2024-06-14 15:55:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:55:47,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154157693] [2024-06-14 15:55:47,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:55:47,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:55:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15