./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi003_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/rfi003_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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi003_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:40:26,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:40:26,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:40:26,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:40:26,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:40:26,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:40:26,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:40:26,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:40:26,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:40:26,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:40:26,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:40:26,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:40:26,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:40:26,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:40:26,435 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:40:26,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:40:26,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:40:26,436 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:40:26,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:40:26,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:40:26,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:40:26,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:40:26,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:40:26,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:40:26,438 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:40:26,438 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:40:26,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:40:26,439 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:40:26,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:40:26,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:40:26,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:40:26,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:40:26,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:40:26,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:40:26,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:40:26,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:40:26,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:40:26,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:40:26,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:40:26,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:40:26,441 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:40:26,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:40:26,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:40:26,442 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:40:26,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:40:26,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:40:26,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:40:26,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:40:26,661 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:40:26,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:40:27,808 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:40:28,029 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:40:28,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:40:28,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02111eb60/58090e9a71a54f32bb5877ecedc5ed1f/FLAG7edc7d9cd [2024-06-14 15:40:28,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02111eb60/58090e9a71a54f32bb5877ecedc5ed1f [2024-06-14 15:40:28,061 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:40:28,062 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:40:28,062 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-14 15:40:28,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:40:28,205 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:40:28,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:40:28,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:40:28,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:40:28,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:40:28" (1/2) ... [2024-06-14 15:40:28,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795d246d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:28, skipping insertion in model container [2024-06-14 15:40:28,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:40:28" (1/2) ... [2024-06-14 15:40:28,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@430dbe42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:28, skipping insertion in model container [2024-06-14 15:40:28,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:40:28" (2/2) ... [2024-06-14 15:40:28,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795d246d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28, skipping insertion in model container [2024-06-14 15:40:28,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:40:28" (2/2) ... [2024-06-14 15:40:28,215 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:40:28,281 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:40:28,282 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] ((((((((((((((((! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 2) && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_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_thd1 >= 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$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$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$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$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_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 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_thd1 >= 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_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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 )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (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)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) [2024-06-14 15:40:28,283 INFO L97 edCorrectnessWitness]: Location invariant before [L817-L817] ((((((((((((((((! multithreaded || (((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 2) && __unbuffered_p1_EAX <= 127) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 2) && __unbuffered_p1_EBX <= 127) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_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_thd1 >= 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$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$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$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$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_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 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_thd1 >= 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_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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 )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 127) && __unbuffered_p1_EBX <= 127) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (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)) && ((__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1) || __unbuffered_p1_EBX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) [2024-06-14 15:40:28,284 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:40:28,284 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-06-14 15:40:28,323 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:40:28,621 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:40:28,630 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:40:28,881 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:40:28,915 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:40:28,917 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28 WrapperNode [2024-06-14 15:40:28,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:40:28,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:40:28,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:40:28,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:40:28,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28" (1/1) ... [2024-06-14 15:40:28,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28" (1/1) ... [2024-06-14 15:40:29,016 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2024-06-14 15:40:29,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:40:29,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:40:29,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:40:29,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:40:29,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28" (1/1) ... [2024-06-14 15:40:29,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28" (1/1) ... [2024-06-14 15:40:29,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28" (1/1) ... [2024-06-14 15:40:29,076 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:40:29,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28" (1/1) ... [2024-06-14 15:40:29,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28" (1/1) ... [2024-06-14 15:40:29,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28" (1/1) ... [2024-06-14 15:40:29,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28" (1/1) ... [2024-06-14 15:40:29,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28" (1/1) ... [2024-06-14 15:40:29,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28" (1/1) ... [2024-06-14 15:40:29,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:40:29,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:40:29,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:40:29,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:40:29,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28" (1/1) ... [2024-06-14 15:40:29,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:40:29,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:40:29,173 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:40:29,180 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:40:29,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:40:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:40:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:40:29,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:40:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:40:29,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:40:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:40:29,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:40:29,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:40:29,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:40:29,209 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:40:29,304 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:40:29,306 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:40:30,086 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:40:30,087 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:40:30,272 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:40:30,273 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:40:30,275 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:40:30 BoogieIcfgContainer [2024-06-14 15:40:30,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:40:30,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:40:30,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:40:30,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:40:30,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:40:28" (1/4) ... [2024-06-14 15:40:30,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2102b3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:40:30, skipping insertion in model container [2024-06-14 15:40:30,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:40:28" (2/4) ... [2024-06-14 15:40:30,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2102b3b7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:40:30, skipping insertion in model container [2024-06-14 15:40:30,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:28" (3/4) ... [2024-06-14 15:40:30,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2102b3b7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:40:30, skipping insertion in model container [2024-06-14 15:40:30,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:40:30" (4/4) ... [2024-06-14 15:40:30,290 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-14 15:40:30,303 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:40:30,303 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:40:30,304 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:40:30,369 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:40:30,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-14 15:40:30,435 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-14 15:40:30,436 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:40:30,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:40:30,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-14 15:40:30,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-14 15:40:30,452 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:40:30,495 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;@5f303a5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:40:30,496 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:40:30,502 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:40:30,502 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:40:30,503 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:40:30,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:30,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:40:30,504 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:40:30,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:30,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1491043083, now seen corresponding path program 1 times [2024-06-14 15:40:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:30,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868124755] [2024-06-14 15:40:30,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:34,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:34,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868124755] [2024-06-14 15:40:34,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868124755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:34,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:34,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:40:34,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140446753] [2024-06-14 15:40:34,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:34,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:40:34,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:34,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:40:34,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:40:34,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2024-06-14 15:40:34,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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:40:34,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:34,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2024-06-14 15:40:34,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:34,985 INFO L124 PetriNetUnfolderBase]: 131/270 cut-off events. [2024-06-14 15:40:34,985 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-14 15:40:34,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 270 events. 131/270 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1073 event pairs, 75 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 514. Up to 235 conditions per place. [2024-06-14 15:40:34,991 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 22 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-14 15:40:34,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 121 flow [2024-06-14 15:40:34,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:40:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:40:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-06-14 15:40:35,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-06-14 15:40:35,002 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 60 transitions. [2024-06-14 15:40:35,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 121 flow [2024-06-14 15:40:35,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 15:40:35,005 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-14 15:40:35,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-14 15:40:35,010 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-14 15:40:35,010 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-14 15:40:35,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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:40:35,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:35,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:40:35,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:40:35,011 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:40:35,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:35,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1626464162, now seen corresponding path program 1 times [2024-06-14 15:40:35,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:35,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979489997] [2024-06-14 15:40:35,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:35,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:37,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:37,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979489997] [2024-06-14 15:40:37,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979489997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:37,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:37,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:40:37,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854949864] [2024-06-14 15:40:37,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:37,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:40:37,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:37,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:40:37,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:40:37,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:40:37,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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:40:37,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:37,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:40:37,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:38,017 INFO L124 PetriNetUnfolderBase]: 172/323 cut-off events. [2024-06-14 15:40:38,017 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-06-14 15:40:38,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 323 events. 172/323 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1254 event pairs, 79 based on Foata normal form. 2/324 useless extension candidates. Maximal degree in co-relation 723. Up to 295 conditions per place. [2024-06-14 15:40:38,023 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 28 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2024-06-14 15:40:38,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 167 flow [2024-06-14 15:40:38,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:40:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:40:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2024-06-14 15:40:38,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2024-06-14 15:40:38,027 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 71 transitions. [2024-06-14 15:40:38,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 167 flow [2024-06-14 15:40:38,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:40:38,031 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-14 15:40:38,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-06-14 15:40:38,033 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-14 15:40:38,033 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-14 15:40:38,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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:40:38,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:38,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:40:38,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:40:38,034 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:40:38,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:38,036 INFO L85 PathProgramCache]: Analyzing trace with hash 169841225, now seen corresponding path program 1 times [2024-06-14 15:40:38,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:38,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584766604] [2024-06-14 15:40:38,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:41,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:41,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584766604] [2024-06-14 15:40:41,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584766604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:41,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:41,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:40:41,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129969676] [2024-06-14 15:40:41,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:41,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:40:41,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:41,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:40:41,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:40:41,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:40:41,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:41,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:41,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:40:41,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:41,998 INFO L124 PetriNetUnfolderBase]: 169/318 cut-off events. [2024-06-14 15:40:41,999 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-06-14 15:40:41,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 318 events. 169/318 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1228 event pairs, 55 based on Foata normal form. 2/319 useless extension candidates. Maximal degree in co-relation 792. Up to 281 conditions per place. [2024-06-14 15:40:42,001 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 32 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-14 15:40:42,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 215 flow [2024-06-14 15:40:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:40:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:40:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-14 15:40:42,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212121212121212 [2024-06-14 15:40:42,002 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 86 transitions. [2024-06-14 15:40:42,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 215 flow [2024-06-14 15:40:42,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 15:40:42,004 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 123 flow [2024-06-14 15:40:42,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-14 15:40:42,005 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-14 15:40:42,005 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 123 flow [2024-06-14 15:40:42,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:42,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:42,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:40:42,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:40:42,006 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:42,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:42,006 INFO L85 PathProgramCache]: Analyzing trace with hash 211099886, now seen corresponding path program 1 times [2024-06-14 15:40:42,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:42,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323077575] [2024-06-14 15:40:42,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:42,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:47,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:47,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323077575] [2024-06-14 15:40:47,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323077575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:47,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:47,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:40:47,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364283576] [2024-06-14 15:40:47,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:47,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:40:47,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:47,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:40:47,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:40:47,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-14 15:40:47,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:47,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:47,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-14 15:40:47,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:47,549 INFO L124 PetriNetUnfolderBase]: 123/265 cut-off events. [2024-06-14 15:40:47,549 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2024-06-14 15:40:47,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 265 events. 123/265 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1039 event pairs, 38 based on Foata normal form. 1/262 useless extension candidates. Maximal degree in co-relation 693. Up to 219 conditions per place. [2024-06-14 15:40:47,551 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 26 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2024-06-14 15:40:47,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 205 flow [2024-06-14 15:40:47,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:40:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:40:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2024-06-14 15:40:47,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2024-06-14 15:40:47,553 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 123 flow. Second operand 5 states and 79 transitions. [2024-06-14 15:40:47,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 205 flow [2024-06-14 15:40:47,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 190 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 15:40:47,555 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 135 flow [2024-06-14 15:40:47,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2024-06-14 15:40:47,556 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2024-06-14 15:40:47,556 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 135 flow [2024-06-14 15:40:47,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:47,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:47,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:40:47,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:40:47,557 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:40:47,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:47,557 INFO L85 PathProgramCache]: Analyzing trace with hash 8700904, now seen corresponding path program 1 times [2024-06-14 15:40:47,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:47,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619578222] [2024-06-14 15:40:47,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:47,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:50,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:50,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619578222] [2024-06-14 15:40:50,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619578222] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:50,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:50,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:40:50,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359875560] [2024-06-14 15:40:50,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:50,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:40:50,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:50,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:40:50,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:40:50,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:40:50,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:50,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:50,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:40:50,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:51,168 INFO L124 PetriNetUnfolderBase]: 163/307 cut-off events. [2024-06-14 15:40:51,168 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2024-06-14 15:40:51,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 307 events. 163/307 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1168 event pairs, 29 based on Foata normal form. 4/310 useless extension candidates. Maximal degree in co-relation 890. Up to 252 conditions per place. [2024-06-14 15:40:51,172 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 34 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-14 15:40:51,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 245 flow [2024-06-14 15:40:51,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:40:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:40:51,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-14 15:40:51,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-06-14 15:40:51,174 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 135 flow. Second operand 6 states and 96 transitions. [2024-06-14 15:40:51,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 245 flow [2024-06-14 15:40:51,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 234 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 15:40:51,179 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 136 flow [2024-06-14 15:40:51,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2024-06-14 15:40:51,182 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2024-06-14 15:40:51,183 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 136 flow [2024-06-14 15:40:51,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:51,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:51,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:40:51,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:40:51,185 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:40:51,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:51,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2045837293, now seen corresponding path program 1 times [2024-06-14 15:40:51,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:51,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271923790] [2024-06-14 15:40:51,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:51,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:56,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:56,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271923790] [2024-06-14 15:40:56,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271923790] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:56,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:56,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:40:56,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990738428] [2024-06-14 15:40:56,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:56,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:40:56,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:56,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:40:56,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:40:56,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:40:56,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:56,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:56,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:40:56,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:56,539 INFO L124 PetriNetUnfolderBase]: 179/337 cut-off events. [2024-06-14 15:40:56,540 INFO L125 PetriNetUnfolderBase]: For 705/705 co-relation queries the response was YES. [2024-06-14 15:40:56,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 337 events. 179/337 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1350 event pairs, 49 based on Foata normal form. 3/338 useless extension candidates. Maximal degree in co-relation 1017. Up to 269 conditions per place. [2024-06-14 15:40:56,543 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 31 selfloop transitions, 12 changer transitions 0/47 dead transitions. [2024-06-14 15:40:56,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 278 flow [2024-06-14 15:40:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:40:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:40:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-06-14 15:40:56,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 15:40:56,545 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 136 flow. Second operand 6 states and 88 transitions. [2024-06-14 15:40:56,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 278 flow [2024-06-14 15:40:56,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 258 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:40:56,548 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 184 flow [2024-06-14 15:40:56,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2024-06-14 15:40:56,551 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2024-06-14 15:40:56,551 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 184 flow [2024-06-14 15:40:56,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:56,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:56,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:40:56,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:40:56,553 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:40:56,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:56,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1316054797, now seen corresponding path program 1 times [2024-06-14 15:40:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:56,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476151083] [2024-06-14 15:40:56,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:56,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:01,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:01,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:01,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476151083] [2024-06-14 15:41:01,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476151083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:01,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:01,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:41:01,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880561031] [2024-06-14 15:41:01,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:01,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:41:01,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:01,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:41:01,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:41:01,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:01,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:01,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:01,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:01,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:01,867 INFO L124 PetriNetUnfolderBase]: 189/360 cut-off events. [2024-06-14 15:41:01,867 INFO L125 PetriNetUnfolderBase]: For 1011/1011 co-relation queries the response was YES. [2024-06-14 15:41:01,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 360 events. 189/360 cut-off events. For 1011/1011 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1453 event pairs, 53 based on Foata normal form. 2/361 useless extension candidates. Maximal degree in co-relation 1224. Up to 315 conditions per place. [2024-06-14 15:41:01,885 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 39 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2024-06-14 15:41:01,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 346 flow [2024-06-14 15:41:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:41:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:41:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-14 15:41:01,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4199134199134199 [2024-06-14 15:41:01,892 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 184 flow. Second operand 7 states and 97 transitions. [2024-06-14 15:41:01,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 346 flow [2024-06-14 15:41:01,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 54 transitions, 332 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-14 15:41:01,904 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 239 flow [2024-06-14 15:41:01,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-06-14 15:41:01,905 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2024-06-14 15:41:01,905 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 239 flow [2024-06-14 15:41:01,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:01,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:01,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:01,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:41:01,906 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:41:01,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:01,907 INFO L85 PathProgramCache]: Analyzing trace with hash 110298893, now seen corresponding path program 2 times [2024-06-14 15:41:01,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:01,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710280511] [2024-06-14 15:41:01,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:07,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:07,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710280511] [2024-06-14 15:41:07,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710280511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:07,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:07,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:41:07,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544952342] [2024-06-14 15:41:07,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:07,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:41:07,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:07,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:41:07,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:41:07,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:07,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:07,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:07,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:07,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:07,565 INFO L124 PetriNetUnfolderBase]: 195/374 cut-off events. [2024-06-14 15:41:07,566 INFO L125 PetriNetUnfolderBase]: For 1378/1378 co-relation queries the response was YES. [2024-06-14 15:41:07,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 374 events. 195/374 cut-off events. For 1378/1378 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1535 event pairs, 50 based on Foata normal form. 2/375 useless extension candidates. Maximal degree in co-relation 1358. Up to 319 conditions per place. [2024-06-14 15:41:07,568 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 38 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2024-06-14 15:41:07,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 384 flow [2024-06-14 15:41:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:41:07,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:41:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-14 15:41:07,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2024-06-14 15:41:07,569 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 239 flow. Second operand 6 states and 85 transitions. [2024-06-14 15:41:07,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 384 flow [2024-06-14 15:41:07,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 363 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:41:07,571 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 273 flow [2024-06-14 15:41:07,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-06-14 15:41:07,572 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2024-06-14 15:41:07,572 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 273 flow [2024-06-14 15:41:07,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:07,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:07,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:07,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:41:07,573 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:41:07,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:07,573 INFO L85 PathProgramCache]: Analyzing trace with hash 116965133, now seen corresponding path program 3 times [2024-06-14 15:41:07,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:07,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312010342] [2024-06-14 15:41:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:07,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:12,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:12,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312010342] [2024-06-14 15:41:12,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312010342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:12,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:12,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:41:12,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789757508] [2024-06-14 15:41:12,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:12,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:41:12,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:12,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:41:12,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:41:12,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:12,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:12,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:12,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:12,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:12,801 INFO L124 PetriNetUnfolderBase]: 185/356 cut-off events. [2024-06-14 15:41:12,802 INFO L125 PetriNetUnfolderBase]: For 1675/1675 co-relation queries the response was YES. [2024-06-14 15:41:12,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 356 events. 185/356 cut-off events. For 1675/1675 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1459 event pairs, 52 based on Foata normal form. 4/357 useless extension candidates. Maximal degree in co-relation 1320. Up to 269 conditions per place. [2024-06-14 15:41:12,804 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 33 selfloop transitions, 16 changer transitions 0/53 dead transitions. [2024-06-14 15:41:12,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 395 flow [2024-06-14 15:41:12,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:41:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:41:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2024-06-14 15:41:12,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-14 15:41:12,805 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 273 flow. Second operand 6 states and 87 transitions. [2024-06-14 15:41:12,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 395 flow [2024-06-14 15:41:12,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 365 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 15:41:12,808 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 282 flow [2024-06-14 15:41:12,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-06-14 15:41:12,808 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2024-06-14 15:41:12,808 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 282 flow [2024-06-14 15:41:12,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:12,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:12,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:12,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:41:12,809 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:41:12,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:12,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1003554221, now seen corresponding path program 1 times [2024-06-14 15:41:12,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:12,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511094223] [2024-06-14 15:41:12,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:12,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:18,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:18,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511094223] [2024-06-14 15:41:18,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511094223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:18,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:18,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:41:18,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861764198] [2024-06-14 15:41:18,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:18,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:41:18,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:18,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:41:18,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:41:18,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:18,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 282 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:18,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:18,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:18,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:18,473 INFO L124 PetriNetUnfolderBase]: 194/371 cut-off events. [2024-06-14 15:41:18,474 INFO L125 PetriNetUnfolderBase]: For 1613/1613 co-relation queries the response was YES. [2024-06-14 15:41:18,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 371 events. 194/371 cut-off events. For 1613/1613 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1532 event pairs, 51 based on Foata normal form. 3/371 useless extension candidates. Maximal degree in co-relation 1368. Up to 260 conditions per place. [2024-06-14 15:41:18,476 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 35 selfloop transitions, 22 changer transitions 0/61 dead transitions. [2024-06-14 15:41:18,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 468 flow [2024-06-14 15:41:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:41:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:41:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-14 15:41:18,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-14 15:41:18,478 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 282 flow. Second operand 7 states and 102 transitions. [2024-06-14 15:41:18,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 468 flow [2024-06-14 15:41:18,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 423 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:41:18,481 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 317 flow [2024-06-14 15:41:18,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-06-14 15:41:18,482 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2024-06-14 15:41:18,482 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 317 flow [2024-06-14 15:41:18,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:18,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:18,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:18,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:41:18,483 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:41:18,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1045410674, now seen corresponding path program 1 times [2024-06-14 15:41:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:18,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853969019] [2024-06-14 15:41:18,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:18,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:24,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:24,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853969019] [2024-06-14 15:41:24,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853969019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:24,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:24,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:41:24,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494757155] [2024-06-14 15:41:24,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:24,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:41:24,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:24,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:41:24,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:41:24,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:24,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 317 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:24,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:24,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:24,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:24,615 INFO L124 PetriNetUnfolderBase]: 203/386 cut-off events. [2024-06-14 15:41:24,616 INFO L125 PetriNetUnfolderBase]: For 1939/1939 co-relation queries the response was YES. [2024-06-14 15:41:24,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 386 events. 203/386 cut-off events. For 1939/1939 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1607 event pairs, 54 based on Foata normal form. 3/386 useless extension candidates. Maximal degree in co-relation 1501. Up to 249 conditions per place. [2024-06-14 15:41:24,618 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 38 selfloop transitions, 26 changer transitions 0/68 dead transitions. [2024-06-14 15:41:24,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 68 transitions, 531 flow [2024-06-14 15:41:24,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:41:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:41:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-14 15:41:24,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-14 15:41:24,620 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 317 flow. Second operand 8 states and 116 transitions. [2024-06-14 15:41:24,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 68 transitions, 531 flow [2024-06-14 15:41:24,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 506 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 15:41:24,623 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 386 flow [2024-06-14 15:41:24,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=386, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2024-06-14 15:41:24,623 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2024-06-14 15:41:24,623 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 386 flow [2024-06-14 15:41:24,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:24,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:24,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:24,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:41:24,624 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:41:24,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:24,625 INFO L85 PathProgramCache]: Analyzing trace with hash 407007084, now seen corresponding path program 1 times [2024-06-14 15:41:24,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:24,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353838207] [2024-06-14 15:41:24,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:24,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353838207] [2024-06-14 15:41:29,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353838207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:29,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:29,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:41:29,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470237782] [2024-06-14 15:41:29,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:29,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:41:29,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:29,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:41:29,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:41:29,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:29,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 386 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:29,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:29,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:29,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:30,104 INFO L124 PetriNetUnfolderBase]: 201/385 cut-off events. [2024-06-14 15:41:30,104 INFO L125 PetriNetUnfolderBase]: For 2258/2258 co-relation queries the response was YES. [2024-06-14 15:41:30,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 385 events. 201/385 cut-off events. For 2258/2258 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1595 event pairs, 56 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 1615. Up to 327 conditions per place. [2024-06-14 15:41:30,110 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 53 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-06-14 15:41:30,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 566 flow [2024-06-14 15:41:30,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:41:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:41:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-14 15:41:30,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 15:41:30,112 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 386 flow. Second operand 7 states and 98 transitions. [2024-06-14 15:41:30,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 566 flow [2024-06-14 15:41:30,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 533 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 15:41:30,119 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 402 flow [2024-06-14 15:41:30,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-06-14 15:41:30,119 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2024-06-14 15:41:30,120 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 402 flow [2024-06-14 15:41:30,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:30,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:30,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:30,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:41:30,120 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:41:30,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:30,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1952314130, now seen corresponding path program 1 times [2024-06-14 15:41:30,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:30,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568326650] [2024-06-14 15:41:30,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:30,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:35,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:35,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568326650] [2024-06-14 15:41:35,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568326650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:35,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:35,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:41:35,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984928619] [2024-06-14 15:41:35,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:35,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:41:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:35,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:41:35,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:41:35,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:35,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 402 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:35,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:35,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:35,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:35,963 INFO L124 PetriNetUnfolderBase]: 207/401 cut-off events. [2024-06-14 15:41:35,964 INFO L125 PetriNetUnfolderBase]: For 2722/2722 co-relation queries the response was YES. [2024-06-14 15:41:35,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 401 events. 207/401 cut-off events. For 2722/2722 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1708 event pairs, 51 based on Foata normal form. 2/400 useless extension candidates. Maximal degree in co-relation 1709. Up to 278 conditions per place. [2024-06-14 15:41:35,966 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 44 selfloop transitions, 22 changer transitions 0/70 dead transitions. [2024-06-14 15:41:35,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 70 transitions, 602 flow [2024-06-14 15:41:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:41:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:41:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-14 15:41:35,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-06-14 15:41:35,967 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 402 flow. Second operand 7 states and 102 transitions. [2024-06-14 15:41:35,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 70 transitions, 602 flow [2024-06-14 15:41:35,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 569 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 15:41:35,971 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 432 flow [2024-06-14 15:41:35,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=432, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2024-06-14 15:41:35,972 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2024-06-14 15:41:35,972 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 432 flow [2024-06-14 15:41:35,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:35,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:35,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:35,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:41:35,973 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:41:35,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash 742652384, now seen corresponding path program 2 times [2024-06-14 15:41:35,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:35,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487074087] [2024-06-14 15:41:35,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:35,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:41,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:41,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487074087] [2024-06-14 15:41:41,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487074087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:41,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:41,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:41:41,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354394748] [2024-06-14 15:41:41,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:41,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:41:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:41,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:41:41,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:41:41,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:41,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 432 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:41,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:41,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:41,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:42,194 INFO L124 PetriNetUnfolderBase]: 203/391 cut-off events. [2024-06-14 15:41:42,195 INFO L125 PetriNetUnfolderBase]: For 2991/2991 co-relation queries the response was YES. [2024-06-14 15:41:42,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 391 events. 203/391 cut-off events. For 2991/2991 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1638 event pairs, 47 based on Foata normal form. 2/390 useless extension candidates. Maximal degree in co-relation 1716. Up to 275 conditions per place. [2024-06-14 15:41:42,198 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 43 selfloop transitions, 24 changer transitions 0/71 dead transitions. [2024-06-14 15:41:42,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 71 transitions, 602 flow [2024-06-14 15:41:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:41:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:41:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-14 15:41:42,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2024-06-14 15:41:42,199 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 432 flow. Second operand 8 states and 113 transitions. [2024-06-14 15:41:42,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 71 transitions, 602 flow [2024-06-14 15:41:42,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 71 transitions, 547 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:41:42,204 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 430 flow [2024-06-14 15:41:42,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=430, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2024-06-14 15:41:42,204 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 39 predicate places. [2024-06-14 15:41:42,205 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 430 flow [2024-06-14 15:41:42,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:42,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:42,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:42,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:41:42,205 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:41:42,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:42,206 INFO L85 PathProgramCache]: Analyzing trace with hash 742951596, now seen corresponding path program 1 times [2024-06-14 15:41:42,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:42,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086683394] [2024-06-14 15:41:42,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:42,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:48,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:48,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086683394] [2024-06-14 15:41:48,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086683394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:48,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:48,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:41:48,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625047209] [2024-06-14 15:41:48,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:48,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:41:48,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:48,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:41:48,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:41:49,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:49,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 430 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:49,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:49,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:49,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:49,410 INFO L124 PetriNetUnfolderBase]: 207/398 cut-off events. [2024-06-14 15:41:49,410 INFO L125 PetriNetUnfolderBase]: For 3337/3337 co-relation queries the response was YES. [2024-06-14 15:41:49,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 398 events. 207/398 cut-off events. For 3337/3337 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1667 event pairs, 48 based on Foata normal form. 3/398 useless extension candidates. Maximal degree in co-relation 1762. Up to 245 conditions per place. [2024-06-14 15:41:49,412 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 42 selfloop transitions, 31 changer transitions 0/77 dead transitions. [2024-06-14 15:41:49,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 77 transitions, 672 flow [2024-06-14 15:41:49,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:41:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:41:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2024-06-14 15:41:49,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-14 15:41:49,414 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 430 flow. Second operand 9 states and 129 transitions. [2024-06-14 15:41:49,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 77 transitions, 672 flow [2024-06-14 15:41:49,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 77 transitions, 617 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 15:41:49,418 INFO L231 Difference]: Finished difference. Result has 73 places, 63 transitions, 482 flow [2024-06-14 15:41:49,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=482, PETRI_PLACES=73, PETRI_TRANSITIONS=63} [2024-06-14 15:41:49,419 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 41 predicate places. [2024-06-14 15:41:49,419 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 63 transitions, 482 flow [2024-06-14 15:41:49,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:49,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:49,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:49,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:41:49,420 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:41:49,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash 766856593, now seen corresponding path program 1 times [2024-06-14 15:41:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:49,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810353252] [2024-06-14 15:41:49,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:54,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:54,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810353252] [2024-06-14 15:41:54,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810353252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:54,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:54,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:41:54,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665444078] [2024-06-14 15:41:54,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:54,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:41:54,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:54,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:41:54,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:41:54,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:54,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 482 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:54,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:54,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:54,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:55,269 INFO L124 PetriNetUnfolderBase]: 205/392 cut-off events. [2024-06-14 15:41:55,269 INFO L125 PetriNetUnfolderBase]: For 3493/3493 co-relation queries the response was YES. [2024-06-14 15:41:55,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 392 events. 205/392 cut-off events. For 3493/3493 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1656 event pairs, 47 based on Foata normal form. 1/389 useless extension candidates. Maximal degree in co-relation 1854. Up to 286 conditions per place. [2024-06-14 15:41:55,272 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 47 selfloop transitions, 22 changer transitions 0/73 dead transitions. [2024-06-14 15:41:55,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 666 flow [2024-06-14 15:41:55,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:41:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:41:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-06-14 15:41:55,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 15:41:55,279 INFO L175 Difference]: Start difference. First operand has 73 places, 63 transitions, 482 flow. Second operand 6 states and 88 transitions. [2024-06-14 15:41:55,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 73 transitions, 666 flow [2024-06-14 15:41:55,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 73 transitions, 587 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 15:41:55,301 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 481 flow [2024-06-14 15:41:55,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=481, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-06-14 15:41:55,302 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 40 predicate places. [2024-06-14 15:41:55,302 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 481 flow [2024-06-14 15:41:55,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:55,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:55,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:55,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:41:55,303 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:41:55,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:55,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1547128849, now seen corresponding path program 1 times [2024-06-14 15:41:55,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:55,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688655959] [2024-06-14 15:41:55,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:55,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:01,363 INFO L134 CoverageAnalysis]: 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:01,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:01,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688655959] [2024-06-14 15:42:01,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688655959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:01,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:01,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:01,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633201893] [2024-06-14 15:42:01,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:01,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:01,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:01,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:01,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:01,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:01,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 481 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:01,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:01,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:01,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:01,876 INFO L124 PetriNetUnfolderBase]: 211/413 cut-off events. [2024-06-14 15:42:01,876 INFO L125 PetriNetUnfolderBase]: For 4033/4033 co-relation queries the response was YES. [2024-06-14 15:42:01,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 413 events. 211/413 cut-off events. For 4033/4033 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1799 event pairs, 49 based on Foata normal form. 2/412 useless extension candidates. Maximal degree in co-relation 1912. Up to 257 conditions per place. [2024-06-14 15:42:01,879 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 49 selfloop transitions, 27 changer transitions 0/80 dead transitions. [2024-06-14 15:42:01,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 80 transitions, 723 flow [2024-06-14 15:42:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:42:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:42:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-14 15:42:01,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-14 15:42:01,881 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 481 flow. Second operand 8 states and 116 transitions. [2024-06-14 15:42:01,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 80 transitions, 723 flow [2024-06-14 15:42:01,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 80 transitions, 685 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:42:01,890 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 516 flow [2024-06-14 15:42:01,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=516, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2024-06-14 15:42:01,890 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2024-06-14 15:42:01,891 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 516 flow [2024-06-14 15:42:01,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:01,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:01,891 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:42:01,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:42:01,891 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:42:01,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:01,892 INFO L85 PathProgramCache]: Analyzing trace with hash -382671791, now seen corresponding path program 2 times [2024-06-14 15:42:01,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:01,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053118922] [2024-06-14 15:42:01,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:01,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:08,236 INFO L134 CoverageAnalysis]: 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:08,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:08,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053118922] [2024-06-14 15:42:08,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053118922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:08,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:08,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:42:08,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280639200] [2024-06-14 15:42:08,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:08,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:42:08,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:08,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:42:08,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:42:08,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:08,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 516 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:08,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:08,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:08,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:08,713 INFO L124 PetriNetUnfolderBase]: 217/419 cut-off events. [2024-06-14 15:42:08,713 INFO L125 PetriNetUnfolderBase]: For 4478/4478 co-relation queries the response was YES. [2024-06-14 15:42:08,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 419 events. 217/419 cut-off events. For 4478/4478 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1810 event pairs, 49 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 2010. Up to 263 conditions per place. [2024-06-14 15:42:08,716 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 49 selfloop transitions, 31 changer transitions 0/84 dead transitions. [2024-06-14 15:42:08,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 84 transitions, 780 flow [2024-06-14 15:42:08,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:42:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:42:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2024-06-14 15:42:08,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43097643097643096 [2024-06-14 15:42:08,728 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 516 flow. Second operand 9 states and 128 transitions. [2024-06-14 15:42:08,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 84 transitions, 780 flow [2024-06-14 15:42:08,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 710 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 15:42:08,751 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 531 flow [2024-06-14 15:42:08,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=531, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2024-06-14 15:42:08,751 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 47 predicate places. [2024-06-14 15:42:08,751 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 531 flow [2024-06-14 15:42:08,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:08,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:08,752 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:42:08,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:42:08,752 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:42:08,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:08,752 INFO L85 PathProgramCache]: Analyzing trace with hash -382998221, now seen corresponding path program 3 times [2024-06-14 15:42:08,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:08,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957204568] [2024-06-14 15:42:08,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:08,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:14,895 INFO L134 CoverageAnalysis]: 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:14,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:14,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957204568] [2024-06-14 15:42:14,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957204568] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:14,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:14,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:42:14,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559948174] [2024-06-14 15:42:14,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:14,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:42:14,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:14,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:42:14,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:42:15,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:15,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 531 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:15,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:15,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:15,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:15,357 INFO L124 PetriNetUnfolderBase]: 213/413 cut-off events. [2024-06-14 15:42:15,357 INFO L125 PetriNetUnfolderBase]: For 4600/4600 co-relation queries the response was YES. [2024-06-14 15:42:15,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2030 conditions, 413 events. 213/413 cut-off events. For 4600/4600 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1777 event pairs, 46 based on Foata normal form. 2/412 useless extension candidates. Maximal degree in co-relation 1991. Up to 260 conditions per place. [2024-06-14 15:42:15,361 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 48 selfloop transitions, 31 changer transitions 0/83 dead transitions. [2024-06-14 15:42:15,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 741 flow [2024-06-14 15:42:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:42:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:42:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2024-06-14 15:42:15,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43097643097643096 [2024-06-14 15:42:15,378 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 531 flow. Second operand 9 states and 128 transitions. [2024-06-14 15:42:15,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 741 flow [2024-06-14 15:42:15,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 83 transitions, 692 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:42:15,385 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 549 flow [2024-06-14 15:42:15,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=549, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2024-06-14 15:42:15,386 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 50 predicate places. [2024-06-14 15:42:15,386 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 549 flow [2024-06-14 15:42:15,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:15,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:15,387 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:42:15,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:42:15,387 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:42:15,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:15,387 INFO L85 PathProgramCache]: Analyzing trace with hash -382659887, now seen corresponding path program 1 times [2024-06-14 15:42:15,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:15,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869341064] [2024-06-14 15:42:15,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:15,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:21,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:21,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869341064] [2024-06-14 15:42:21,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869341064] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:21,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:21,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:42:21,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849055377] [2024-06-14 15:42:21,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:21,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:42:21,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:21,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:42:21,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:42:22,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:22,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 549 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:22,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:22,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:22,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:22,536 INFO L124 PetriNetUnfolderBase]: 214/428 cut-off events. [2024-06-14 15:42:22,536 INFO L125 PetriNetUnfolderBase]: For 5256/5256 co-relation queries the response was YES. [2024-06-14 15:42:22,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 428 events. 214/428 cut-off events. For 5256/5256 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1901 event pairs, 42 based on Foata normal form. 4/429 useless extension candidates. Maximal degree in co-relation 2001. Up to 297 conditions per place. [2024-06-14 15:42:22,539 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 65 selfloop transitions, 29 changer transitions 0/98 dead transitions. [2024-06-14 15:42:22,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 98 transitions, 913 flow [2024-06-14 15:42:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:42:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:42:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-14 15:42:22,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-14 15:42:22,541 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 549 flow. Second operand 10 states and 134 transitions. [2024-06-14 15:42:22,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 98 transitions, 913 flow [2024-06-14 15:42:22,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 98 transitions, 795 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:42:22,546 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 677 flow [2024-06-14 15:42:22,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=677, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2024-06-14 15:42:22,546 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2024-06-14 15:42:22,546 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 677 flow [2024-06-14 15:42:22,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:22,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:22,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:22,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:42:22,547 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:42:22,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash 288948555, now seen corresponding path program 1 times [2024-06-14 15:42:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:22,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787639797] [2024-06-14 15:42:22,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:22,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:28,407 INFO L134 CoverageAnalysis]: 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:28,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:28,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787639797] [2024-06-14 15:42:28,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787639797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:28,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:28,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:28,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109771375] [2024-06-14 15:42:28,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:28,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:28,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:28,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:28,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:28,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:28,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 677 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:28,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:28,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:28,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:28,875 INFO L124 PetriNetUnfolderBase]: 218/430 cut-off events. [2024-06-14 15:42:28,875 INFO L125 PetriNetUnfolderBase]: For 5225/5225 co-relation queries the response was YES. [2024-06-14 15:42:28,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2174 conditions, 430 events. 218/430 cut-off events. For 5225/5225 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1875 event pairs, 23 based on Foata normal form. 2/431 useless extension candidates. Maximal degree in co-relation 2128. Up to 337 conditions per place. [2024-06-14 15:42:28,878 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 84 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2024-06-14 15:42:28,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 100 transitions, 917 flow [2024-06-14 15:42:28,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:42:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:42:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-14 15:42:28,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 15:42:28,881 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 677 flow. Second operand 8 states and 108 transitions. [2024-06-14 15:42:28,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 100 transitions, 917 flow [2024-06-14 15:42:28,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 100 transitions, 877 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-14 15:42:28,888 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 675 flow [2024-06-14 15:42:28,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=675, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2024-06-14 15:42:28,889 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2024-06-14 15:42:28,889 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 675 flow [2024-06-14 15:42:28,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:28,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:28,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:28,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:42:28,890 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:42:28,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:28,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1272914161, now seen corresponding path program 2 times [2024-06-14 15:42:28,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248301184] [2024-06-14 15:42:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:33,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:33,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:33,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248301184] [2024-06-14 15:42:33,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248301184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:33,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:33,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:42:33,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321059365] [2024-06-14 15:42:33,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:33,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:42:33,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:33,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:42:33,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:42:34,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:42:34,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 675 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:34,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:34,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:42:34,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:34,363 INFO L124 PetriNetUnfolderBase]: 222/438 cut-off events. [2024-06-14 15:42:34,364 INFO L125 PetriNetUnfolderBase]: For 5574/5574 co-relation queries the response was YES. [2024-06-14 15:42:34,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2194 conditions, 438 events. 222/438 cut-off events. For 5574/5574 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1942 event pairs, 43 based on Foata normal form. 2/439 useless extension candidates. Maximal degree in co-relation 2146. Up to 362 conditions per place. [2024-06-14 15:42:34,367 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 84 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2024-06-14 15:42:34,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 100 transitions, 915 flow [2024-06-14 15:42:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:42:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:42:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2024-06-14 15:42:34,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2024-06-14 15:42:34,368 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 675 flow. Second operand 7 states and 108 transitions. [2024-06-14 15:42:34,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 100 transitions, 915 flow [2024-06-14 15:42:34,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 100 transitions, 872 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:42:34,376 INFO L231 Difference]: Finished difference. Result has 94 places, 86 transitions, 672 flow [2024-06-14 15:42:34,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=672, PETRI_PLACES=94, PETRI_TRANSITIONS=86} [2024-06-14 15:42:34,376 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2024-06-14 15:42:34,376 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 86 transitions, 672 flow [2024-06-14 15:42:34,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:34,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:34,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:34,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:42:34,377 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:42:34,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:34,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1272909201, now seen corresponding path program 1 times [2024-06-14 15:42:34,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:34,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414305436] [2024-06-14 15:42:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:34,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:40,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414305436] [2024-06-14 15:42:40,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414305436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:40,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:40,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381274144] [2024-06-14 15:42:40,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:40,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:40,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:40,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:40,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 15:42:40,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 86 transitions, 672 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:40,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:40,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 15:42:40,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:40,911 INFO L124 PetriNetUnfolderBase]: 220/430 cut-off events. [2024-06-14 15:42:40,912 INFO L125 PetriNetUnfolderBase]: For 5229/5229 co-relation queries the response was YES. [2024-06-14 15:42:40,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2144 conditions, 430 events. 220/430 cut-off events. For 5229/5229 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1898 event pairs, 45 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 2097. Up to 288 conditions per place. [2024-06-14 15:42:40,916 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 57 selfloop transitions, 35 changer transitions 0/96 dead transitions. [2024-06-14 15:42:40,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 96 transitions, 899 flow [2024-06-14 15:42:40,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:42:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:42:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-14 15:42:40,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2024-06-14 15:42:40,917 INFO L175 Difference]: Start difference. First operand has 94 places, 86 transitions, 672 flow. Second operand 7 states and 95 transitions. [2024-06-14 15:42:40,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 96 transitions, 899 flow [2024-06-14 15:42:40,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 96 transitions, 869 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 15:42:40,926 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 747 flow [2024-06-14 15:42:40,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=747, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-06-14 15:42:40,926 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 64 predicate places. [2024-06-14 15:42:40,926 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 747 flow [2024-06-14 15:42:40,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:40,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:40,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:40,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:42:40,927 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:42:40,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2122222325, now seen corresponding path program 3 times [2024-06-14 15:42:40,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:40,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478988892] [2024-06-14 15:42:40,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:40,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:46,929 INFO L134 CoverageAnalysis]: 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:46,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:46,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478988892] [2024-06-14 15:42:46,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478988892] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:46,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:46,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:46,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800761323] [2024-06-14 15:42:46,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:46,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:46,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:46,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:46,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:47,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:47,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 747 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:47,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:47,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:47,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:47,391 INFO L124 PetriNetUnfolderBase]: 224/445 cut-off events. [2024-06-14 15:42:47,392 INFO L125 PetriNetUnfolderBase]: For 5924/5924 co-relation queries the response was YES. [2024-06-14 15:42:47,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 445 events. 224/445 cut-off events. For 5924/5924 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1981 event pairs, 42 based on Foata normal form. 2/446 useless extension candidates. Maximal degree in co-relation 2224. Up to 368 conditions per place. [2024-06-14 15:42:47,395 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 81 selfloop transitions, 16 changer transitions 0/101 dead transitions. [2024-06-14 15:42:47,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 101 transitions, 986 flow [2024-06-14 15:42:47,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:42:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:42:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-14 15:42:47,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2024-06-14 15:42:47,398 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 747 flow. Second operand 8 states and 106 transitions. [2024-06-14 15:42:47,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 101 transitions, 986 flow [2024-06-14 15:42:47,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 907 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:42:47,406 INFO L231 Difference]: Finished difference. Result has 99 places, 90 transitions, 731 flow [2024-06-14 15:42:47,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=731, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2024-06-14 15:42:47,407 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2024-06-14 15:42:47,407 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 731 flow [2024-06-14 15:42:47,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:47,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:47,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:47,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:42:47,408 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:42:47,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:47,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1348093643, now seen corresponding path program 4 times [2024-06-14 15:42:47,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:47,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129747056] [2024-06-14 15:42:47,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:47,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:53,331 INFO L134 CoverageAnalysis]: 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:53,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:53,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129747056] [2024-06-14 15:42:53,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129747056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:53,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:53,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:53,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934952405] [2024-06-14 15:42:53,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:53,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:53,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:53,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:53,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:53,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:53,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 731 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:53,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:53,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:53,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:53,726 INFO L124 PetriNetUnfolderBase]: 225/446 cut-off events. [2024-06-14 15:42:53,726 INFO L125 PetriNetUnfolderBase]: For 5957/5957 co-relation queries the response was YES. [2024-06-14 15:42:53,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 446 events. 225/446 cut-off events. For 5957/5957 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1997 event pairs, 40 based on Foata normal form. 4/447 useless extension candidates. Maximal degree in co-relation 2162. Up to 333 conditions per place. [2024-06-14 15:42:53,730 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 76 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2024-06-14 15:42:53,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 102 transitions, 970 flow [2024-06-14 15:42:53,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:42:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:42:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-14 15:42:53,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-14 15:42:53,731 INFO L175 Difference]: Start difference. First operand has 99 places, 90 transitions, 731 flow. Second operand 8 states and 110 transitions. [2024-06-14 15:42:53,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 102 transitions, 970 flow [2024-06-14 15:42:53,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 102 transitions, 929 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 15:42:53,741 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 769 flow [2024-06-14 15:42:53,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=769, PETRI_PLACES=103, PETRI_TRANSITIONS=93} [2024-06-14 15:42:53,742 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 71 predicate places. [2024-06-14 15:42:53,742 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 769 flow [2024-06-14 15:42:53,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:53,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:53,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:53,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:42:53,743 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:42:53,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:53,743 INFO L85 PathProgramCache]: Analyzing trace with hash 726858093, now seen corresponding path program 1 times [2024-06-14 15:42:53,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:53,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663624117] [2024-06-14 15:42:53,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:53,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:59,946 INFO L134 CoverageAnalysis]: 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:59,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:59,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663624117] [2024-06-14 15:42:59,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663624117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:59,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:59,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:42:59,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446720932] [2024-06-14 15:42:59,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:59,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:42:59,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:59,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:42:59,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:00,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:00,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 93 transitions, 769 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:00,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:00,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:00,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:00,336 INFO L124 PetriNetUnfolderBase]: 228/453 cut-off events. [2024-06-14 15:43:00,336 INFO L125 PetriNetUnfolderBase]: For 5709/5709 co-relation queries the response was YES. [2024-06-14 15:43:00,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 453 events. 228/453 cut-off events. For 5709/5709 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2041 event pairs, 37 based on Foata normal form. 1/451 useless extension candidates. Maximal degree in co-relation 2232. Up to 341 conditions per place. [2024-06-14 15:43:00,339 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 76 selfloop transitions, 28 changer transitions 0/108 dead transitions. [2024-06-14 15:43:00,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 108 transitions, 1043 flow [2024-06-14 15:43:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:43:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:43:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-14 15:43:00,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107744107744108 [2024-06-14 15:43:00,341 INFO L175 Difference]: Start difference. First operand has 103 places, 93 transitions, 769 flow. Second operand 9 states and 122 transitions. [2024-06-14 15:43:00,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 108 transitions, 1043 flow [2024-06-14 15:43:00,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 108 transitions, 968 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 15:43:00,350 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 801 flow [2024-06-14 15:43:00,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=801, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2024-06-14 15:43:00,351 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2024-06-14 15:43:00,351 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 801 flow [2024-06-14 15:43:00,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:00,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:00,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:00,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:43:00,351 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:43:00,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:00,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1011957963, now seen corresponding path program 2 times [2024-06-14 15:43:00,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:00,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723809415] [2024-06-14 15:43:00,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:00,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:07,180 INFO L134 CoverageAnalysis]: 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:07,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723809415] [2024-06-14 15:43:07,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723809415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:07,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:07,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:43:07,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848440782] [2024-06-14 15:43:07,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:07,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:43:07,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:07,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:43:07,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:43:07,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:07,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 801 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:07,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:07,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:07,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:07,732 INFO L124 PetriNetUnfolderBase]: 231/458 cut-off events. [2024-06-14 15:43:07,733 INFO L125 PetriNetUnfolderBase]: For 5966/5966 co-relation queries the response was YES. [2024-06-14 15:43:07,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2313 conditions, 458 events. 231/458 cut-off events. For 5966/5966 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2070 event pairs, 37 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 2260. Up to 346 conditions per place. [2024-06-14 15:43:07,736 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 77 selfloop transitions, 31 changer transitions 0/112 dead transitions. [2024-06-14 15:43:07,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 112 transitions, 1075 flow [2024-06-14 15:43:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:43:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:43:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-14 15:43:07,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-14 15:43:07,757 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 801 flow. Second operand 10 states and 134 transitions. [2024-06-14 15:43:07,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 112 transitions, 1075 flow [2024-06-14 15:43:07,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 112 transitions, 993 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 15:43:07,767 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 831 flow [2024-06-14 15:43:07,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=831, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2024-06-14 15:43:07,767 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 80 predicate places. [2024-06-14 15:43:07,767 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 831 flow [2024-06-14 15:43:07,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:07,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:07,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:07,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:43:07,769 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:43:07,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:07,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1022433483, now seen corresponding path program 3 times [2024-06-14 15:43:07,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:07,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538256969] [2024-06-14 15:43:07,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:07,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:14,316 INFO L134 CoverageAnalysis]: 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:14,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:14,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538256969] [2024-06-14 15:43:14,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538256969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:14,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:14,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:43:14,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26777852] [2024-06-14 15:43:14,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:14,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:43:14,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:14,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:43:14,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:43:14,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:14,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 831 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:14,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:14,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:14,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:14,785 INFO L124 PetriNetUnfolderBase]: 234/463 cut-off events. [2024-06-14 15:43:14,786 INFO L125 PetriNetUnfolderBase]: For 6442/6442 co-relation queries the response was YES. [2024-06-14 15:43:14,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2372 conditions, 463 events. 234/463 cut-off events. For 6442/6442 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2093 event pairs, 37 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 2318. Up to 341 conditions per place. [2024-06-14 15:43:14,789 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 78 selfloop transitions, 37 changer transitions 0/119 dead transitions. [2024-06-14 15:43:14,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 119 transitions, 1187 flow [2024-06-14 15:43:14,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:43:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:43:14,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-14 15:43:14,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-14 15:43:14,793 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 831 flow. Second operand 11 states and 146 transitions. [2024-06-14 15:43:14,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 119 transitions, 1187 flow [2024-06-14 15:43:14,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 119 transitions, 1100 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 15:43:14,802 INFO L231 Difference]: Finished difference. Result has 115 places, 107 transitions, 877 flow [2024-06-14 15:43:14,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=877, PETRI_PLACES=115, PETRI_TRANSITIONS=107} [2024-06-14 15:43:14,803 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 83 predicate places. [2024-06-14 15:43:14,803 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 107 transitions, 877 flow [2024-06-14 15:43:14,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:14,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:14,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:14,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:43:14,804 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:43:14,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:14,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1022077293, now seen corresponding path program 4 times [2024-06-14 15:43:14,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:14,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889796443] [2024-06-14 15:43:14,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:14,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43: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:43:21,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:21,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889796443] [2024-06-14 15:43:21,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889796443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:21,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:21,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:43:21,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494255996] [2024-06-14 15:43:21,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:21,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:43:21,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:21,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:43:21,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:43:21,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:21,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 877 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:21,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:21,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:21,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:21,944 INFO L124 PetriNetUnfolderBase]: 232/462 cut-off events. [2024-06-14 15:43:21,945 INFO L125 PetriNetUnfolderBase]: For 6633/6633 co-relation queries the response was YES. [2024-06-14 15:43:21,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 462 events. 232/462 cut-off events. For 6633/6633 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2104 event pairs, 37 based on Foata normal form. 1/460 useless extension candidates. Maximal degree in co-relation 2307. Up to 348 conditions per place. [2024-06-14 15:43:21,948 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 81 selfloop transitions, 32 changer transitions 0/117 dead transitions. [2024-06-14 15:43:21,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 117 transitions, 1127 flow [2024-06-14 15:43:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:43:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:43:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 15:43:21,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-14 15:43:21,969 INFO L175 Difference]: Start difference. First operand has 115 places, 107 transitions, 877 flow. Second operand 10 states and 133 transitions. [2024-06-14 15:43:21,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 117 transitions, 1127 flow [2024-06-14 15:43:21,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 117 transitions, 1078 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-14 15:43:21,982 INFO L231 Difference]: Finished difference. Result has 120 places, 107 transitions, 897 flow [2024-06-14 15:43:21,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=897, PETRI_PLACES=120, PETRI_TRANSITIONS=107} [2024-06-14 15:43:21,983 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2024-06-14 15:43:21,983 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 107 transitions, 897 flow [2024-06-14 15:43:21,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:21,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:21,984 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:43:21,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:43:21,984 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:43:21,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:21,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1930116050, now seen corresponding path program 1 times [2024-06-14 15:43:21,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:21,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947679557] [2024-06-14 15:43:21,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:21,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:28,065 INFO L134 CoverageAnalysis]: 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:28,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:28,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947679557] [2024-06-14 15:43:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947679557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:28,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:28,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:43:28,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892328775] [2024-06-14 15:43:28,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:28,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:43:28,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:28,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:43:28,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:43:28,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:28,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 107 transitions, 897 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:28,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:28,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:28,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:28,503 INFO L124 PetriNetUnfolderBase]: 236/467 cut-off events. [2024-06-14 15:43:28,503 INFO L125 PetriNetUnfolderBase]: For 7460/7460 co-relation queries the response was YES. [2024-06-14 15:43:28,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 467 events. 236/467 cut-off events. For 7460/7460 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2137 event pairs, 20 based on Foata normal form. 2/465 useless extension candidates. Maximal degree in co-relation 2386. Up to 365 conditions per place. [2024-06-14 15:43:28,506 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 104 selfloop transitions, 10 changer transitions 0/118 dead transitions. [2024-06-14 15:43:28,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 118 transitions, 1157 flow [2024-06-14 15:43:28,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:43:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:43:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-14 15:43:28,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4025974025974026 [2024-06-14 15:43:28,507 INFO L175 Difference]: Start difference. First operand has 120 places, 107 transitions, 897 flow. Second operand 7 states and 93 transitions. [2024-06-14 15:43:28,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 118 transitions, 1157 flow [2024-06-14 15:43:28,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 118 transitions, 1083 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 15:43:28,518 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 857 flow [2024-06-14 15:43:28,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=857, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2024-06-14 15:43:28,519 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2024-06-14 15:43:28,519 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 857 flow [2024-06-14 15:43:28,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:28,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:28,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:28,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:43:28,520 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:43:28,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:28,520 INFO L85 PathProgramCache]: Analyzing trace with hash -631592012, now seen corresponding path program 2 times [2024-06-14 15:43:28,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:28,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179886654] [2024-06-14 15:43:28,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:28,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:34,953 INFO L134 CoverageAnalysis]: 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:34,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:34,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179886654] [2024-06-14 15:43:34,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179886654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:34,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:34,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:43:34,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943460957] [2024-06-14 15:43:34,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:34,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:43:34,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:43:34,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:43:35,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:35,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 857 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:35,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:35,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:35,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:35,435 INFO L124 PetriNetUnfolderBase]: 240/475 cut-off events. [2024-06-14 15:43:35,436 INFO L125 PetriNetUnfolderBase]: For 7916/7916 co-relation queries the response was YES. [2024-06-14 15:43:35,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2444 conditions, 475 events. 240/475 cut-off events. For 7916/7916 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2189 event pairs, 41 based on Foata normal form. 2/473 useless extension candidates. Maximal degree in co-relation 2387. Up to 370 conditions per place. [2024-06-14 15:43:35,439 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 91 selfloop transitions, 22 changer transitions 0/117 dead transitions. [2024-06-14 15:43:35,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 117 transitions, 1113 flow [2024-06-14 15:43:35,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:43:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:43:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-14 15:43:35,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 15:43:35,444 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 857 flow. Second operand 7 states and 99 transitions. [2024-06-14 15:43:35,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 117 transitions, 1113 flow [2024-06-14 15:43:35,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 117 transitions, 1089 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:43:35,457 INFO L231 Difference]: Finished difference. Result has 120 places, 109 transitions, 893 flow [2024-06-14 15:43:35,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=893, PETRI_PLACES=120, PETRI_TRANSITIONS=109} [2024-06-14 15:43:35,458 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2024-06-14 15:43:35,458 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 109 transitions, 893 flow [2024-06-14 15:43:35,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:35,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:35,458 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:43:35,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:43:35,459 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:43:35,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:35,459 INFO L85 PathProgramCache]: Analyzing trace with hash -631739882, now seen corresponding path program 3 times [2024-06-14 15:43:35,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:35,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001845740] [2024-06-14 15:43:35,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:35,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:42,036 INFO L134 CoverageAnalysis]: 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:42,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:42,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001845740] [2024-06-14 15:43:42,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001845740] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:42,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:42,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:43:42,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892635117] [2024-06-14 15:43:42,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:42,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:43:42,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:42,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:43:42,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:43:42,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:42,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 109 transitions, 893 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:42,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:42,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:42,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:42,459 INFO L124 PetriNetUnfolderBase]: 244/483 cut-off events. [2024-06-14 15:43:42,459 INFO L125 PetriNetUnfolderBase]: For 8638/8638 co-relation queries the response was YES. [2024-06-14 15:43:42,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 483 events. 244/483 cut-off events. For 8638/8638 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2241 event pairs, 39 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 2469. Up to 306 conditions per place. [2024-06-14 15:43:42,463 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 91 selfloop transitions, 25 changer transitions 0/120 dead transitions. [2024-06-14 15:43:42,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 120 transitions, 1217 flow [2024-06-14 15:43:42,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:43:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:43:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-14 15:43:42,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-14 15:43:42,465 INFO L175 Difference]: Start difference. First operand has 120 places, 109 transitions, 893 flow. Second operand 7 states and 99 transitions. [2024-06-14 15:43:42,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 120 transitions, 1217 flow [2024-06-14 15:43:42,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 120 transitions, 1163 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 15:43:42,480 INFO L231 Difference]: Finished difference. Result has 122 places, 110 transitions, 907 flow [2024-06-14 15:43:42,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=907, PETRI_PLACES=122, PETRI_TRANSITIONS=110} [2024-06-14 15:43:42,481 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 90 predicate places. [2024-06-14 15:43:42,482 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 110 transitions, 907 flow [2024-06-14 15:43:42,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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:42,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:42,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:42,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:43:42,482 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:43:42,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:42,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1949200052, now seen corresponding path program 1 times [2024-06-14 15:43:42,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:42,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667672444] [2024-06-14 15:43:42,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:42,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:49,449 INFO L134 CoverageAnalysis]: 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:49,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:49,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667672444] [2024-06-14 15:43:49,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667672444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:49,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:49,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:49,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886215433] [2024-06-14 15:43:49,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:49,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:49,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:49,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:49,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:49,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:49,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 110 transitions, 907 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:49,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:49,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:49,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:49,834 INFO L124 PetriNetUnfolderBase]: 242/480 cut-off events. [2024-06-14 15:43:49,835 INFO L125 PetriNetUnfolderBase]: For 8447/8447 co-relation queries the response was YES. [2024-06-14 15:43:49,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 480 events. 242/480 cut-off events. For 8447/8447 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2214 event pairs, 40 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 2445. Up to 296 conditions per place. [2024-06-14 15:43:49,838 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 68 selfloop transitions, 48 changer transitions 0/120 dead transitions. [2024-06-14 15:43:49,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 120 transitions, 1181 flow [2024-06-14 15:43:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:43:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:43:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-14 15:43:49,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-14 15:43:49,839 INFO L175 Difference]: Start difference. First operand has 122 places, 110 transitions, 907 flow. Second operand 8 states and 116 transitions. [2024-06-14 15:43:49,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 120 transitions, 1181 flow [2024-06-14 15:43:49,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 120 transitions, 1135 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 15:43:49,855 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 994 flow [2024-06-14 15:43:49,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=994, PETRI_PLACES=126, PETRI_TRANSITIONS=112} [2024-06-14 15:43:49,856 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2024-06-14 15:43:49,856 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 994 flow [2024-06-14 15:43:49,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:49,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:49,856 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:43:49,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:43:49,857 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:43:49,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1358871552, now seen corresponding path program 4 times [2024-06-14 15:43:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:49,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064538853] [2024-06-14 15:43:49,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:56,089 INFO L134 CoverageAnalysis]: 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,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:56,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064538853] [2024-06-14 15:43:56,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064538853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:56,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:56,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:43:56,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588526009] [2024-06-14 15:43:56,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:56,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:43:56,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:56,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:43:56,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:43:56,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:56,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 112 transitions, 994 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:56,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:56,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:56,551 INFO L124 PetriNetUnfolderBase]: 249/496 cut-off events. [2024-06-14 15:43:56,551 INFO L125 PetriNetUnfolderBase]: For 9455/9455 co-relation queries the response was YES. [2024-06-14 15:43:56,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2654 conditions, 496 events. 249/496 cut-off events. For 9455/9455 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2303 event pairs, 36 based on Foata normal form. 2/495 useless extension candidates. Maximal degree in co-relation 2594. Up to 384 conditions per place. [2024-06-14 15:43:56,554 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 93 selfloop transitions, 27 changer transitions 0/124 dead transitions. [2024-06-14 15:43:56,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 124 transitions, 1289 flow [2024-06-14 15:43:56,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:43:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:43:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-14 15:43:56,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-14 15:43:56,555 INFO L175 Difference]: Start difference. First operand has 126 places, 112 transitions, 994 flow. Second operand 8 states and 109 transitions. [2024-06-14 15:43:56,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 124 transitions, 1289 flow [2024-06-14 15:43:56,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 124 transitions, 1176 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:43:56,570 INFO L231 Difference]: Finished difference. Result has 127 places, 115 transitions, 974 flow [2024-06-14 15:43:56,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=974, PETRI_PLACES=127, PETRI_TRANSITIONS=115} [2024-06-14 15:43:56,570 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 95 predicate places. [2024-06-14 15:43:56,570 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 115 transitions, 974 flow [2024-06-14 15:43:56,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call 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,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:56,571 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:43:56,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:43:56,571 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:43:56,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1364233932, now seen corresponding path program 5 times [2024-06-14 15:43:56,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:56,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055338556] [2024-06-14 15:43:56,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:56,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:03,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:03,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055338556] [2024-06-14 15:44:03,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055338556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:03,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:03,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749772266] [2024-06-14 15:44:03,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:03,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:03,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:03,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:03,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:03,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:44:03,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 115 transitions, 974 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:03,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:03,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:44:03,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:03,566 INFO L124 PetriNetUnfolderBase]: 246/491 cut-off events. [2024-06-14 15:44:03,576 INFO L125 PetriNetUnfolderBase]: For 8418/8418 co-relation queries the response was YES. [2024-06-14 15:44:03,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2521 conditions, 491 events. 246/491 cut-off events. For 8418/8418 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2282 event pairs, 35 based on Foata normal form. 2/490 useless extension candidates. Maximal degree in co-relation 2461. Up to 379 conditions per place. [2024-06-14 15:44:03,579 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 96 selfloop transitions, 24 changer transitions 0/124 dead transitions. [2024-06-14 15:44:03,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 124 transitions, 1236 flow [2024-06-14 15:44:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-14 15:44:03,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053030303030303 [2024-06-14 15:44:03,582 INFO L175 Difference]: Start difference. First operand has 127 places, 115 transitions, 974 flow. Second operand 8 states and 107 transitions. [2024-06-14 15:44:03,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 124 transitions, 1236 flow [2024-06-14 15:44:03,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 124 transitions, 1172 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 15:44:03,596 INFO L231 Difference]: Finished difference. Result has 130 places, 115 transitions, 962 flow [2024-06-14 15:44:03,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=962, PETRI_PLACES=130, PETRI_TRANSITIONS=115} [2024-06-14 15:44:03,597 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 98 predicate places. [2024-06-14 15:44:03,597 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 115 transitions, 962 flow [2024-06-14 15:44:03,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:03,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:03,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:03,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:44:03,598 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:44:03,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:03,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1057765360, now seen corresponding path program 1 times [2024-06-14 15:44:03,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:03,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429862255] [2024-06-14 15:44:03,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:03,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:11,177 INFO L134 CoverageAnalysis]: 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:11,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429862255] [2024-06-14 15:44:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429862255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:11,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:11,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:44:11,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449631223] [2024-06-14 15:44:11,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:11,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:44:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:11,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:44:11,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:44:11,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:44:11,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 115 transitions, 962 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:11,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:11,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:44:11,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:11,685 INFO L124 PetriNetUnfolderBase]: 265/532 cut-off events. [2024-06-14 15:44:11,686 INFO L125 PetriNetUnfolderBase]: For 13037/13037 co-relation queries the response was YES. [2024-06-14 15:44:11,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 532 events. 265/532 cut-off events. For 13037/13037 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2527 event pairs, 39 based on Foata normal form. 11/540 useless extension candidates. Maximal degree in co-relation 2640. Up to 322 conditions per place. [2024-06-14 15:44:11,689 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 83 selfloop transitions, 39 changer transitions 6/132 dead transitions. [2024-06-14 15:44:11,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 132 transitions, 1320 flow [2024-06-14 15:44:11,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:44:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:44:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2024-06-14 15:44:11,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303 [2024-06-14 15:44:11,691 INFO L175 Difference]: Start difference. First operand has 130 places, 115 transitions, 962 flow. Second operand 10 states and 142 transitions. [2024-06-14 15:44:11,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 132 transitions, 1320 flow [2024-06-14 15:44:11,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 132 transitions, 1238 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 15:44:11,708 INFO L231 Difference]: Finished difference. Result has 133 places, 115 transitions, 980 flow [2024-06-14 15:44:11,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=980, PETRI_PLACES=133, PETRI_TRANSITIONS=115} [2024-06-14 15:44:11,709 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2024-06-14 15:44:11,709 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 115 transitions, 980 flow [2024-06-14 15:44:11,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:11,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:11,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:11,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:44:11,710 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:44:11,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1305926738, now seen corresponding path program 2 times [2024-06-14 15:44:11,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:11,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52743959] [2024-06-14 15:44:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:18,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:18,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52743959] [2024-06-14 15:44:18,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52743959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:18,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:18,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:44:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597411398] [2024-06-14 15:44:18,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:18,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:44:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:18,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:44:18,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:44:19,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:44:19,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 115 transitions, 980 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:19,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:19,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:44:19,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:19,341 INFO L124 PetriNetUnfolderBase]: 252/507 cut-off events. [2024-06-14 15:44:19,341 INFO L125 PetriNetUnfolderBase]: For 10102/10102 co-relation queries the response was YES. [2024-06-14 15:44:19,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2638 conditions, 507 events. 252/507 cut-off events. For 10102/10102 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2405 event pairs, 37 based on Foata normal form. 2/506 useless extension candidates. Maximal degree in co-relation 2576. Up to 385 conditions per place. [2024-06-14 15:44:19,345 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 91 selfloop transitions, 33 changer transitions 0/128 dead transitions. [2024-06-14 15:44:19,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 128 transitions, 1272 flow [2024-06-14 15:44:19,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:44:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:44:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:44:19,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-14 15:44:19,347 INFO L175 Difference]: Start difference. First operand has 133 places, 115 transitions, 980 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:44:19,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 128 transitions, 1272 flow [2024-06-14 15:44:19,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 128 transitions, 1184 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 15:44:19,367 INFO L231 Difference]: Finished difference. Result has 136 places, 116 transitions, 980 flow [2024-06-14 15:44:19,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=980, PETRI_PLACES=136, PETRI_TRANSITIONS=116} [2024-06-14 15:44:19,367 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 104 predicate places. [2024-06-14 15:44:19,367 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 116 transitions, 980 flow [2024-06-14 15:44:19,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:19,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:19,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:19,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:44:19,368 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:44:19,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1316381620, now seen corresponding path program 3 times [2024-06-14 15:44:19,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:19,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882821706] [2024-06-14 15:44:19,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:27,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:44:27,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:27,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882821706] [2024-06-14 15:44:27,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882821706] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:27,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:27,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:44:27,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998193772] [2024-06-14 15:44:27,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:27,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:44:27,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:27,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:44:27,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:44:27,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:44:27,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 116 transitions, 980 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:27,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:44:27,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:27,941 INFO L124 PetriNetUnfolderBase]: 290/584 cut-off events. [2024-06-14 15:44:27,942 INFO L125 PetriNetUnfolderBase]: For 17215/17215 co-relation queries the response was YES. [2024-06-14 15:44:27,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 584 events. 290/584 cut-off events. For 17215/17215 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2829 event pairs, 48 based on Foata normal form. 2/583 useless extension candidates. Maximal degree in co-relation 3276. Up to 291 conditions per place. [2024-06-14 15:44:27,946 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 80 selfloop transitions, 55 changer transitions 0/139 dead transitions. [2024-06-14 15:44:27,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 139 transitions, 1516 flow [2024-06-14 15:44:27,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:44:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:44:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2024-06-14 15:44:27,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 15:44:27,949 INFO L175 Difference]: Start difference. First operand has 136 places, 116 transitions, 980 flow. Second operand 12 states and 168 transitions. [2024-06-14 15:44:27,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 139 transitions, 1516 flow [2024-06-14 15:44:27,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 139 transitions, 1438 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 15:44:27,978 INFO L231 Difference]: Finished difference. Result has 140 places, 119 transitions, 1086 flow [2024-06-14 15:44:27,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1086, PETRI_PLACES=140, PETRI_TRANSITIONS=119} [2024-06-14 15:44:27,978 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2024-06-14 15:44:27,979 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 119 transitions, 1086 flow [2024-06-14 15:44:27,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:27,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:27,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:44:27,979 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:44:27,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:27,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1619625968, now seen corresponding path program 4 times [2024-06-14 15:44:27,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:27,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924799095] [2024-06-14 15:44:27,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:27,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:35,117 INFO L134 CoverageAnalysis]: 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:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:35,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924799095] [2024-06-14 15:44:35,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924799095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:35,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:35,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:44:35,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072928309] [2024-06-14 15:44:35,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:35,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:44:35,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:35,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:44:35,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:44:35,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:44:35,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 119 transitions, 1086 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:35,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:35,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:44:35,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:35,688 INFO L124 PetriNetUnfolderBase]: 294/590 cut-off events. [2024-06-14 15:44:35,688 INFO L125 PetriNetUnfolderBase]: For 18350/18350 co-relation queries the response was YES. [2024-06-14 15:44:35,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3505 conditions, 590 events. 294/590 cut-off events. For 18350/18350 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2866 event pairs, 50 based on Foata normal form. 2/589 useless extension candidates. Maximal degree in co-relation 3440. Up to 468 conditions per place. [2024-06-14 15:44:35,693 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 95 selfloop transitions, 33 changer transitions 0/132 dead transitions. [2024-06-14 15:44:35,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 132 transitions, 1390 flow [2024-06-14 15:44:35,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:44:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:44:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-14 15:44:35,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-14 15:44:35,694 INFO L175 Difference]: Start difference. First operand has 140 places, 119 transitions, 1086 flow. Second operand 11 states and 144 transitions. [2024-06-14 15:44:35,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 132 transitions, 1390 flow [2024-06-14 15:44:35,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 132 transitions, 1285 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:44:35,722 INFO L231 Difference]: Finished difference. Result has 143 places, 120 transitions, 1073 flow [2024-06-14 15:44:35,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1073, PETRI_PLACES=143, PETRI_TRANSITIONS=120} [2024-06-14 15:44:35,722 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-14 15:44:35,722 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 120 transitions, 1073 flow [2024-06-14 15:44:35,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:35,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:35,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:44:35,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:44:35,723 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:44:35,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash -74549848, now seen corresponding path program 5 times [2024-06-14 15:44:35,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:35,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342011896] [2024-06-14 15:44:35,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:35,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:42,164 INFO L134 CoverageAnalysis]: 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:42,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:42,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342011896] [2024-06-14 15:44:42,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342011896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:42,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:42,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:44:42,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885487779] [2024-06-14 15:44:42,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:42,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:44:42,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:42,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:44:42,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:44:42,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:44:42,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 120 transitions, 1073 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:42,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:42,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:44:42,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:42,704 INFO L124 PetriNetUnfolderBase]: 291/585 cut-off events. [2024-06-14 15:44:42,705 INFO L125 PetriNetUnfolderBase]: For 17774/17774 co-relation queries the response was YES. [2024-06-14 15:44:42,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3379 conditions, 585 events. 291/585 cut-off events. For 17774/17774 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2818 event pairs, 49 based on Foata normal form. 2/584 useless extension candidates. Maximal degree in co-relation 3313. Up to 454 conditions per place. [2024-06-14 15:44:42,709 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 91 selfloop transitions, 38 changer transitions 0/133 dead transitions. [2024-06-14 15:44:42,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 133 transitions, 1361 flow [2024-06-14 15:44:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:44:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:44:42,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 156 transitions. [2024-06-14 15:44:42,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 15:44:42,738 INFO L175 Difference]: Start difference. First operand has 143 places, 120 transitions, 1073 flow. Second operand 12 states and 156 transitions. [2024-06-14 15:44:42,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 133 transitions, 1361 flow [2024-06-14 15:44:42,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 133 transitions, 1281 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 15:44:42,767 INFO L231 Difference]: Finished difference. Result has 146 places, 120 transitions, 1073 flow [2024-06-14 15:44:42,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1073, PETRI_PLACES=146, PETRI_TRANSITIONS=120} [2024-06-14 15:44:42,768 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 114 predicate places. [2024-06-14 15:44:42,768 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 120 transitions, 1073 flow [2024-06-14 15:44:42,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:42,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:42,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:42,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:44:42,768 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:44:42,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash -295943730, now seen corresponding path program 1 times [2024-06-14 15:44:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:42,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611397619] [2024-06-14 15:44:42,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:42,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:48,862 INFO L134 CoverageAnalysis]: 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:48,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:48,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611397619] [2024-06-14 15:44:48,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611397619] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:48,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:48,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:44:48,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076587712] [2024-06-14 15:44:48,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:48,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:44:48,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:48,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:44:48,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:44:49,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:44:49,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 120 transitions, 1073 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:49,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:49,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:44:49,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:49,353 INFO L124 PetriNetUnfolderBase]: 295/590 cut-off events. [2024-06-14 15:44:49,354 INFO L125 PetriNetUnfolderBase]: For 18582/18582 co-relation queries the response was YES. [2024-06-14 15:44:49,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3411 conditions, 590 events. 295/590 cut-off events. For 18582/18582 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2870 event pairs, 33 based on Foata normal form. 2/588 useless extension candidates. Maximal degree in co-relation 3344. Up to 478 conditions per place. [2024-06-14 15:44:49,359 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 118 selfloop transitions, 11 changer transitions 0/133 dead transitions. [2024-06-14 15:44:49,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 133 transitions, 1365 flow [2024-06-14 15:44:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:49,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-14 15:44:49,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 15:44:49,361 INFO L175 Difference]: Start difference. First operand has 146 places, 120 transitions, 1073 flow. Second operand 8 states and 104 transitions. [2024-06-14 15:44:49,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 133 transitions, 1365 flow [2024-06-14 15:44:49,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 133 transitions, 1240 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-14 15:44:49,391 INFO L231 Difference]: Finished difference. Result has 142 places, 121 transitions, 982 flow [2024-06-14 15:44:49,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=982, PETRI_PLACES=142, PETRI_TRANSITIONS=121} [2024-06-14 15:44:49,392 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 110 predicate places. [2024-06-14 15:44:49,393 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 121 transitions, 982 flow [2024-06-14 15:44:49,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:49,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:49,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:49,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:44:49,393 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:44:49,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1891020972, now seen corresponding path program 2 times [2024-06-14 15:44:49,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:49,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477123766] [2024-06-14 15:44:49,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:49,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:56,113 INFO L134 CoverageAnalysis]: 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:56,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:56,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477123766] [2024-06-14 15:44:56,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477123766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:56,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:56,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:44:56,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106557945] [2024-06-14 15:44:56,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:56,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:44:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:56,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:44:56,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:44:56,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:44:56,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 121 transitions, 982 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:56,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:56,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:44:56,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:56,583 INFO L124 PetriNetUnfolderBase]: 270/539 cut-off events. [2024-06-14 15:44:56,583 INFO L125 PetriNetUnfolderBase]: For 12082/12082 co-relation queries the response was YES. [2024-06-14 15:44:56,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 539 events. 270/539 cut-off events. For 12082/12082 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2603 event pairs, 40 based on Foata normal form. 2/537 useless extension candidates. Maximal degree in co-relation 2627. Up to 417 conditions per place. [2024-06-14 15:44:56,587 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 97 selfloop transitions, 30 changer transitions 0/131 dead transitions. [2024-06-14 15:44:56,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 131 transitions, 1266 flow [2024-06-14 15:44:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-14 15:44:56,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2024-06-14 15:44:56,588 INFO L175 Difference]: Start difference. First operand has 142 places, 121 transitions, 982 flow. Second operand 8 states and 113 transitions. [2024-06-14 15:44:56,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 131 transitions, 1266 flow [2024-06-14 15:44:56,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 131 transitions, 1233 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:44:56,612 INFO L231 Difference]: Finished difference. Result has 143 places, 122 transitions, 1023 flow [2024-06-14 15:44:56,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1023, PETRI_PLACES=143, PETRI_TRANSITIONS=122} [2024-06-14 15:44:56,615 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-14 15:44:56,615 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 122 transitions, 1023 flow [2024-06-14 15:44:56,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:56,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:56,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:56,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:44:56,617 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:44:56,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:56,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1895484972, now seen corresponding path program 3 times [2024-06-14 15:44:56,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:56,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829499411] [2024-06-14 15:44:56,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:56,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:02,886 INFO L134 CoverageAnalysis]: 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:02,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:02,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829499411] [2024-06-14 15:45:02,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829499411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:02,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:02,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:02,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156613777] [2024-06-14 15:45:02,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:02,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:02,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:02,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:02,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:03,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:03,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 122 transitions, 1023 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:03,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:03,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:03,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:03,346 INFO L124 PetriNetUnfolderBase]: 281/560 cut-off events. [2024-06-14 15:45:03,346 INFO L125 PetriNetUnfolderBase]: For 13713/13713 co-relation queries the response was YES. [2024-06-14 15:45:03,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2882 conditions, 560 events. 281/560 cut-off events. For 13713/13713 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2713 event pairs, 41 based on Foata normal form. 2/558 useless extension candidates. Maximal degree in co-relation 2815. Up to 358 conditions per place. [2024-06-14 15:45:03,354 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 90 selfloop transitions, 41 changer transitions 0/135 dead transitions. [2024-06-14 15:45:03,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 135 transitions, 1407 flow [2024-06-14 15:45:03,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:45:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:45:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2024-06-14 15:45:03,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-14 15:45:03,356 INFO L175 Difference]: Start difference. First operand has 143 places, 122 transitions, 1023 flow. Second operand 8 states and 114 transitions. [2024-06-14 15:45:03,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 135 transitions, 1407 flow [2024-06-14 15:45:03,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 135 transitions, 1358 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:45:03,382 INFO L231 Difference]: Finished difference. Result has 146 places, 124 transitions, 1084 flow [2024-06-14 15:45:03,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1084, PETRI_PLACES=146, PETRI_TRANSITIONS=124} [2024-06-14 15:45:03,383 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 114 predicate places. [2024-06-14 15:45:03,383 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 124 transitions, 1084 flow [2024-06-14 15:45:03,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:03,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:03,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:03,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:45:03,384 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:45:03,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:03,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1890901002, now seen corresponding path program 4 times [2024-06-14 15:45:03,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:03,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822389276] [2024-06-14 15:45:03,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:03,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:09,912 INFO L134 CoverageAnalysis]: 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:09,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:09,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822389276] [2024-06-14 15:45:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822389276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:09,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:09,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:09,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751361282] [2024-06-14 15:45:09,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:09,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:09,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:09,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:09,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:10,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:10,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 124 transitions, 1084 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:10,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:10,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:10,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:10,272 INFO L124 PetriNetUnfolderBase]: 285/568 cut-off events. [2024-06-14 15:45:10,273 INFO L125 PetriNetUnfolderBase]: For 14595/14595 co-relation queries the response was YES. [2024-06-14 15:45:10,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2973 conditions, 568 events. 285/568 cut-off events. For 14595/14595 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2775 event pairs, 41 based on Foata normal form. 2/566 useless extension candidates. Maximal degree in co-relation 2905. Up to 301 conditions per place. [2024-06-14 15:45:10,277 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 99 selfloop transitions, 34 changer transitions 0/137 dead transitions. [2024-06-14 15:45:10,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 137 transitions, 1468 flow [2024-06-14 15:45:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:45:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:45:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-14 15:45:10,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 15:45:10,280 INFO L175 Difference]: Start difference. First operand has 146 places, 124 transitions, 1084 flow. Second operand 8 states and 112 transitions. [2024-06-14 15:45:10,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 137 transitions, 1468 flow [2024-06-14 15:45:10,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 137 transitions, 1408 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-14 15:45:10,308 INFO L231 Difference]: Finished difference. Result has 150 places, 125 transitions, 1108 flow [2024-06-14 15:45:10,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1108, PETRI_PLACES=150, PETRI_TRANSITIONS=125} [2024-06-14 15:45:10,309 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 118 predicate places. [2024-06-14 15:45:10,309 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 125 transitions, 1108 flow [2024-06-14 15:45:10,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:10,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:10,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:10,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:45:10,310 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:45:10,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:10,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1895669546, now seen corresponding path program 1 times [2024-06-14 15:45:10,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:10,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655242925] [2024-06-14 15:45:10,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:10,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:16,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:16,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655242925] [2024-06-14 15:45:16,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655242925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:16,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:16,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:16,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154710402] [2024-06-14 15:45:16,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:16,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:16,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:16,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:16,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:16,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:16,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 125 transitions, 1108 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:16,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:16,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:16,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:17,279 INFO L124 PetriNetUnfolderBase]: 288/575 cut-off events. [2024-06-14 15:45:17,279 INFO L125 PetriNetUnfolderBase]: For 14699/14699 co-relation queries the response was YES. [2024-06-14 15:45:17,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3082 conditions, 575 events. 288/575 cut-off events. For 14699/14699 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2824 event pairs, 42 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 3012. Up to 430 conditions per place. [2024-06-14 15:45:17,284 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 89 selfloop transitions, 43 changer transitions 0/136 dead transitions. [2024-06-14 15:45:17,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 136 transitions, 1430 flow [2024-06-14 15:45:17,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2024-06-14 15:45:17,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-14 15:45:17,298 INFO L175 Difference]: Start difference. First operand has 150 places, 125 transitions, 1108 flow. Second operand 9 states and 129 transitions. [2024-06-14 15:45:17,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 136 transitions, 1430 flow [2024-06-14 15:45:17,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 136 transitions, 1370 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 15:45:17,329 INFO L231 Difference]: Finished difference. Result has 154 places, 127 transitions, 1183 flow [2024-06-14 15:45:17,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1183, PETRI_PLACES=154, PETRI_TRANSITIONS=127} [2024-06-14 15:45:17,329 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 122 predicate places. [2024-06-14 15:45:17,330 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 127 transitions, 1183 flow [2024-06-14 15:45:17,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:17,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:17,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:17,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:45:17,330 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:45:17,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:17,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1525078390, now seen corresponding path program 5 times [2024-06-14 15:45:17,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:17,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895361100] [2024-06-14 15:45:17,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:17,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:22,831 INFO L134 CoverageAnalysis]: 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:22,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:22,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895361100] [2024-06-14 15:45:22,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895361100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:22,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:22,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:22,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999398190] [2024-06-14 15:45:22,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:22,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:22,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:22,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:22,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:22,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:22,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 127 transitions, 1183 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:22,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:22,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:22,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:23,245 INFO L124 PetriNetUnfolderBase]: 295/591 cut-off events. [2024-06-14 15:45:23,246 INFO L125 PetriNetUnfolderBase]: For 16066/16066 co-relation queries the response was YES. [2024-06-14 15:45:23,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 591 events. 295/591 cut-off events. For 16066/16066 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2898 event pairs, 40 based on Foata normal form. 2/590 useless extension candidates. Maximal degree in co-relation 3131. Up to 447 conditions per place. [2024-06-14 15:45:23,250 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 99 selfloop transitions, 37 changer transitions 0/140 dead transitions. [2024-06-14 15:45:23,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 140 transitions, 1509 flow [2024-06-14 15:45:23,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-14 15:45:23,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-14 15:45:23,258 INFO L175 Difference]: Start difference. First operand has 154 places, 127 transitions, 1183 flow. Second operand 9 states and 123 transitions. [2024-06-14 15:45:23,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 140 transitions, 1509 flow [2024-06-14 15:45:23,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 140 transitions, 1405 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 15:45:23,287 INFO L231 Difference]: Finished difference. Result has 156 places, 130 transitions, 1189 flow [2024-06-14 15:45:23,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1189, PETRI_PLACES=156, PETRI_TRANSITIONS=130} [2024-06-14 15:45:23,288 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 124 predicate places. [2024-06-14 15:45:23,288 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 130 transitions, 1189 flow [2024-06-14 15:45:23,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:23,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:23,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:23,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:45:23,289 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:45:23,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:23,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1752979540, now seen corresponding path program 6 times [2024-06-14 15:45:23,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:23,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581949593] [2024-06-14 15:45:23,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:23,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:29,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:29,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581949593] [2024-06-14 15:45:29,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581949593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:29,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:29,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:29,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852851926] [2024-06-14 15:45:29,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:29,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:29,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:29,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:29,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:29,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:29,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 130 transitions, 1189 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:29,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:29,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:29,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:30,042 INFO L124 PetriNetUnfolderBase]: 302/604 cut-off events. [2024-06-14 15:45:30,042 INFO L125 PetriNetUnfolderBase]: For 16952/16952 co-relation queries the response was YES. [2024-06-14 15:45:30,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3264 conditions, 604 events. 302/604 cut-off events. For 16952/16952 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3002 event pairs, 38 based on Foata normal form. 2/603 useless extension candidates. Maximal degree in co-relation 3192. Up to 459 conditions per place. [2024-06-14 15:45:30,047 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 101 selfloop transitions, 38 changer transitions 0/143 dead transitions. [2024-06-14 15:45:30,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 143 transitions, 1526 flow [2024-06-14 15:45:30,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:30,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-14 15:45:30,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-14 15:45:30,054 INFO L175 Difference]: Start difference. First operand has 156 places, 130 transitions, 1189 flow. Second operand 9 states and 123 transitions. [2024-06-14 15:45:30,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 143 transitions, 1526 flow [2024-06-14 15:45:30,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 143 transitions, 1444 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:45:30,088 INFO L231 Difference]: Finished difference. Result has 159 places, 133 transitions, 1224 flow [2024-06-14 15:45:30,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1224, PETRI_PLACES=159, PETRI_TRANSITIONS=133} [2024-06-14 15:45:30,089 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 127 predicate places. [2024-06-14 15:45:30,089 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 133 transitions, 1224 flow [2024-06-14 15:45:30,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:30,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:30,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:30,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:45:30,090 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:45:30,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:30,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1975874800, now seen corresponding path program 7 times [2024-06-14 15:45:30,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:30,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727048550] [2024-06-14 15:45:30,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:30,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:36,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:45:36,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:36,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727048550] [2024-06-14 15:45:36,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727048550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:36,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:36,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:36,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776425131] [2024-06-14 15:45:36,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:36,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:36,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:36,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:36,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:36,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:36,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 133 transitions, 1224 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:36,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:36,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:36,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:37,160 INFO L124 PetriNetUnfolderBase]: 299/599 cut-off events. [2024-06-14 15:45:37,161 INFO L125 PetriNetUnfolderBase]: For 15824/15824 co-relation queries the response was YES. [2024-06-14 15:45:37,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3169 conditions, 599 events. 299/599 cut-off events. For 15824/15824 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2976 event pairs, 39 based on Foata normal form. 2/598 useless extension candidates. Maximal degree in co-relation 3096. Up to 454 conditions per place. [2024-06-14 15:45:37,166 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 103 selfloop transitions, 36 changer transitions 0/143 dead transitions. [2024-06-14 15:45:37,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 143 transitions, 1526 flow [2024-06-14 15:45:37,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-14 15:45:37,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-14 15:45:37,168 INFO L175 Difference]: Start difference. First operand has 159 places, 133 transitions, 1224 flow. Second operand 9 states and 120 transitions. [2024-06-14 15:45:37,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 143 transitions, 1526 flow [2024-06-14 15:45:37,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 143 transitions, 1456 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 15:45:37,200 INFO L231 Difference]: Finished difference. Result has 163 places, 133 transitions, 1230 flow [2024-06-14 15:45:37,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1230, PETRI_PLACES=163, PETRI_TRANSITIONS=133} [2024-06-14 15:45:37,201 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-14 15:45:37,201 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 133 transitions, 1230 flow [2024-06-14 15:45:37,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:37,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:37,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:37,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:45:37,202 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:45:37,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:37,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1516500566, now seen corresponding path program 2 times [2024-06-14 15:45:37,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:37,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023622994] [2024-06-14 15:45:37,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:37,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:43,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:43,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:43,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023622994] [2024-06-14 15:45:43,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023622994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:43,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:43,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:43,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377294466] [2024-06-14 15:45:43,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:43,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:43,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:43,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:43,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:44,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:44,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 133 transitions, 1230 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:44,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:44,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:44,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:44,300 INFO L124 PetriNetUnfolderBase]: 302/606 cut-off events. [2024-06-14 15:45:44,301 INFO L125 PetriNetUnfolderBase]: For 15632/15632 co-relation queries the response was YES. [2024-06-14 15:45:44,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3228 conditions, 606 events. 302/606 cut-off events. For 15632/15632 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3019 event pairs, 39 based on Foata normal form. 1/604 useless extension candidates. Maximal degree in co-relation 3154. Up to 416 conditions per place. [2024-06-14 15:45:44,305 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 89 selfloop transitions, 52 changer transitions 0/145 dead transitions. [2024-06-14 15:45:44,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 145 transitions, 1576 flow [2024-06-14 15:45:44,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:45:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:45:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-14 15:45:44,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2024-06-14 15:45:44,307 INFO L175 Difference]: Start difference. First operand has 163 places, 133 transitions, 1230 flow. Second operand 10 states and 139 transitions. [2024-06-14 15:45:44,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 145 transitions, 1576 flow [2024-06-14 15:45:44,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 145 transitions, 1478 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:45:44,347 INFO L231 Difference]: Finished difference. Result has 163 places, 135 transitions, 1285 flow [2024-06-14 15:45:44,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1285, PETRI_PLACES=163, PETRI_TRANSITIONS=135} [2024-06-14 15:45:44,348 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-14 15:45:44,348 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 135 transitions, 1285 flow [2024-06-14 15:45:44,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:44,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:44,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:44,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:45:44,349 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:45:44,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:44,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1805678736, now seen corresponding path program 8 times [2024-06-14 15:45:44,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:44,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848148443] [2024-06-14 15:45:44,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:44,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:50,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848148443] [2024-06-14 15:45:50,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848148443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:50,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:50,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:50,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569234886] [2024-06-14 15:45:50,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:50,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:50,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:50,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:50,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:50,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:50,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 135 transitions, 1285 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:50,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:50,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:50,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:50,954 INFO L124 PetriNetUnfolderBase]: 306/614 cut-off events. [2024-06-14 15:45:50,954 INFO L125 PetriNetUnfolderBase]: For 17454/17454 co-relation queries the response was YES. [2024-06-14 15:45:50,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3278 conditions, 614 events. 306/614 cut-off events. For 17454/17454 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3070 event pairs, 37 based on Foata normal form. 2/613 useless extension candidates. Maximal degree in co-relation 3206. Up to 442 conditions per place. [2024-06-14 15:45:50,959 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 107 selfloop transitions, 37 changer transitions 0/148 dead transitions. [2024-06-14 15:45:50,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 148 transitions, 1702 flow [2024-06-14 15:45:50,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:50,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2024-06-14 15:45:50,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 15:45:50,961 INFO L175 Difference]: Start difference. First operand has 163 places, 135 transitions, 1285 flow. Second operand 9 states and 126 transitions. [2024-06-14 15:45:50,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 148 transitions, 1702 flow [2024-06-14 15:45:51,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 148 transitions, 1565 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-14 15:45:51,026 INFO L231 Difference]: Finished difference. Result has 164 places, 136 transitions, 1237 flow [2024-06-14 15:45:51,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1237, PETRI_PLACES=164, PETRI_TRANSITIONS=136} [2024-06-14 15:45:51,027 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2024-06-14 15:45:51,027 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 136 transitions, 1237 flow [2024-06-14 15:45:51,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:51,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:51,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:51,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:45:51,027 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:45:51,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:51,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1805501106, now seen corresponding path program 9 times [2024-06-14 15:45:51,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:51,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420577692] [2024-06-14 15:45:51,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:51,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:57,623 INFO L134 CoverageAnalysis]: 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:57,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:57,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420577692] [2024-06-14 15:45:57,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420577692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:57,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:57,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:57,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713222165] [2024-06-14 15:45:57,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:57,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:57,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:57,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:57,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:57,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:57,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 136 transitions, 1237 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:57,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:57,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:57,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:57,966 INFO L124 PetriNetUnfolderBase]: 313/629 cut-off events. [2024-06-14 15:45:57,967 INFO L125 PetriNetUnfolderBase]: For 18149/18149 co-relation queries the response was YES. [2024-06-14 15:45:57,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3309 conditions, 629 events. 313/629 cut-off events. For 18149/18149 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3151 event pairs, 39 based on Foata normal form. 2/628 useless extension candidates. Maximal degree in co-relation 3236. Up to 479 conditions per place. [2024-06-14 15:45:57,973 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 108 selfloop transitions, 37 changer transitions 0/149 dead transitions. [2024-06-14 15:45:57,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 149 transitions, 1586 flow [2024-06-14 15:45:57,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-14 15:45:57,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-14 15:45:57,975 INFO L175 Difference]: Start difference. First operand has 164 places, 136 transitions, 1237 flow. Second operand 9 states and 123 transitions. [2024-06-14 15:45:57,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 149 transitions, 1586 flow [2024-06-14 15:45:58,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 149 transitions, 1405 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:45:58,027 INFO L231 Difference]: Finished difference. Result has 163 places, 139 transitions, 1171 flow [2024-06-14 15:45:58,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1171, PETRI_PLACES=163, PETRI_TRANSITIONS=139} [2024-06-14 15:45:58,027 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2024-06-14 15:45:58,027 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 139 transitions, 1171 flow [2024-06-14 15:45:58,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:58,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:58,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:58,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:45:58,028 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:45:58,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1820435466, now seen corresponding path program 10 times [2024-06-14 15:45:58,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:58,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713924559] [2024-06-14 15:45:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:58,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:04,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:46:04,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:04,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713924559] [2024-06-14 15:46:04,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713924559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:04,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:04,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:46:04,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374451416] [2024-06-14 15:46:04,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:04,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:46:04,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:04,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:46:04,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:46:04,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 15:46:04,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 139 transitions, 1171 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:04,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:04,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 15:46:04,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:04,782 INFO L124 PetriNetUnfolderBase]: 317/637 cut-off events. [2024-06-14 15:46:04,783 INFO L125 PetriNetUnfolderBase]: For 18667/18667 co-relation queries the response was YES. [2024-06-14 15:46:04,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3214 conditions, 637 events. 317/637 cut-off events. For 18667/18667 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3205 event pairs, 39 based on Foata normal form. 2/636 useless extension candidates. Maximal degree in co-relation 3141. Up to 487 conditions per place. [2024-06-14 15:46:04,788 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 106 selfloop transitions, 41 changer transitions 0/151 dead transitions. [2024-06-14 15:46:04,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 151 transitions, 1502 flow [2024-06-14 15:46:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:46:04,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:46:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:46:04,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-14 15:46:04,799 INFO L175 Difference]: Start difference. First operand has 163 places, 139 transitions, 1171 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:46:04,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 151 transitions, 1502 flow [2024-06-14 15:46:04,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 151 transitions, 1426 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 15:46:04,845 INFO L231 Difference]: Finished difference. Result has 167 places, 140 transitions, 1194 flow [2024-06-14 15:46:04,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1194, PETRI_PLACES=167, PETRI_TRANSITIONS=140} [2024-06-14 15:46:04,846 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2024-06-14 15:46:04,846 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 140 transitions, 1194 flow [2024-06-14 15:46:04,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:04,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:04,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:04,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:46:04,846 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:46:04,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1577599956, now seen corresponding path program 11 times [2024-06-14 15:46:04,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:04,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506101545] [2024-06-14 15:46:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:04,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:11,675 INFO L134 CoverageAnalysis]: 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:11,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:11,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506101545] [2024-06-14 15:46:11,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506101545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:11,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:11,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:11,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053962929] [2024-06-14 15:46:11,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:11,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:11,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:11,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:11,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:11,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:11,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 140 transitions, 1194 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:11,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:11,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:11,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:12,034 INFO L124 PetriNetUnfolderBase]: 314/630 cut-off events. [2024-06-14 15:46:12,034 INFO L125 PetriNetUnfolderBase]: For 17081/17081 co-relation queries the response was YES. [2024-06-14 15:46:12,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3121 conditions, 630 events. 314/630 cut-off events. For 17081/17081 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3176 event pairs, 38 based on Foata normal form. 2/629 useless extension candidates. Maximal degree in co-relation 3047. Up to 482 conditions per place. [2024-06-14 15:46:12,039 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 110 selfloop transitions, 36 changer transitions 0/150 dead transitions. [2024-06-14 15:46:12,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 150 transitions, 1510 flow [2024-06-14 15:46:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:12,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-14 15:46:12,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-14 15:46:12,040 INFO L175 Difference]: Start difference. First operand has 167 places, 140 transitions, 1194 flow. Second operand 9 states and 123 transitions. [2024-06-14 15:46:12,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 150 transitions, 1510 flow [2024-06-14 15:46:12,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 150 transitions, 1403 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 15:46:12,085 INFO L231 Difference]: Finished difference. Result has 167 places, 140 transitions, 1163 flow [2024-06-14 15:46:12,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1163, PETRI_PLACES=167, PETRI_TRANSITIONS=140} [2024-06-14 15:46:12,086 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2024-06-14 15:46:12,087 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 140 transitions, 1163 flow [2024-06-14 15:46:12,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:12,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:12,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:12,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:46:12,087 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:46:12,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:12,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1828716620, now seen corresponding path program 3 times [2024-06-14 15:46:12,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:12,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622221228] [2024-06-14 15:46:12,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:12,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:19,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:19,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622221228] [2024-06-14 15:46:19,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622221228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:19,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:19,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:46:19,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778689173] [2024-06-14 15:46:19,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:19,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:46:19,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:19,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:46:19,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:46:20,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:20,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 140 transitions, 1163 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:20,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:20,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:20,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:20,526 INFO L124 PetriNetUnfolderBase]: 320/639 cut-off events. [2024-06-14 15:46:20,527 INFO L125 PetriNetUnfolderBase]: For 16633/16633 co-relation queries the response was YES. [2024-06-14 15:46:20,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3161 conditions, 639 events. 320/639 cut-off events. For 16633/16633 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3252 event pairs, 42 based on Foata normal form. 1/636 useless extension candidates. Maximal degree in co-relation 3086. Up to 431 conditions per place. [2024-06-14 15:46:20,532 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 95 selfloop transitions, 56 changer transitions 0/155 dead transitions. [2024-06-14 15:46:20,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 155 transitions, 1547 flow [2024-06-14 15:46:20,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-14 15:46:20,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41597796143250687 [2024-06-14 15:46:20,533 INFO L175 Difference]: Start difference. First operand has 167 places, 140 transitions, 1163 flow. Second operand 11 states and 151 transitions. [2024-06-14 15:46:20,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 155 transitions, 1547 flow [2024-06-14 15:46:20,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 155 transitions, 1417 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:46:20,577 INFO L231 Difference]: Finished difference. Result has 168 places, 144 transitions, 1210 flow [2024-06-14 15:46:20,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1210, PETRI_PLACES=168, PETRI_TRANSITIONS=144} [2024-06-14 15:46:20,577 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 136 predicate places. [2024-06-14 15:46:20,577 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 144 transitions, 1210 flow [2024-06-14 15:46:20,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:20,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:20,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:20,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:46:20,579 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:46:20,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:20,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1829013290, now seen corresponding path program 4 times [2024-06-14 15:46:20,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:20,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331780198] [2024-06-14 15:46:20,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:20,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:26,850 INFO L134 CoverageAnalysis]: 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,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:26,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331780198] [2024-06-14 15:46:26,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331780198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:26,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:26,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:46:26,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708034830] [2024-06-14 15:46:26,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:26,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:46:26,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:26,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:46:26,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:46:27,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:27,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 144 transitions, 1210 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:27,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:27,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:27,480 INFO L124 PetriNetUnfolderBase]: 328/654 cut-off events. [2024-06-14 15:46:27,481 INFO L125 PetriNetUnfolderBase]: For 18962/18962 co-relation queries the response was YES. [2024-06-14 15:46:27,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 654 events. 328/654 cut-off events. For 18962/18962 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3348 event pairs, 42 based on Foata normal form. 1/651 useless extension candidates. Maximal degree in co-relation 3283. Up to 434 conditions per place. [2024-06-14 15:46:27,486 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 95 selfloop transitions, 61 changer transitions 0/160 dead transitions. [2024-06-14 15:46:27,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 160 transitions, 1746 flow [2024-06-14 15:46:27,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 153 transitions. [2024-06-14 15:46:27,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4214876033057851 [2024-06-14 15:46:27,487 INFO L175 Difference]: Start difference. First operand has 168 places, 144 transitions, 1210 flow. Second operand 11 states and 153 transitions. [2024-06-14 15:46:27,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 160 transitions, 1746 flow [2024-06-14 15:46:27,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 160 transitions, 1597 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-14 15:46:27,532 INFO L231 Difference]: Finished difference. Result has 171 places, 148 transitions, 1288 flow [2024-06-14 15:46:27,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1288, PETRI_PLACES=171, PETRI_TRANSITIONS=148} [2024-06-14 15:46:27,533 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 139 predicate places. [2024-06-14 15:46:27,533 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 148 transitions, 1288 flow [2024-06-14 15:46:27,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:27,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:27,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:46:27,533 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:46:27,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:27,534 INFO L85 PathProgramCache]: Analyzing trace with hash -988913878, now seen corresponding path program 5 times [2024-06-14 15:46:27,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:27,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709819715] [2024-06-14 15:46:27,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:27,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:33,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:33,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709819715] [2024-06-14 15:46:33,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709819715] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:33,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:33,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:46:33,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628624331] [2024-06-14 15:46:33,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:33,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:46:33,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:33,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:46:33,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:46:33,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:33,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 148 transitions, 1288 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:33,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:33,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:34,252 INFO L124 PetriNetUnfolderBase]: 336/671 cut-off events. [2024-06-14 15:46:34,253 INFO L125 PetriNetUnfolderBase]: For 21554/21554 co-relation queries the response was YES. [2024-06-14 15:46:34,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3570 conditions, 671 events. 336/671 cut-off events. For 21554/21554 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3463 event pairs, 42 based on Foata normal form. 1/668 useless extension candidates. Maximal degree in co-relation 3493. Up to 428 conditions per place. [2024-06-14 15:46:34,258 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 88 selfloop transitions, 73 changer transitions 0/165 dead transitions. [2024-06-14 15:46:34,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 165 transitions, 1846 flow [2024-06-14 15:46:34,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:46:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:46:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2024-06-14 15:46:34,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-14 15:46:34,259 INFO L175 Difference]: Start difference. First operand has 171 places, 148 transitions, 1288 flow. Second operand 12 states and 164 transitions. [2024-06-14 15:46:34,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 165 transitions, 1846 flow [2024-06-14 15:46:34,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 165 transitions, 1703 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:34,312 INFO L231 Difference]: Finished difference. Result has 176 places, 152 transitions, 1404 flow [2024-06-14 15:46:34,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1404, PETRI_PLACES=176, PETRI_TRANSITIONS=152} [2024-06-14 15:46:34,313 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 144 predicate places. [2024-06-14 15:46:34,313 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 152 transitions, 1404 flow [2024-06-14 15:46:34,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:34,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:34,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:34,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:46:34,314 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:46:34,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:34,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1569022132, now seen corresponding path program 6 times [2024-06-14 15:46:34,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:34,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213518255] [2024-06-14 15:46:34,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:34,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:40,963 INFO L134 CoverageAnalysis]: 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:40,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:40,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213518255] [2024-06-14 15:46:40,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213518255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:40,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:40,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:46:40,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126657185] [2024-06-14 15:46:40,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:40,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:46:40,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:40,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:46:40,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:46:41,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:41,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 152 transitions, 1404 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:41,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:41,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:41,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:41,394 INFO L124 PetriNetUnfolderBase]: 334/668 cut-off events. [2024-06-14 15:46:41,394 INFO L125 PetriNetUnfolderBase]: For 20455/20455 co-relation queries the response was YES. [2024-06-14 15:46:41,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3551 conditions, 668 events. 334/668 cut-off events. For 20455/20455 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3454 event pairs, 42 based on Foata normal form. 1/665 useless extension candidates. Maximal degree in co-relation 3472. Up to 451 conditions per place. [2024-06-14 15:46:41,400 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 109 selfloop transitions, 51 changer transitions 0/164 dead transitions. [2024-06-14 15:46:41,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 164 transitions, 1800 flow [2024-06-14 15:46:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:46:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:46:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-14 15:46:41,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-14 15:46:41,402 INFO L175 Difference]: Start difference. First operand has 176 places, 152 transitions, 1404 flow. Second operand 10 states and 138 transitions. [2024-06-14 15:46:41,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 164 transitions, 1800 flow [2024-06-14 15:46:41,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 164 transitions, 1654 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-14 15:46:41,453 INFO L231 Difference]: Finished difference. Result has 178 places, 154 transitions, 1421 flow [2024-06-14 15:46:41,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1421, PETRI_PLACES=178, PETRI_TRANSITIONS=154} [2024-06-14 15:46:41,454 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 146 predicate places. [2024-06-14 15:46:41,454 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 154 transitions, 1421 flow [2024-06-14 15:46:41,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:41,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:41,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:41,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:46:41,455 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:46:41,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:41,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1857310462, now seen corresponding path program 7 times [2024-06-14 15:46:41,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:41,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48533308] [2024-06-14 15:46:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:41,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:47,720 INFO L134 CoverageAnalysis]: 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:47,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:47,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48533308] [2024-06-14 15:46:47,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48533308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:47,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:47,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:46:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021257889] [2024-06-14 15:46:47,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:47,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:46:47,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:47,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:46:47,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:46:47,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:47,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 154 transitions, 1421 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:47,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:47,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:47,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:48,259 INFO L124 PetriNetUnfolderBase]: 332/665 cut-off events. [2024-06-14 15:46:48,259 INFO L125 PetriNetUnfolderBase]: For 19326/19326 co-relation queries the response was YES. [2024-06-14 15:46:48,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3479 conditions, 665 events. 332/665 cut-off events. For 19326/19326 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3451 event pairs, 42 based on Foata normal form. 1/662 useless extension candidates. Maximal degree in co-relation 3398. Up to 451 conditions per place. [2024-06-14 15:46:48,264 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 104 selfloop transitions, 57 changer transitions 0/165 dead transitions. [2024-06-14 15:46:48,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 165 transitions, 1769 flow [2024-06-14 15:46:48,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:48,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-14 15:46:48,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-14 15:46:48,265 INFO L175 Difference]: Start difference. First operand has 178 places, 154 transitions, 1421 flow. Second operand 11 states and 150 transitions. [2024-06-14 15:46:48,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 165 transitions, 1769 flow [2024-06-14 15:46:48,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 165 transitions, 1602 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-14 15:46:48,331 INFO L231 Difference]: Finished difference. Result has 181 places, 154 transitions, 1373 flow [2024-06-14 15:46:48,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1373, PETRI_PLACES=181, PETRI_TRANSITIONS=154} [2024-06-14 15:46:48,332 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-14 15:46:48,332 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 154 transitions, 1373 flow [2024-06-14 15:46:48,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:48,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:48,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:48,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:46:48,333 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:46:48,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:48,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1767965896, now seen corresponding path program 8 times [2024-06-14 15:46:48,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:48,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447143928] [2024-06-14 15:46:48,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:48,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:54,258 INFO L134 CoverageAnalysis]: 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:54,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:54,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447143928] [2024-06-14 15:46:54,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447143928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:54,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:54,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:46:54,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608529081] [2024-06-14 15:46:54,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:54,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:46:54,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:54,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:46:54,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:46:54,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:54,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 154 transitions, 1373 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:54,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:54,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:54,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:54,817 INFO L124 PetriNetUnfolderBase]: 330/665 cut-off events. [2024-06-14 15:46:54,818 INFO L125 PetriNetUnfolderBase]: For 18139/18139 co-relation queries the response was YES. [2024-06-14 15:46:54,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3366 conditions, 665 events. 330/665 cut-off events. For 18139/18139 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3429 event pairs, 38 based on Foata normal form. 1/663 useless extension candidates. Maximal degree in co-relation 3284. Up to 465 conditions per place. [2024-06-14 15:46:54,823 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 108 selfloop transitions, 54 changer transitions 0/166 dead transitions. [2024-06-14 15:46:54,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 166 transitions, 1833 flow [2024-06-14 15:46:54,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-14 15:46:54,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41597796143250687 [2024-06-14 15:46:54,827 INFO L175 Difference]: Start difference. First operand has 181 places, 154 transitions, 1373 flow. Second operand 11 states and 151 transitions. [2024-06-14 15:46:54,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 166 transitions, 1833 flow [2024-06-14 15:46:54,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 166 transitions, 1689 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 15:46:54,871 INFO L231 Difference]: Finished difference. Result has 182 places, 154 transitions, 1342 flow [2024-06-14 15:46:54,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1342, PETRI_PLACES=182, PETRI_TRANSITIONS=154} [2024-06-14 15:46:54,872 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 150 predicate places. [2024-06-14 15:46:54,872 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 154 transitions, 1342 flow [2024-06-14 15:46:54,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:54,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:54,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:54,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:46:54,872 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:46:54,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:54,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1459909806, now seen corresponding path program 9 times [2024-06-14 15:46:54,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:54,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735616962] [2024-06-14 15:46:54,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:54,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:00,571 INFO L134 CoverageAnalysis]: 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:00,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:00,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735616962] [2024-06-14 15:47:00,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735616962] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:00,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:00,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:47:00,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921824362] [2024-06-14 15:47:00,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:00,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:47:00,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:00,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:47:00,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:47:00,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:00,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 154 transitions, 1342 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:00,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:00,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:00,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:01,112 INFO L124 PetriNetUnfolderBase]: 328/662 cut-off events. [2024-06-14 15:47:01,112 INFO L125 PetriNetUnfolderBase]: For 17271/17271 co-relation queries the response was YES. [2024-06-14 15:47:01,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3260 conditions, 662 events. 328/662 cut-off events. For 17271/17271 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3424 event pairs, 38 based on Foata normal form. 1/660 useless extension candidates. Maximal degree in co-relation 3178. Up to 469 conditions per place. [2024-06-14 15:47:01,117 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 110 selfloop transitions, 51 changer transitions 0/165 dead transitions. [2024-06-14 15:47:01,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 165 transitions, 1690 flow [2024-06-14 15:47:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:47:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:47:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-14 15:47:01,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-14 15:47:01,119 INFO L175 Difference]: Start difference. First operand has 182 places, 154 transitions, 1342 flow. Second operand 11 states and 148 transitions. [2024-06-14 15:47:01,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 165 transitions, 1690 flow [2024-06-14 15:47:01,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 165 transitions, 1501 flow, removed 29 selfloop flow, removed 10 redundant places. [2024-06-14 15:47:01,159 INFO L231 Difference]: Finished difference. Result has 183 places, 154 transitions, 1260 flow [2024-06-14 15:47:01,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1260, PETRI_PLACES=183, PETRI_TRANSITIONS=154} [2024-06-14 15:47:01,160 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 151 predicate places. [2024-06-14 15:47:01,160 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 154 transitions, 1260 flow [2024-06-14 15:47:01,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:01,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:01,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:01,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:47:01,160 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:47:01,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1208260559, now seen corresponding path program 1 times [2024-06-14 15:47:01,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:01,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128796223] [2024-06-14 15:47:01,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:01,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:07,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:47:07,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:07,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128796223] [2024-06-14 15:47:07,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128796223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:07,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:07,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:07,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517485366] [2024-06-14 15:47:07,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:07,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:07,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:07,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:07,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:07,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:07,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 154 transitions, 1260 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:07,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:07,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:07,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:07,522 INFO L124 PetriNetUnfolderBase]: 332/667 cut-off events. [2024-06-14 15:47:07,522 INFO L125 PetriNetUnfolderBase]: For 19104/19104 co-relation queries the response was YES. [2024-06-14 15:47:07,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3216 conditions, 667 events. 332/667 cut-off events. For 19104/19104 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3469 event pairs, 25 based on Foata normal form. 2/665 useless extension candidates. Maximal degree in co-relation 3133. Up to 535 conditions per place. [2024-06-14 15:47:07,527 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 153 selfloop transitions, 12 changer transitions 0/169 dead transitions. [2024-06-14 15:47:07,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 169 transitions, 1628 flow [2024-06-14 15:47:07,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-14 15:47:07,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3872053872053872 [2024-06-14 15:47:07,530 INFO L175 Difference]: Start difference. First operand has 183 places, 154 transitions, 1260 flow. Second operand 9 states and 115 transitions. [2024-06-14 15:47:07,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 169 transitions, 1628 flow [2024-06-14 15:47:07,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 169 transitions, 1511 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-14 15:47:07,575 INFO L231 Difference]: Finished difference. Result has 181 places, 155 transitions, 1179 flow [2024-06-14 15:47:07,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1179, PETRI_PLACES=181, PETRI_TRANSITIONS=155} [2024-06-14 15:47:07,575 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-14 15:47:07,575 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 155 transitions, 1179 flow [2024-06-14 15:47:07,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:07,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:07,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:07,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:47:07,576 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:47:07,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:07,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1364000587, now seen corresponding path program 2 times [2024-06-14 15:47:07,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:07,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161806233] [2024-06-14 15:47:07,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:07,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:14,892 INFO L134 CoverageAnalysis]: 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,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:14,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161806233] [2024-06-14 15:47:14,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161806233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:14,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:14,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223978498] [2024-06-14 15:47:14,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:14,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:14,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:14,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:15,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:15,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 155 transitions, 1179 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:15,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:15,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:15,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:15,457 INFO L124 PetriNetUnfolderBase]: 373/760 cut-off events. [2024-06-14 15:47:15,457 INFO L125 PetriNetUnfolderBase]: For 44682/44682 co-relation queries the response was YES. [2024-06-14 15:47:15,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 760 events. 373/760 cut-off events. For 44682/44682 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4050 event pairs, 52 based on Foata normal form. 8/764 useless extension candidates. Maximal degree in co-relation 4020. Up to 472 conditions per place. [2024-06-14 15:47:15,463 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 45 changer transitions 7/174 dead transitions. [2024-06-14 15:47:15,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 174 transitions, 1751 flow [2024-06-14 15:47:15,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:15,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-14 15:47:15,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45791245791245794 [2024-06-14 15:47:15,485 INFO L175 Difference]: Start difference. First operand has 181 places, 155 transitions, 1179 flow. Second operand 9 states and 136 transitions. [2024-06-14 15:47:15,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 174 transitions, 1751 flow [2024-06-14 15:47:15,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 174 transitions, 1725 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 15:47:15,564 INFO L231 Difference]: Finished difference. Result has 183 places, 153 transitions, 1230 flow [2024-06-14 15:47:15,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1230, PETRI_PLACES=183, PETRI_TRANSITIONS=153} [2024-06-14 15:47:15,564 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 151 predicate places. [2024-06-14 15:47:15,564 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 153 transitions, 1230 flow [2024-06-14 15:47:15,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:15,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:15,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:15,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:47:15,565 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:47:15,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:15,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1363793197, now seen corresponding path program 3 times [2024-06-14 15:47:15,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:15,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585110352] [2024-06-14 15:47:15,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:22,342 INFO L134 CoverageAnalysis]: 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:22,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:22,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585110352] [2024-06-14 15:47:22,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585110352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:22,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:22,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:22,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167656794] [2024-06-14 15:47:22,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:22,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:22,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:22,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:22,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:22,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:22,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 153 transitions, 1230 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:22,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:22,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:22,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:22,873 INFO L124 PetriNetUnfolderBase]: 346/707 cut-off events. [2024-06-14 15:47:22,873 INFO L125 PetriNetUnfolderBase]: For 33287/33287 co-relation queries the response was YES. [2024-06-14 15:47:22,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3619 conditions, 707 events. 346/707 cut-off events. For 33287/33287 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3709 event pairs, 41 based on Foata normal form. 6/709 useless extension candidates. Maximal degree in co-relation 3534. Up to 500 conditions per place. [2024-06-14 15:47:22,879 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 114 selfloop transitions, 49 changer transitions 0/167 dead transitions. [2024-06-14 15:47:22,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 167 transitions, 1640 flow [2024-06-14 15:47:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2024-06-14 15:47:22,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-14 15:47:22,880 INFO L175 Difference]: Start difference. First operand has 183 places, 153 transitions, 1230 flow. Second operand 9 states and 132 transitions. [2024-06-14 15:47:22,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 167 transitions, 1640 flow [2024-06-14 15:47:22,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 167 transitions, 1546 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:47:22,942 INFO L231 Difference]: Finished difference. Result has 181 places, 155 transitions, 1298 flow [2024-06-14 15:47:22,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1298, PETRI_PLACES=181, PETRI_TRANSITIONS=155} [2024-06-14 15:47:22,943 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-14 15:47:22,943 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 155 transitions, 1298 flow [2024-06-14 15:47:22,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:22,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:22,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:22,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:47:22,943 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:47:22,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1369507117, now seen corresponding path program 4 times [2024-06-14 15:47:22,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:22,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828541923] [2024-06-14 15:47:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:22,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:30,026 INFO L134 CoverageAnalysis]: 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:30,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:30,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828541923] [2024-06-14 15:47:30,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828541923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:30,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:30,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:30,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789728354] [2024-06-14 15:47:30,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:30,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:30,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:30,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:30,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:30,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:30,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 155 transitions, 1298 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:30,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:30,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:30,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:30,600 INFO L124 PetriNetUnfolderBase]: 362/743 cut-off events. [2024-06-14 15:47:30,600 INFO L125 PetriNetUnfolderBase]: For 34999/34999 co-relation queries the response was YES. [2024-06-14 15:47:30,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3774 conditions, 743 events. 362/743 cut-off events. For 34999/34999 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3967 event pairs, 47 based on Foata normal form. 8/747 useless extension candidates. Maximal degree in co-relation 3690. Up to 462 conditions per place. [2024-06-14 15:47:30,606 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 42 changer transitions 10/174 dead transitions. [2024-06-14 15:47:30,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 174 transitions, 1827 flow [2024-06-14 15:47:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2024-06-14 15:47:30,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 15:47:30,607 INFO L175 Difference]: Start difference. First operand has 181 places, 155 transitions, 1298 flow. Second operand 9 states and 135 transitions. [2024-06-14 15:47:30,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 174 transitions, 1827 flow [2024-06-14 15:47:30,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 174 transitions, 1688 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-14 15:47:30,673 INFO L231 Difference]: Finished difference. Result has 183 places, 153 transitions, 1230 flow [2024-06-14 15:47:30,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1230, PETRI_PLACES=183, PETRI_TRANSITIONS=153} [2024-06-14 15:47:30,674 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 151 predicate places. [2024-06-14 15:47:30,674 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 153 transitions, 1230 flow [2024-06-14 15:47:30,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:30,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:30,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:30,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:47:30,675 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:47:30,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:30,675 INFO L85 PathProgramCache]: Analyzing trace with hash 427713653, now seen corresponding path program 5 times [2024-06-14 15:47:30,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:30,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330376878] [2024-06-14 15:47:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:30,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:37,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:37,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330376878] [2024-06-14 15:47:37,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330376878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:37,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:37,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:37,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086931489] [2024-06-14 15:47:37,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:37,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:37,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:37,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:37,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:37,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:37,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 153 transitions, 1230 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:37,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:37,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:37,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:38,240 INFO L124 PetriNetUnfolderBase]: 360/741 cut-off events. [2024-06-14 15:47:38,241 INFO L125 PetriNetUnfolderBase]: For 35402/35402 co-relation queries the response was YES. [2024-06-14 15:47:38,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3657 conditions, 741 events. 360/741 cut-off events. For 35402/35402 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3962 event pairs, 49 based on Foata normal form. 8/745 useless extension candidates. Maximal degree in co-relation 3572. Up to 420 conditions per place. [2024-06-14 15:47:38,246 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 121 selfloop transitions, 36 changer transitions 13/174 dead transitions. [2024-06-14 15:47:38,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 174 transitions, 1766 flow [2024-06-14 15:47:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:47:38,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:47:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2024-06-14 15:47:38,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-14 15:47:38,248 INFO L175 Difference]: Start difference. First operand has 183 places, 153 transitions, 1230 flow. Second operand 9 states and 129 transitions. [2024-06-14 15:47:38,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 174 transitions, 1766 flow [2024-06-14 15:47:38,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 174 transitions, 1672 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-14 15:47:38,304 INFO L231 Difference]: Finished difference. Result has 182 places, 151 transitions, 1204 flow [2024-06-14 15:47:38,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1204, PETRI_PLACES=182, PETRI_TRANSITIONS=151} [2024-06-14 15:47:38,305 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 150 predicate places. [2024-06-14 15:47:38,305 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 151 transitions, 1204 flow [2024-06-14 15:47:38,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:38,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:38,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:38,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:47:38,306 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:47:38,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:38,306 INFO L85 PathProgramCache]: Analyzing trace with hash -480288197, now seen corresponding path program 6 times [2024-06-14 15:47:38,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:38,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146981404] [2024-06-14 15:47:38,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:38,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:43,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:43,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146981404] [2024-06-14 15:47:43,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146981404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:43,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:43,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:47:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883296210] [2024-06-14 15:47:43,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:43,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:47:43,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:43,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:47:43,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:47:43,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:47:43,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 151 transitions, 1204 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call 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:43,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:43,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:47:43,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:44,140 INFO L124 PetriNetUnfolderBase]: 341/703 cut-off events. [2024-06-14 15:47:44,140 INFO L125 PetriNetUnfolderBase]: For 25559/25559 co-relation queries the response was YES. [2024-06-14 15:47:44,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3518 conditions, 703 events. 341/703 cut-off events. For 25559/25559 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3676 event pairs, 46 based on Foata normal form. 2/702 useless extension candidates. Maximal degree in co-relation 3433. Up to 500 conditions per place. [2024-06-14 15:47:44,145 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 109 selfloop transitions, 52 changer transitions 0/165 dead transitions. [2024-06-14 15:47:44,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 165 transitions, 1578 flow [2024-06-14 15:47:44,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:47:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:47:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2024-06-14 15:47:44,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2024-06-14 15:47:44,147 INFO L175 Difference]: Start difference. First operand has 182 places, 151 transitions, 1204 flow. Second operand 10 states and 147 transitions. [2024-06-14 15:47:44,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 165 transitions, 1578 flow [2024-06-14 15:47:44,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 165 transitions, 1498 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:47:44,197 INFO L231 Difference]: Finished difference. Result has 179 places, 154 transitions, 1260 flow [2024-06-14 15:47:44,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1260, PETRI_PLACES=179, PETRI_TRANSITIONS=154} [2024-06-14 15:47:44,198 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 147 predicate places. [2024-06-14 15:47:44,198 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 154 transitions, 1260 flow [2024-06-14 15:47:44,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call 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:44,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:44,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:44,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:47:44,199 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:47:44,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:44,199 INFO L85 PathProgramCache]: Analyzing trace with hash -736788707, now seen corresponding path program 7 times [2024-06-14 15:47:44,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:44,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431808827] [2024-06-14 15:47:44,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:44,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:51,872 INFO L134 CoverageAnalysis]: 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:51,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:51,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431808827] [2024-06-14 15:47:51,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431808827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:51,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:51,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:51,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73554039] [2024-06-14 15:47:51,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:51,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:51,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:51,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:52,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:52,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 154 transitions, 1260 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:52,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:52,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:52,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:52,296 INFO L124 PetriNetUnfolderBase]: 340/696 cut-off events. [2024-06-14 15:47:52,296 INFO L125 PetriNetUnfolderBase]: For 18648/18648 co-relation queries the response was YES. [2024-06-14 15:47:52,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3336 conditions, 696 events. 340/696 cut-off events. For 18648/18648 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3675 event pairs, 40 based on Foata normal form. 2/695 useless extension candidates. Maximal degree in co-relation 3254. Up to 492 conditions per place. [2024-06-14 15:47:52,301 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 112 selfloop transitions, 52 changer transitions 0/168 dead transitions. [2024-06-14 15:47:52,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 168 transitions, 1646 flow [2024-06-14 15:47:52,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:47:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:47:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-14 15:47:52,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-14 15:47:52,303 INFO L175 Difference]: Start difference. First operand has 179 places, 154 transitions, 1260 flow. Second operand 10 states and 137 transitions. [2024-06-14 15:47:52,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 168 transitions, 1646 flow [2024-06-14 15:47:52,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 168 transitions, 1534 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:47:52,342 INFO L231 Difference]: Finished difference. Result has 182 places, 157 transitions, 1290 flow [2024-06-14 15:47:52,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1290, PETRI_PLACES=182, PETRI_TRANSITIONS=157} [2024-06-14 15:47:52,342 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 150 predicate places. [2024-06-14 15:47:52,342 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 157 transitions, 1290 flow [2024-06-14 15:47:52,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:52,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:52,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:52,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:47:52,343 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:47:52,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:52,343 INFO L85 PathProgramCache]: Analyzing trace with hash -736996097, now seen corresponding path program 8 times [2024-06-14 15:47:52,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:52,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829080461] [2024-06-14 15:47:52,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:52,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:58,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:47:58,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:58,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829080461] [2024-06-14 15:47:58,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829080461] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:58,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:58,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:58,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385452330] [2024-06-14 15:47:58,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:58,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:58,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:58,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:58,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:58,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:58,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 157 transitions, 1290 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:58,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:58,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:58,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:58,899 INFO L124 PetriNetUnfolderBase]: 344/704 cut-off events. [2024-06-14 15:47:58,899 INFO L125 PetriNetUnfolderBase]: For 19327/19327 co-relation queries the response was YES. [2024-06-14 15:47:58,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3381 conditions, 704 events. 344/704 cut-off events. For 19327/19327 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3742 event pairs, 40 based on Foata normal form. 2/703 useless extension candidates. Maximal degree in co-relation 3298. Up to 480 conditions per place. [2024-06-14 15:47:58,904 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 112 selfloop transitions, 54 changer transitions 0/170 dead transitions. [2024-06-14 15:47:58,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 170 transitions, 1662 flow [2024-06-14 15:47:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:47:58,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:47:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-14 15:47:58,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-14 15:47:58,906 INFO L175 Difference]: Start difference. First operand has 182 places, 157 transitions, 1290 flow. Second operand 10 states and 138 transitions. [2024-06-14 15:47:58,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 170 transitions, 1662 flow [2024-06-14 15:47:58,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 170 transitions, 1565 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 15:47:58,946 INFO L231 Difference]: Finished difference. Result has 186 places, 158 transitions, 1319 flow [2024-06-14 15:47:58,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1319, PETRI_PLACES=186, PETRI_TRANSITIONS=158} [2024-06-14 15:47:58,947 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2024-06-14 15:47:58,947 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 158 transitions, 1319 flow [2024-06-14 15:47:58,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:58,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:58,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:58,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:47:58,948 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:47:58,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:58,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1389351917, now seen corresponding path program 9 times [2024-06-14 15:47:58,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:58,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054626358] [2024-06-14 15:47:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:58,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:05,312 INFO L134 CoverageAnalysis]: 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:05,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:05,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054626358] [2024-06-14 15:48:05,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054626358] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:05,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:05,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085405254] [2024-06-14 15:48:05,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:05,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:05,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:05,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:05,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:05,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:05,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 158 transitions, 1319 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:05,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:05,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:05,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:05,880 INFO L124 PetriNetUnfolderBase]: 362/738 cut-off events. [2024-06-14 15:48:05,881 INFO L125 PetriNetUnfolderBase]: For 23452/23452 co-relation queries the response was YES. [2024-06-14 15:48:05,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3678 conditions, 738 events. 362/738 cut-off events. For 23452/23452 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3960 event pairs, 43 based on Foata normal form. 2/737 useless extension candidates. Maximal degree in co-relation 3594. Up to 498 conditions per place. [2024-06-14 15:48:05,885 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 119 selfloop transitions, 54 changer transitions 0/177 dead transitions. [2024-06-14 15:48:05,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 177 transitions, 1866 flow [2024-06-14 15:48:05,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-14 15:48:05,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-14 15:48:05,888 INFO L175 Difference]: Start difference. First operand has 186 places, 158 transitions, 1319 flow. Second operand 10 states and 138 transitions. [2024-06-14 15:48:05,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 177 transitions, 1866 flow [2024-06-14 15:48:05,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 177 transitions, 1746 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:05,942 INFO L231 Difference]: Finished difference. Result has 189 places, 163 transitions, 1372 flow [2024-06-14 15:48:05,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1372, PETRI_PLACES=189, PETRI_TRANSITIONS=163} [2024-06-14 15:48:05,943 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 157 predicate places. [2024-06-14 15:48:05,943 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 163 transitions, 1372 flow [2024-06-14 15:48:05,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:05,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:05,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:05,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:48:05,943 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:48:05,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:05,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1383637997, now seen corresponding path program 10 times [2024-06-14 15:48:05,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:05,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489823162] [2024-06-14 15:48:05,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:05,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:12,617 INFO L134 CoverageAnalysis]: 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:12,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:12,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489823162] [2024-06-14 15:48:12,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489823162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:12,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:12,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:12,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4531521] [2024-06-14 15:48:12,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:12,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:12,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:12,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:12,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:12,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:12,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 163 transitions, 1372 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:12,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:12,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:12,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:13,042 INFO L124 PetriNetUnfolderBase]: 366/746 cut-off events. [2024-06-14 15:48:13,043 INFO L125 PetriNetUnfolderBase]: For 24359/24359 co-relation queries the response was YES. [2024-06-14 15:48:13,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3742 conditions, 746 events. 366/746 cut-off events. For 24359/24359 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4017 event pairs, 49 based on Foata normal form. 2/745 useless extension candidates. Maximal degree in co-relation 3656. Up to 541 conditions per place. [2024-06-14 15:48:13,049 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 118 selfloop transitions, 53 changer transitions 0/175 dead transitions. [2024-06-14 15:48:13,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 175 transitions, 1756 flow [2024-06-14 15:48:13,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 15:48:13,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-14 15:48:13,051 INFO L175 Difference]: Start difference. First operand has 189 places, 163 transitions, 1372 flow. Second operand 10 states and 133 transitions. [2024-06-14 15:48:13,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 175 transitions, 1756 flow [2024-06-14 15:48:13,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 175 transitions, 1707 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-14 15:48:13,116 INFO L231 Difference]: Finished difference. Result has 195 places, 164 transitions, 1451 flow [2024-06-14 15:48:13,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1451, PETRI_PLACES=195, PETRI_TRANSITIONS=164} [2024-06-14 15:48:13,117 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 163 predicate places. [2024-06-14 15:48:13,117 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 164 transitions, 1451 flow [2024-06-14 15:48:13,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:13,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:13,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:13,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 15:48:13,118 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:48:13,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:13,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1492210003, now seen corresponding path program 11 times [2024-06-14 15:48:13,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:13,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599281030] [2024-06-14 15:48:13,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:13,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:19,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:19,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599281030] [2024-06-14 15:48:19,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599281030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:19,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161261225] [2024-06-14 15:48:19,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:19,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:19,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:19,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:19,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:19,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 164 transitions, 1451 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:19,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:19,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:19,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:19,942 INFO L124 PetriNetUnfolderBase]: 377/767 cut-off events. [2024-06-14 15:48:19,943 INFO L125 PetriNetUnfolderBase]: For 28808/28808 co-relation queries the response was YES. [2024-06-14 15:48:19,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4059 conditions, 767 events. 377/767 cut-off events. For 28808/28808 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4141 event pairs, 50 based on Foata normal form. 2/766 useless extension candidates. Maximal degree in co-relation 3972. Up to 545 conditions per place. [2024-06-14 15:48:19,948 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 121 selfloop transitions, 54 changer transitions 0/179 dead transitions. [2024-06-14 15:48:19,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 179 transitions, 1981 flow [2024-06-14 15:48:19,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-14 15:48:19,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 15:48:19,951 INFO L175 Difference]: Start difference. First operand has 195 places, 164 transitions, 1451 flow. Second operand 10 states and 140 transitions. [2024-06-14 15:48:19,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 179 transitions, 1981 flow [2024-06-14 15:48:20,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 179 transitions, 1863 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:20,011 INFO L231 Difference]: Finished difference. Result has 197 places, 166 transitions, 1479 flow [2024-06-14 15:48:20,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1333, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1479, PETRI_PLACES=197, PETRI_TRANSITIONS=166} [2024-06-14 15:48:20,014 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 165 predicate places. [2024-06-14 15:48:20,014 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 166 transitions, 1479 flow [2024-06-14 15:48:20,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:20,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:20,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:20,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 15:48:20,015 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:48:20,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:20,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1492417393, now seen corresponding path program 12 times [2024-06-14 15:48:20,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:20,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149839374] [2024-06-14 15:48:20,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:20,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:26,021 INFO L134 CoverageAnalysis]: 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:26,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:26,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149839374] [2024-06-14 15:48:26,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149839374] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:26,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:26,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:26,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928620033] [2024-06-14 15:48:26,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:26,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:26,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:26,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:26,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:26,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:26,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 166 transitions, 1479 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:26,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:26,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:26,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:26,660 INFO L124 PetriNetUnfolderBase]: 374/762 cut-off events. [2024-06-14 15:48:26,661 INFO L125 PetriNetUnfolderBase]: For 26213/26213 co-relation queries the response was YES. [2024-06-14 15:48:26,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 762 events. 374/762 cut-off events. For 26213/26213 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4135 event pairs, 51 based on Foata normal form. 2/761 useless extension candidates. Maximal degree in co-relation 3836. Up to 557 conditions per place. [2024-06-14 15:48:26,667 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 120 selfloop transitions, 53 changer transitions 0/177 dead transitions. [2024-06-14 15:48:26,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 177 transitions, 1851 flow [2024-06-14 15:48:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-14 15:48:26,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-14 15:48:26,668 INFO L175 Difference]: Start difference. First operand has 197 places, 166 transitions, 1479 flow. Second operand 10 states and 137 transitions. [2024-06-14 15:48:26,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 177 transitions, 1851 flow [2024-06-14 15:48:26,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 177 transitions, 1744 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-14 15:48:26,735 INFO L231 Difference]: Finished difference. Result has 201 places, 166 transitions, 1482 flow [2024-06-14 15:48:26,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1482, PETRI_PLACES=201, PETRI_TRANSITIONS=166} [2024-06-14 15:48:26,736 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 169 predicate places. [2024-06-14 15:48:26,736 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 166 transitions, 1482 flow [2024-06-14 15:48:26,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:26,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:26,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:26,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 15:48:26,737 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:48:26,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:26,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1486703473, now seen corresponding path program 13 times [2024-06-14 15:48:26,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:26,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544213569] [2024-06-14 15:48:26,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:26,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:33,268 INFO L134 CoverageAnalysis]: 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:33,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544213569] [2024-06-14 15:48:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544213569] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:33,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:33,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:33,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390708554] [2024-06-14 15:48:33,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:33,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:33,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:33,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:33,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:33,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:33,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 166 transitions, 1482 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:33,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:33,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:33,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:33,735 INFO L124 PetriNetUnfolderBase]: 378/770 cut-off events. [2024-06-14 15:48:33,735 INFO L125 PetriNetUnfolderBase]: For 26873/26873 co-relation queries the response was YES. [2024-06-14 15:48:33,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 770 events. 378/770 cut-off events. For 26873/26873 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4194 event pairs, 49 based on Foata normal form. 2/769 useless extension candidates. Maximal degree in co-relation 3916. Up to 503 conditions per place. [2024-06-14 15:48:33,741 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 58 changer transitions 0/180 dead transitions. [2024-06-14 15:48:33,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 180 transitions, 1882 flow [2024-06-14 15:48:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-14 15:48:33,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2024-06-14 15:48:33,743 INFO L175 Difference]: Start difference. First operand has 201 places, 166 transitions, 1482 flow. Second operand 10 states and 139 transitions. [2024-06-14 15:48:33,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 180 transitions, 1882 flow [2024-06-14 15:48:33,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 180 transitions, 1760 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-14 15:48:33,803 INFO L231 Difference]: Finished difference. Result has 201 places, 167 transitions, 1500 flow [2024-06-14 15:48:33,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1500, PETRI_PLACES=201, PETRI_TRANSITIONS=167} [2024-06-14 15:48:33,804 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 169 predicate places. [2024-06-14 15:48:33,804 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 167 transitions, 1500 flow [2024-06-14 15:48:33,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:33,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:33,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:33,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 15:48:33,805 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:48:33,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:33,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1058249163, now seen corresponding path program 14 times [2024-06-14 15:48:33,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:33,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087653875] [2024-06-14 15:48:33,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:33,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:39,734 INFO L134 CoverageAnalysis]: 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:39,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:39,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087653875] [2024-06-14 15:48:39,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087653875] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:39,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:39,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:39,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268588321] [2024-06-14 15:48:39,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:39,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:39,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:39,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:39,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:39,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:39,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 167 transitions, 1500 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:39,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:39,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:39,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:40,134 INFO L124 PetriNetUnfolderBase]: 375/765 cut-off events. [2024-06-14 15:48:40,134 INFO L125 PetriNetUnfolderBase]: For 24015/24015 co-relation queries the response was YES. [2024-06-14 15:48:40,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 765 events. 375/765 cut-off events. For 24015/24015 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4176 event pairs, 50 based on Foata normal form. 2/764 useless extension candidates. Maximal degree in co-relation 3806. Up to 546 conditions per place. [2024-06-14 15:48:40,140 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 121 selfloop transitions, 54 changer transitions 0/179 dead transitions. [2024-06-14 15:48:40,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 179 transitions, 1878 flow [2024-06-14 15:48:40,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:40,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-14 15:48:40,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 15:48:40,149 INFO L175 Difference]: Start difference. First operand has 201 places, 167 transitions, 1500 flow. Second operand 10 states and 135 transitions. [2024-06-14 15:48:40,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 179 transitions, 1878 flow [2024-06-14 15:48:40,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 179 transitions, 1732 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-14 15:48:40,199 INFO L231 Difference]: Finished difference. Result has 202 places, 167 transitions, 1466 flow [2024-06-14 15:48:40,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1466, PETRI_PLACES=202, PETRI_TRANSITIONS=167} [2024-06-14 15:48:40,199 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 170 predicate places. [2024-06-14 15:48:40,200 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 167 transitions, 1466 flow [2024-06-14 15:48:40,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:40,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:40,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:40,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 15:48:40,200 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:48:40,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1205858763, now seen corresponding path program 15 times [2024-06-14 15:48:40,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:40,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771004039] [2024-06-14 15:48:40,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:40,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:46,375 INFO L134 CoverageAnalysis]: 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:46,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771004039] [2024-06-14 15:48:46,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771004039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:46,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:46,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:46,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251562756] [2024-06-14 15:48:46,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:46,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:46,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:46,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:46,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:46,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:46,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 167 transitions, 1466 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:46,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:46,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:46,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:46,749 INFO L124 PetriNetUnfolderBase]: 379/773 cut-off events. [2024-06-14 15:48:46,749 INFO L125 PetriNetUnfolderBase]: For 24665/24665 co-relation queries the response was YES. [2024-06-14 15:48:46,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3889 conditions, 773 events. 379/773 cut-off events. For 24665/24665 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4224 event pairs, 48 based on Foata normal form. 2/772 useless extension candidates. Maximal degree in co-relation 3798. Up to 359 conditions per place. [2024-06-14 15:48:46,755 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 118 selfloop transitions, 62 changer transitions 0/184 dead transitions. [2024-06-14 15:48:46,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 184 transitions, 2026 flow [2024-06-14 15:48:46,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-14 15:48:46,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-14 15:48:46,756 INFO L175 Difference]: Start difference. First operand has 202 places, 167 transitions, 1466 flow. Second operand 10 states and 137 transitions. [2024-06-14 15:48:46,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 184 transitions, 2026 flow [2024-06-14 15:48:46,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 184 transitions, 1912 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-14 15:48:46,808 INFO L231 Difference]: Finished difference. Result has 203 places, 169 transitions, 1522 flow [2024-06-14 15:48:46,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1522, PETRI_PLACES=203, PETRI_TRANSITIONS=169} [2024-06-14 15:48:46,809 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 171 predicate places. [2024-06-14 15:48:46,809 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 169 transitions, 1522 flow [2024-06-14 15:48:46,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:46,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:46,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:46,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 15:48:46,817 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:48:46,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash 233450097, now seen corresponding path program 1 times [2024-06-14 15:48:46,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:46,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906858051] [2024-06-14 15:48:46,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:46,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:53,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:53,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906858051] [2024-06-14 15:48:53,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906858051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:53,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:53,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:48:53,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430534968] [2024-06-14 15:48:53,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:53,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:48:53,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:53,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:48:53,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:48:54,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:54,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 169 transitions, 1522 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:54,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:54,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:54,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:54,417 INFO L124 PetriNetUnfolderBase]: 413/846 cut-off events. [2024-06-14 15:48:54,417 INFO L125 PetriNetUnfolderBase]: For 50023/50023 co-relation queries the response was YES. [2024-06-14 15:48:54,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4817 conditions, 846 events. 413/846 cut-off events. For 50023/50023 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4705 event pairs, 68 based on Foata normal form. 6/848 useless extension candidates. Maximal degree in co-relation 4725. Up to 493 conditions per place. [2024-06-14 15:48:54,425 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 112 selfloop transitions, 68 changer transitions 5/189 dead transitions. [2024-06-14 15:48:54,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 189 transitions, 2146 flow [2024-06-14 15:48:54,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:48:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:48:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 156 transitions. [2024-06-14 15:48:54,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4297520661157025 [2024-06-14 15:48:54,426 INFO L175 Difference]: Start difference. First operand has 203 places, 169 transitions, 1522 flow. Second operand 11 states and 156 transitions. [2024-06-14 15:48:54,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 189 transitions, 2146 flow [2024-06-14 15:48:54,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 189 transitions, 2056 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 15:48:54,519 INFO L231 Difference]: Finished difference. Result has 208 places, 168 transitions, 1565 flow [2024-06-14 15:48:54,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1565, PETRI_PLACES=208, PETRI_TRANSITIONS=168} [2024-06-14 15:48:54,520 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-14 15:48:54,520 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 168 transitions, 1565 flow [2024-06-14 15:48:54,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:54,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:54,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:54,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 15:48:54,521 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:48:54,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:54,521 INFO L85 PathProgramCache]: Analyzing trace with hash 233123667, now seen corresponding path program 2 times [2024-06-14 15:48:54,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:54,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268690668] [2024-06-14 15:48:54,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:00,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:00,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268690668] [2024-06-14 15:49:00,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268690668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:00,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:00,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:49:00,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831483944] [2024-06-14 15:49:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:00,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:49:00,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:00,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:49:00,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:49:01,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:01,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 168 transitions, 1565 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:01,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:01,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:01,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:01,415 INFO L124 PetriNetUnfolderBase]: 413/846 cut-off events. [2024-06-14 15:49:01,416 INFO L125 PetriNetUnfolderBase]: For 55397/55397 co-relation queries the response was YES. [2024-06-14 15:49:01,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4932 conditions, 846 events. 413/846 cut-off events. For 55397/55397 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4691 event pairs, 74 based on Foata normal form. 8/850 useless extension candidates. Maximal degree in co-relation 4838. Up to 575 conditions per place. [2024-06-14 15:49:01,423 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 105 selfloop transitions, 65 changer transitions 9/183 dead transitions. [2024-06-14 15:49:01,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 183 transitions, 2007 flow [2024-06-14 15:49:01,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:49:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:49:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 153 transitions. [2024-06-14 15:49:01,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4214876033057851 [2024-06-14 15:49:01,424 INFO L175 Difference]: Start difference. First operand has 208 places, 168 transitions, 1565 flow. Second operand 11 states and 153 transitions. [2024-06-14 15:49:01,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 183 transitions, 2007 flow [2024-06-14 15:49:01,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 183 transitions, 1869 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-14 15:49:01,522 INFO L231 Difference]: Finished difference. Result has 208 places, 165 transitions, 1537 flow [2024-06-14 15:49:01,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1537, PETRI_PLACES=208, PETRI_TRANSITIONS=165} [2024-06-14 15:49:01,523 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-14 15:49:01,523 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 165 transitions, 1537 flow [2024-06-14 15:49:01,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:01,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:01,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:01,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 15:49:01,524 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:49:01,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:01,524 INFO L85 PathProgramCache]: Analyzing trace with hash -101669327, now seen corresponding path program 3 times [2024-06-14 15:49:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:01,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81132296] [2024-06-14 15:49:01,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:01,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:08,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:49:08,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:08,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81132296] [2024-06-14 15:49:08,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81132296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:08,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:08,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:49:08,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207986755] [2024-06-14 15:49:08,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:08,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:49:08,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:08,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:49:08,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:49:08,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:08,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 165 transitions, 1537 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:08,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:08,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:08,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:08,811 INFO L124 PetriNetUnfolderBase]: 385/789 cut-off events. [2024-06-14 15:49:08,811 INFO L125 PetriNetUnfolderBase]: For 38922/38922 co-relation queries the response was YES. [2024-06-14 15:49:08,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 789 events. 385/789 cut-off events. For 38922/38922 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4334 event pairs, 56 based on Foata normal form. 8/794 useless extension candidates. Maximal degree in co-relation 4041. Up to 561 conditions per place. [2024-06-14 15:49:08,817 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 115 selfloop transitions, 54 changer transitions 9/182 dead transitions. [2024-06-14 15:49:08,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 182 transitions, 1995 flow [2024-06-14 15:49:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:49:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:49:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-14 15:49:08,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-14 15:49:08,818 INFO L175 Difference]: Start difference. First operand has 208 places, 165 transitions, 1537 flow. Second operand 11 states and 150 transitions. [2024-06-14 15:49:08,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 182 transitions, 1995 flow [2024-06-14 15:49:08,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 182 transitions, 1849 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:49:08,874 INFO L231 Difference]: Finished difference. Result has 207 places, 164 transitions, 1500 flow [2024-06-14 15:49:08,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1500, PETRI_PLACES=207, PETRI_TRANSITIONS=164} [2024-06-14 15:49:08,877 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2024-06-14 15:49:08,878 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 164 transitions, 1500 flow [2024-06-14 15:49:08,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:08,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:08,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:08,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 15:49:08,878 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:49:08,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:08,879 INFO L85 PathProgramCache]: Analyzing trace with hash -358169837, now seen corresponding path program 4 times [2024-06-14 15:49:08,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:08,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020247340] [2024-06-14 15:49:08,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:08,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:15,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:15,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:15,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020247340] [2024-06-14 15:49:15,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020247340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:15,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:15,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:49:15,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031369048] [2024-06-14 15:49:15,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:15,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:49:15,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:15,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:49:15,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:49:16,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:16,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 164 transitions, 1500 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:16,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:16,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:16,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:16,580 INFO L124 PetriNetUnfolderBase]: 383/787 cut-off events. [2024-06-14 15:49:16,580 INFO L125 PetriNetUnfolderBase]: For 37548/37548 co-relation queries the response was YES. [2024-06-14 15:49:16,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 787 events. 383/787 cut-off events. For 37548/37548 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4338 event pairs, 56 based on Foata normal form. 8/792 useless extension candidates. Maximal degree in co-relation 3974. Up to 549 conditions per place. [2024-06-14 15:49:16,586 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 115 selfloop transitions, 49 changer transitions 13/181 dead transitions. [2024-06-14 15:49:16,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 181 transitions, 1952 flow [2024-06-14 15:49:16,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:49:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:49:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-14 15:49:16,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-14 15:49:16,587 INFO L175 Difference]: Start difference. First operand has 207 places, 164 transitions, 1500 flow. Second operand 11 states and 150 transitions. [2024-06-14 15:49:16,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 181 transitions, 1952 flow [2024-06-14 15:49:16,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 181 transitions, 1834 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 15:49:16,656 INFO L231 Difference]: Finished difference. Result has 207 places, 160 transitions, 1452 flow [2024-06-14 15:49:16,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1452, PETRI_PLACES=207, PETRI_TRANSITIONS=160} [2024-06-14 15:49:16,656 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2024-06-14 15:49:16,657 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 160 transitions, 1452 flow [2024-06-14 15:49:16,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:16,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:16,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:16,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 15:49:16,657 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:49:16,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:16,658 INFO L85 PathProgramCache]: Analyzing trace with hash 788218171, now seen corresponding path program 5 times [2024-06-14 15:49:16,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:16,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668215977] [2024-06-14 15:49:16,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:16,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:23,443 INFO L134 CoverageAnalysis]: 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:23,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:23,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668215977] [2024-06-14 15:49:23,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668215977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:23,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:23,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:49:23,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110961282] [2024-06-14 15:49:23,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:23,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:49:23,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:23,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:49:23,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:49:23,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:23,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 160 transitions, 1452 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:23,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:23,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:23,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:24,066 INFO L124 PetriNetUnfolderBase]: 374/769 cut-off events. [2024-06-14 15:49:24,066 INFO L125 PetriNetUnfolderBase]: For 37796/37796 co-relation queries the response was YES. [2024-06-14 15:49:24,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3979 conditions, 769 events. 374/769 cut-off events. For 37796/37796 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4220 event pairs, 60 based on Foata normal form. 8/773 useless extension candidates. Maximal degree in co-relation 3885. Up to 523 conditions per place. [2024-06-14 15:49:24,073 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 113 selfloop transitions, 51 changer transitions 9/177 dead transitions. [2024-06-14 15:49:24,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 177 transitions, 1896 flow [2024-06-14 15:49:24,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:49:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:49:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-14 15:49:24,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-14 15:49:24,074 INFO L175 Difference]: Start difference. First operand has 207 places, 160 transitions, 1452 flow. Second operand 11 states and 149 transitions. [2024-06-14 15:49:24,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 177 transitions, 1896 flow [2024-06-14 15:49:24,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 177 transitions, 1782 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-14 15:49:24,132 INFO L231 Difference]: Finished difference. Result has 204 places, 159 transitions, 1437 flow [2024-06-14 15:49:24,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1437, PETRI_PLACES=204, PETRI_TRANSITIONS=159} [2024-06-14 15:49:24,132 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 172 predicate places. [2024-06-14 15:49:24,132 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 159 transitions, 1437 flow [2024-06-14 15:49:24,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:24,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:24,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:24,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 15:49:24,133 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:49:24,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:24,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1762240995, now seen corresponding path program 6 times [2024-06-14 15:49:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:24,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022675508] [2024-06-14 15:49:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:24,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:30,052 INFO L134 CoverageAnalysis]: 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:30,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:30,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022675508] [2024-06-14 15:49:30,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022675508] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:30,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:30,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:49:30,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52391242] [2024-06-14 15:49:30,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:30,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:49:30,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:30,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:49:30,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:49:30,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:30,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 159 transitions, 1437 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:30,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:30,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:30,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:30,633 INFO L124 PetriNetUnfolderBase]: 369/769 cut-off events. [2024-06-14 15:49:30,633 INFO L125 PetriNetUnfolderBase]: For 36589/36589 co-relation queries the response was YES. [2024-06-14 15:49:30,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3920 conditions, 769 events. 369/769 cut-off events. For 36589/36589 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4234 event pairs, 58 based on Foata normal form. 8/774 useless extension candidates. Maximal degree in co-relation 3827. Up to 540 conditions per place. [2024-06-14 15:49:30,639 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 114 selfloop transitions, 47 changer transitions 9/174 dead transitions. [2024-06-14 15:49:30,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 174 transitions, 1857 flow [2024-06-14 15:49:30,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:49:30,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:49:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-14 15:49:30,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-14 15:49:30,640 INFO L175 Difference]: Start difference. First operand has 204 places, 159 transitions, 1437 flow. Second operand 11 states and 146 transitions. [2024-06-14 15:49:30,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 174 transitions, 1857 flow [2024-06-14 15:49:30,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 174 transitions, 1749 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:49:30,704 INFO L231 Difference]: Finished difference. Result has 203 places, 156 transitions, 1399 flow [2024-06-14 15:49:30,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1399, PETRI_PLACES=203, PETRI_TRANSITIONS=156} [2024-06-14 15:49:30,705 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 171 predicate places. [2024-06-14 15:49:30,705 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 156 transitions, 1399 flow [2024-06-14 15:49:30,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:30,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:30,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:30,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 15:49:30,706 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:49:30,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash -141465073, now seen corresponding path program 16 times [2024-06-14 15:49:30,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:30,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118131005] [2024-06-14 15:49:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:36,528 INFO L134 CoverageAnalysis]: 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,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:36,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118131005] [2024-06-14 15:49:36,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118131005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:36,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:36,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:36,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553086856] [2024-06-14 15:49:36,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:36,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:36,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:36,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:36,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:36,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:36,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 156 transitions, 1399 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:36,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:36,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:36,905 INFO L124 PetriNetUnfolderBase]: 356/742 cut-off events. [2024-06-14 15:49:36,906 INFO L125 PetriNetUnfolderBase]: For 24546/24546 co-relation queries the response was YES. [2024-06-14 15:49:36,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 742 events. 356/742 cut-off events. For 24546/24546 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4051 event pairs, 50 based on Foata normal form. 2/741 useless extension candidates. Maximal degree in co-relation 3678. Up to 475 conditions per place. [2024-06-14 15:49:36,911 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 49 changer transitions 0/171 dead transitions. [2024-06-14 15:49:36,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 171 transitions, 1909 flow [2024-06-14 15:49:36,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2024-06-14 15:49:36,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2024-06-14 15:49:36,913 INFO L175 Difference]: Start difference. First operand has 203 places, 156 transitions, 1399 flow. Second operand 10 states and 141 transitions. [2024-06-14 15:49:36,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 171 transitions, 1909 flow [2024-06-14 15:49:36,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 171 transitions, 1797 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-14 15:49:36,981 INFO L231 Difference]: Finished difference. Result has 200 places, 157 transitions, 1411 flow [2024-06-14 15:49:36,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1411, PETRI_PLACES=200, PETRI_TRANSITIONS=157} [2024-06-14 15:49:36,981 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 168 predicate places. [2024-06-14 15:49:36,981 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 157 transitions, 1411 flow [2024-06-14 15:49:36,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:36,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:36,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 15:49:36,982 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:49:36,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:36,982 INFO L85 PathProgramCache]: Analyzing trace with hash -135751153, now seen corresponding path program 17 times [2024-06-14 15:49:36,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:36,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096130992] [2024-06-14 15:49:36,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:36,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:43,152 INFO L134 CoverageAnalysis]: 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:43,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:43,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096130992] [2024-06-14 15:49:43,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096130992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:43,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:43,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667786313] [2024-06-14 15:49:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:43,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:43,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:43,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:43,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:43,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:43,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 157 transitions, 1411 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:43,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:43,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:43,536 INFO L124 PetriNetUnfolderBase]: 361/749 cut-off events. [2024-06-14 15:49:43,536 INFO L125 PetriNetUnfolderBase]: For 24071/24071 co-relation queries the response was YES. [2024-06-14 15:49:43,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3825 conditions, 749 events. 361/749 cut-off events. For 24071/24071 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4102 event pairs, 52 based on Foata normal form. 2/748 useless extension candidates. Maximal degree in co-relation 3734. Up to 552 conditions per place. [2024-06-14 15:49:43,542 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 48 changer transitions 0/170 dead transitions. [2024-06-14 15:49:43,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 170 transitions, 1802 flow [2024-06-14 15:49:43,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:43,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-14 15:49:43,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-14 15:49:43,543 INFO L175 Difference]: Start difference. First operand has 200 places, 157 transitions, 1411 flow. Second operand 10 states and 136 transitions. [2024-06-14 15:49:43,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 170 transitions, 1802 flow [2024-06-14 15:49:43,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 170 transitions, 1583 flow, removed 13 selfloop flow, removed 11 redundant places. [2024-06-14 15:49:43,601 INFO L231 Difference]: Finished difference. Result has 199 places, 159 transitions, 1327 flow [2024-06-14 15:49:43,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1327, PETRI_PLACES=199, PETRI_TRANSITIONS=159} [2024-06-14 15:49:43,601 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 167 predicate places. [2024-06-14 15:49:43,601 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 159 transitions, 1327 flow [2024-06-14 15:49:43,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:43,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:43,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 15:49:43,602 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:49:43,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:43,602 INFO L85 PathProgramCache]: Analyzing trace with hash 855633393, now seen corresponding path program 18 times [2024-06-14 15:49:43,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:43,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124672327] [2024-06-14 15:49:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:43,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:49,689 INFO L134 CoverageAnalysis]: 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:49,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:49,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124672327] [2024-06-14 15:49:49,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124672327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:49,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:49,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:49:49,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41110922] [2024-06-14 15:49:49,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:49,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:49:49,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:49,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:49:49,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:49:49,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:49,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 159 transitions, 1327 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:49,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:49,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:50,151 INFO L124 PetriNetUnfolderBase]: 365/761 cut-off events. [2024-06-14 15:49:50,151 INFO L125 PetriNetUnfolderBase]: For 24597/24597 co-relation queries the response was YES. [2024-06-14 15:49:50,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3651 conditions, 761 events. 365/761 cut-off events. For 24597/24597 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4199 event pairs, 54 based on Foata normal form. 2/760 useless extension candidates. Maximal degree in co-relation 3562. Up to 560 conditions per place. [2024-06-14 15:49:50,158 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 50 changer transitions 0/172 dead transitions. [2024-06-14 15:49:50,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 172 transitions, 1707 flow [2024-06-14 15:49:50,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:49:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:49:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-14 15:49:50,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-14 15:49:50,160 INFO L175 Difference]: Start difference. First operand has 199 places, 159 transitions, 1327 flow. Second operand 11 states and 150 transitions. [2024-06-14 15:49:50,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 172 transitions, 1707 flow [2024-06-14 15:49:50,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 172 transitions, 1604 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 15:49:50,225 INFO L231 Difference]: Finished difference. Result has 203 places, 160 transitions, 1346 flow [2024-06-14 15:49:50,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1346, PETRI_PLACES=203, PETRI_TRANSITIONS=160} [2024-06-14 15:49:50,226 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 171 predicate places. [2024-06-14 15:49:50,226 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 160 transitions, 1346 flow [2024-06-14 15:49:50,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:50,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:50,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:50,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 15:49:50,227 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:49:50,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:50,227 INFO L85 PathProgramCache]: Analyzing trace with hash 599132883, now seen corresponding path program 19 times [2024-06-14 15:49:50,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:50,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073037434] [2024-06-14 15:49:50,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:50,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:56,689 INFO L134 CoverageAnalysis]: 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,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:56,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073037434] [2024-06-14 15:49:56,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073037434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:56,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:56,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:49:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499847699] [2024-06-14 15:49:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:56,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:49:56,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:49:56,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:49:56,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:56,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 160 transitions, 1346 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:56,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:56,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:56,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:57,204 INFO L124 PetriNetUnfolderBase]: 369/771 cut-off events. [2024-06-14 15:49:57,205 INFO L125 PetriNetUnfolderBase]: For 25435/25435 co-relation queries the response was YES. [2024-06-14 15:49:57,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3710 conditions, 771 events. 369/771 cut-off events. For 25435/25435 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4293 event pairs, 54 based on Foata normal form. 2/770 useless extension candidates. Maximal degree in co-relation 3620. Up to 568 conditions per place. [2024-06-14 15:49:57,210 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 51 changer transitions 0/173 dead transitions. [2024-06-14 15:49:57,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 173 transitions, 1730 flow [2024-06-14 15:49:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:49:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:49:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-14 15:49:57,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-14 15:49:57,220 INFO L175 Difference]: Start difference. First operand has 203 places, 160 transitions, 1346 flow. Second operand 11 states and 149 transitions. [2024-06-14 15:49:57,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 173 transitions, 1730 flow [2024-06-14 15:49:57,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 173 transitions, 1620 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-14 15:49:57,288 INFO L231 Difference]: Finished difference. Result has 205 places, 161 transitions, 1362 flow [2024-06-14 15:49:57,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1362, PETRI_PLACES=205, PETRI_TRANSITIONS=161} [2024-06-14 15:49:57,288 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 173 predicate places. [2024-06-14 15:49:57,288 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 161 transitions, 1362 flow [2024-06-14 15:49:57,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:57,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:57,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 15:49:57,289 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:49:57,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:57,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1672882703, now seen corresponding path program 20 times [2024-06-14 15:49:57,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:57,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744523677] [2024-06-14 15:49:57,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:57,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:02,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:02,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744523677] [2024-06-14 15:50:02,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744523677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:02,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:02,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:50:02,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739810097] [2024-06-14 15:50:02,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:02,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:50:02,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:02,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:50:02,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:50:03,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:50:03,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 161 transitions, 1362 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:03,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:03,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:50:03,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:03,408 INFO L124 PetriNetUnfolderBase]: 373/779 cut-off events. [2024-06-14 15:50:03,408 INFO L125 PetriNetUnfolderBase]: For 26228/26228 co-relation queries the response was YES. [2024-06-14 15:50:03,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3763 conditions, 779 events. 373/779 cut-off events. For 26228/26228 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4346 event pairs, 56 based on Foata normal form. 2/778 useless extension candidates. Maximal degree in co-relation 3672. Up to 576 conditions per place. [2024-06-14 15:50:03,414 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 119 selfloop transitions, 51 changer transitions 0/174 dead transitions. [2024-06-14 15:50:03,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 174 transitions, 1750 flow [2024-06-14 15:50:03,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:50:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:50:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-14 15:50:03,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-14 15:50:03,416 INFO L175 Difference]: Start difference. First operand has 205 places, 161 transitions, 1362 flow. Second operand 11 states and 148 transitions. [2024-06-14 15:50:03,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 174 transitions, 1750 flow [2024-06-14 15:50:03,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 174 transitions, 1636 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 15:50:03,484 INFO L231 Difference]: Finished difference. Result has 207 places, 162 transitions, 1376 flow [2024-06-14 15:50:03,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1376, PETRI_PLACES=207, PETRI_TRANSITIONS=162} [2024-06-14 15:50:03,484 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2024-06-14 15:50:03,485 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 162 transitions, 1376 flow [2024-06-14 15:50:03,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:03,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:03,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:03,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 15:50:03,485 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:50:03,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash 598925493, now seen corresponding path program 21 times [2024-06-14 15:50:03,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:03,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974249567] [2024-06-14 15:50:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:03,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:10,154 INFO L134 CoverageAnalysis]: 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:10,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:10,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974249567] [2024-06-14 15:50:10,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974249567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:10,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:10,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:50:10,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644618877] [2024-06-14 15:50:10,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:10,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:50:10,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:10,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:50:10,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:50:10,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:50:10,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 162 transitions, 1376 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:10,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:10,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:50:10,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:10,671 INFO L124 PetriNetUnfolderBase]: 377/787 cut-off events. [2024-06-14 15:50:10,671 INFO L125 PetriNetUnfolderBase]: For 27027/27027 co-relation queries the response was YES. [2024-06-14 15:50:10,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 787 events. 377/787 cut-off events. For 27027/27027 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4402 event pairs, 56 based on Foata normal form. 2/786 useless extension candidates. Maximal degree in co-relation 3724. Up to 558 conditions per place. [2024-06-14 15:50:10,677 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 118 selfloop transitions, 54 changer transitions 0/176 dead transitions. [2024-06-14 15:50:10,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 176 transitions, 1772 flow [2024-06-14 15:50:10,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:50:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:50:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-14 15:50:10,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-14 15:50:10,679 INFO L175 Difference]: Start difference. First operand has 207 places, 162 transitions, 1376 flow. Second operand 11 states and 150 transitions. [2024-06-14 15:50:10,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 176 transitions, 1772 flow [2024-06-14 15:50:10,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 176 transitions, 1656 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 15:50:10,746 INFO L231 Difference]: Finished difference. Result has 209 places, 163 transitions, 1396 flow [2024-06-14 15:50:10,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1396, PETRI_PLACES=209, PETRI_TRANSITIONS=163} [2024-06-14 15:50:10,747 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2024-06-14 15:50:10,747 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 163 transitions, 1396 flow [2024-06-14 15:50:10,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:10,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:10,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:10,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 15:50:10,748 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:50:10,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash -141320923, now seen corresponding path program 22 times [2024-06-14 15:50:10,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:10,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008478587] [2024-06-14 15:50:10,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:10,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:17,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:17,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008478587] [2024-06-14 15:50:17,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008478587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:17,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:17,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:17,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652665874] [2024-06-14 15:50:17,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:17,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:17,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:17,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:17,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:17,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:50:17,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 163 transitions, 1396 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:17,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:17,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:50:17,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:17,533 INFO L124 PetriNetUnfolderBase]: 381/795 cut-off events. [2024-06-14 15:50:17,534 INFO L125 PetriNetUnfolderBase]: For 28030/28030 co-relation queries the response was YES. [2024-06-14 15:50:17,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3879 conditions, 795 events. 381/795 cut-off events. For 28030/28030 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4436 event pairs, 56 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 3786. Up to 578 conditions per place. [2024-06-14 15:50:17,538 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 123 selfloop transitions, 49 changer transitions 0/176 dead transitions. [2024-06-14 15:50:17,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 176 transitions, 1792 flow [2024-06-14 15:50:17,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:17,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-14 15:50:17,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-14 15:50:17,540 INFO L175 Difference]: Start difference. First operand has 209 places, 163 transitions, 1396 flow. Second operand 10 states and 138 transitions. [2024-06-14 15:50:17,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 176 transitions, 1792 flow [2024-06-14 15:50:17,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 176 transitions, 1668 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 15:50:17,610 INFO L231 Difference]: Finished difference. Result has 210 places, 164 transitions, 1400 flow [2024-06-14 15:50:17,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1400, PETRI_PLACES=210, PETRI_TRANSITIONS=164} [2024-06-14 15:50:17,611 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 178 predicate places. [2024-06-14 15:50:17,611 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 164 transitions, 1400 flow [2024-06-14 15:50:17,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:17,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:17,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:17,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 15:50:17,612 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:50:17,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:17,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1404249585, now seen corresponding path program 23 times [2024-06-14 15:50:17,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:17,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189018920] [2024-06-14 15:50:17,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:17,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:23,225 INFO L134 CoverageAnalysis]: 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:23,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:23,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189018920] [2024-06-14 15:50:23,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189018920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:23,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:23,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:23,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195865353] [2024-06-14 15:50:23,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:23,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:23,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:23,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:23,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:23,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:50:23,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 164 transitions, 1400 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:23,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:23,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:50:23,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:23,686 INFO L124 PetriNetUnfolderBase]: 386/806 cut-off events. [2024-06-14 15:50:23,686 INFO L125 PetriNetUnfolderBase]: For 29049/29049 co-relation queries the response was YES. [2024-06-14 15:50:23,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3936 conditions, 806 events. 386/806 cut-off events. For 29049/29049 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4532 event pairs, 58 based on Foata normal form. 2/805 useless extension candidates. Maximal degree in co-relation 3842. Up to 602 conditions per place. [2024-06-14 15:50:23,691 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 126 selfloop transitions, 47 changer transitions 0/177 dead transitions. [2024-06-14 15:50:23,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 177 transitions, 1809 flow [2024-06-14 15:50:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-14 15:50:23,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-14 15:50:23,693 INFO L175 Difference]: Start difference. First operand has 210 places, 164 transitions, 1400 flow. Second operand 10 states and 136 transitions. [2024-06-14 15:50:23,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 177 transitions, 1809 flow [2024-06-14 15:50:23,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 177 transitions, 1691 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 15:50:23,772 INFO L231 Difference]: Finished difference. Result has 212 places, 166 transitions, 1419 flow [2024-06-14 15:50:23,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1284, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1419, PETRI_PLACES=212, PETRI_TRANSITIONS=166} [2024-06-14 15:50:23,773 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 180 predicate places. [2024-06-14 15:50:23,773 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 166 transitions, 1419 flow [2024-06-14 15:50:23,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:23,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:23,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:23,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 15:50:23,774 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:50:23,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:23,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1660750095, now seen corresponding path program 24 times [2024-06-14 15:50:23,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:23,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420139238] [2024-06-14 15:50:23,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:23,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:30,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:30,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420139238] [2024-06-14 15:50:30,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420139238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:30,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:30,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:30,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064989312] [2024-06-14 15:50:30,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:30,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:30,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:30,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:30,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:30,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:50:30,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 166 transitions, 1419 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:30,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:30,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:50:30,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:30,811 INFO L124 PetriNetUnfolderBase]: 390/814 cut-off events. [2024-06-14 15:50:30,811 INFO L125 PetriNetUnfolderBase]: For 29944/29944 co-relation queries the response was YES. [2024-06-14 15:50:30,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3977 conditions, 814 events. 390/814 cut-off events. For 29944/29944 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4586 event pairs, 60 based on Foata normal form. 2/813 useless extension candidates. Maximal degree in co-relation 3882. Up to 610 conditions per place. [2024-06-14 15:50:30,817 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 128 selfloop transitions, 46 changer transitions 0/178 dead transitions. [2024-06-14 15:50:30,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 178 transitions, 1821 flow [2024-06-14 15:50:30,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-14 15:50:30,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-14 15:50:30,818 INFO L175 Difference]: Start difference. First operand has 212 places, 166 transitions, 1419 flow. Second operand 10 states and 136 transitions. [2024-06-14 15:50:30,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 178 transitions, 1821 flow [2024-06-14 15:50:30,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 178 transitions, 1709 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 15:50:30,890 INFO L231 Difference]: Finished difference. Result has 215 places, 167 transitions, 1433 flow [2024-06-14 15:50:30,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1433, PETRI_PLACES=215, PETRI_TRANSITIONS=167} [2024-06-14 15:50:30,890 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 183 predicate places. [2024-06-14 15:50:30,890 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 167 transitions, 1433 flow [2024-06-14 15:50:30,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:30,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:30,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:30,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 15:50:30,891 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:50:30,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash 57980867, now seen corresponding path program 25 times [2024-06-14 15:50:30,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:30,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746948131] [2024-06-14 15:50:30,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:30,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:36,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:36,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746948131] [2024-06-14 15:50:36,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746948131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:36,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:36,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:36,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094236262] [2024-06-14 15:50:36,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:36,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:36,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:36,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:36,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:36,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:50:36,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 167 transitions, 1433 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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:36,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:36,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:50:36,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:36,951 INFO L124 PetriNetUnfolderBase]: 387/806 cut-off events. [2024-06-14 15:50:36,951 INFO L125 PetriNetUnfolderBase]: For 25649/25649 co-relation queries the response was YES. [2024-06-14 15:50:36,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3775 conditions, 806 events. 387/806 cut-off events. For 25649/25649 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4555 event pairs, 61 based on Foata normal form. 2/804 useless extension candidates. Maximal degree in co-relation 3679. Up to 561 conditions per place. [2024-06-14 15:50:36,958 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 125 selfloop transitions, 50 changer transitions 0/179 dead transitions. [2024-06-14 15:50:36,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 179 transitions, 1811 flow [2024-06-14 15:50:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-14 15:50:36,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2024-06-14 15:50:36,959 INFO L175 Difference]: Start difference. First operand has 215 places, 167 transitions, 1433 flow. Second operand 10 states and 139 transitions. [2024-06-14 15:50:36,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 179 transitions, 1811 flow [2024-06-14 15:50:37,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 179 transitions, 1663 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-14 15:50:37,023 INFO L231 Difference]: Finished difference. Result has 216 places, 167 transitions, 1389 flow [2024-06-14 15:50:37,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1389, PETRI_PLACES=216, PETRI_TRANSITIONS=167} [2024-06-14 15:50:37,024 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 184 predicate places. [2024-06-14 15:50:37,024 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 167 transitions, 1389 flow [2024-06-14 15:50:37,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call 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,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:37,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:37,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 15:50:37,025 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:50:37,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:37,025 INFO L85 PathProgramCache]: Analyzing trace with hash -830757029, now seen corresponding path program 7 times [2024-06-14 15:50:37,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:37,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784684625] [2024-06-14 15:50:37,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:37,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:43,061 INFO L134 CoverageAnalysis]: 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,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:43,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784684625] [2024-06-14 15:50:43,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784684625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:43,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:43,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:50:43,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500612783] [2024-06-14 15:50:43,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:43,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:50:43,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:43,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:50:43,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:50:43,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:50:43,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 167 transitions, 1389 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:43,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:50:43,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:43,710 INFO L124 PetriNetUnfolderBase]: 417/876 cut-off events. [2024-06-14 15:50:43,710 INFO L125 PetriNetUnfolderBase]: For 54472/54472 co-relation queries the response was YES. [2024-06-14 15:50:43,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4599 conditions, 876 events. 417/876 cut-off events. For 54472/54472 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5016 event pairs, 75 based on Foata normal form. 6/878 useless extension candidates. Maximal degree in co-relation 4502. Up to 567 conditions per place. [2024-06-14 15:50:43,717 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 127 selfloop transitions, 49 changer transitions 6/186 dead transitions. [2024-06-14 15:50:43,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 186 transitions, 2005 flow [2024-06-14 15:50:43,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:50:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:50:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2024-06-14 15:50:43,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42699724517906334 [2024-06-14 15:50:43,718 INFO L175 Difference]: Start difference. First operand has 216 places, 167 transitions, 1389 flow. Second operand 11 states and 155 transitions. [2024-06-14 15:50:43,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 186 transitions, 2005 flow [2024-06-14 15:50:43,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 186 transitions, 1870 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 15:50:43,831 INFO L231 Difference]: Finished difference. Result has 218 places, 165 transitions, 1344 flow [2024-06-14 15:50:43,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1344, PETRI_PLACES=218, PETRI_TRANSITIONS=165} [2024-06-14 15:50:43,832 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2024-06-14 15:50:43,832 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 165 transitions, 1344 flow [2024-06-14 15:50:43,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:43,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:43,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 15:50:43,833 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:50:43,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:43,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1372059847, now seen corresponding path program 8 times [2024-06-14 15:50:43,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:43,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892800643] [2024-06-14 15:50:43,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:43,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:49,428 INFO L134 CoverageAnalysis]: 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,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:49,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892800643] [2024-06-14 15:50:49,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892800643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:49,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:49,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:50:49,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927710457] [2024-06-14 15:50:49,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:49,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:50:49,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:49,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:50:49,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:50:49,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:50:49,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 165 transitions, 1344 flow. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call 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,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:49,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:50:49,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:50,086 INFO L124 PetriNetUnfolderBase]: 421/883 cut-off events. [2024-06-14 15:50:50,086 INFO L125 PetriNetUnfolderBase]: For 57478/57478 co-relation queries the response was YES. [2024-06-14 15:50:50,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4973 conditions, 883 events. 421/883 cut-off events. For 57478/57478 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5059 event pairs, 73 based on Foata normal form. 2/882 useless extension candidates. Maximal degree in co-relation 4875. Up to 628 conditions per place. [2024-06-14 15:50:50,093 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 117 selfloop transitions, 64 changer transitions 0/185 dead transitions. [2024-06-14 15:50:50,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 185 transitions, 1962 flow [2024-06-14 15:50:50,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:50:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:50:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 191 transitions. [2024-06-14 15:50:50,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44522144522144524 [2024-06-14 15:50:50,095 INFO L175 Difference]: Start difference. First operand has 218 places, 165 transitions, 1344 flow. Second operand 13 states and 191 transitions. [2024-06-14 15:50:50,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 185 transitions, 1962 flow [2024-06-14 15:50:50,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 185 transitions, 1858 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-14 15:50:50,206 INFO L231 Difference]: Finished difference. Result has 220 places, 168 transitions, 1460 flow [2024-06-14 15:50:50,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1460, PETRI_PLACES=220, PETRI_TRANSITIONS=168} [2024-06-14 15:50:50,210 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 188 predicate places. [2024-06-14 15:50:50,210 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 168 transitions, 1460 flow [2024-06-14 15:50:50,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call 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,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:50,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:50,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 15:50:50,210 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:50:50,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:50,211 INFO L85 PathProgramCache]: Analyzing trace with hash -760403535, now seen corresponding path program 9 times [2024-06-14 15:50:50,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:50,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506071274] [2024-06-14 15:50:50,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:50,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:56,487 INFO L134 CoverageAnalysis]: 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,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:56,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506071274] [2024-06-14 15:50:56,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506071274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:56,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:56,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159349200] [2024-06-14 15:50:56,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:56,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:56,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:56,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:56,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:56,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:50:56,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 168 transitions, 1460 flow. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call 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,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:56,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:50:56,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:57,023 INFO L124 PetriNetUnfolderBase]: 411/862 cut-off events. [2024-06-14 15:50:57,023 INFO L125 PetriNetUnfolderBase]: For 51239/51239 co-relation queries the response was YES. [2024-06-14 15:50:57,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4397 conditions, 862 events. 411/862 cut-off events. For 51239/51239 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4945 event pairs, 71 based on Foata normal form. 8/866 useless extension candidates. Maximal degree in co-relation 4299. Up to 601 conditions per place. [2024-06-14 15:50:57,030 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 122 selfloop transitions, 46 changer transitions 11/183 dead transitions. [2024-06-14 15:50:57,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 183 transitions, 1898 flow [2024-06-14 15:50:57,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:50:57,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:50:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2024-06-14 15:50:57,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44352617079889806 [2024-06-14 15:50:57,031 INFO L175 Difference]: Start difference. First operand has 220 places, 168 transitions, 1460 flow. Second operand 11 states and 161 transitions. [2024-06-14 15:50:57,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 183 transitions, 1898 flow [2024-06-14 15:50:57,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 183 transitions, 1778 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-14 15:50:57,129 INFO L231 Difference]: Finished difference. Result has 222 places, 164 transitions, 1406 flow [2024-06-14 15:50:57,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1406, PETRI_PLACES=222, PETRI_TRANSITIONS=164} [2024-06-14 15:50:57,129 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 190 predicate places. [2024-06-14 15:50:57,129 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 164 transitions, 1406 flow [2024-06-14 15:50:57,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call 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:57,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:57,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:57,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 15:50:57,130 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:50:57,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1977912113, now seen corresponding path program 10 times [2024-06-14 15:50:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:57,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556883971] [2024-06-14 15:50:57,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:03,209 INFO L134 CoverageAnalysis]: 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:03,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:03,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556883971] [2024-06-14 15:51:03,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556883971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:03,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:03,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:51:03,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513726642] [2024-06-14 15:51:03,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:03,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:51:03,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:03,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:51:03,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:51:03,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:51:03,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 164 transitions, 1406 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:03,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:51:03,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:03,919 INFO L124 PetriNetUnfolderBase]: 411/860 cut-off events. [2024-06-14 15:51:03,919 INFO L125 PetriNetUnfolderBase]: For 48438/48438 co-relation queries the response was YES. [2024-06-14 15:51:03,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4728 conditions, 860 events. 411/860 cut-off events. For 48438/48438 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4963 event pairs, 69 based on Foata normal form. 2/858 useless extension candidates. Maximal degree in co-relation 4628. Up to 590 conditions per place. [2024-06-14 15:51:03,925 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 116 selfloop transitions, 63 changer transitions 0/183 dead transitions. [2024-06-14 15:51:03,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 183 transitions, 2024 flow [2024-06-14 15:51:03,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:51:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:51:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 166 transitions. [2024-06-14 15:51:03,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-06-14 15:51:03,927 INFO L175 Difference]: Start difference. First operand has 222 places, 164 transitions, 1406 flow. Second operand 12 states and 166 transitions. [2024-06-14 15:51:03,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 183 transitions, 2024 flow [2024-06-14 15:51:04,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 183 transitions, 1892 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-06-14 15:51:04,031 INFO L231 Difference]: Finished difference. Result has 219 places, 167 transitions, 1502 flow [2024-06-14 15:51:04,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1502, PETRI_PLACES=219, PETRI_TRANSITIONS=167} [2024-06-14 15:51:04,032 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 187 predicate places. [2024-06-14 15:51:04,032 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 167 transitions, 1502 flow [2024-06-14 15:51:04,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:04,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:04,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:04,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 15:51:04,033 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:51:04,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:04,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1978238543, now seen corresponding path program 11 times [2024-06-14 15:51:04,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:04,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641166542] [2024-06-14 15:51:04,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:04,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:10,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:10,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641166542] [2024-06-14 15:51:10,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641166542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:10,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:10,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:51:10,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362872481] [2024-06-14 15:51:10,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:10,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:51:10,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:10,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:51:10,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:51:11,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:51:11,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 167 transitions, 1502 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:11,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:11,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:51:11,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:11,412 INFO L124 PetriNetUnfolderBase]: 423/888 cut-off events. [2024-06-14 15:51:11,412 INFO L125 PetriNetUnfolderBase]: For 60033/60033 co-relation queries the response was YES. [2024-06-14 15:51:11,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4845 conditions, 888 events. 423/888 cut-off events. For 60033/60033 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5135 event pairs, 75 based on Foata normal form. 8/892 useless extension candidates. Maximal degree in co-relation 4746. Up to 622 conditions per place. [2024-06-14 15:51:11,419 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 113 selfloop transitions, 57 changer transitions 9/183 dead transitions. [2024-06-14 15:51:11,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 183 transitions, 1940 flow [2024-06-14 15:51:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:51:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:51:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2024-06-14 15:51:11,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-14 15:51:11,420 INFO L175 Difference]: Start difference. First operand has 219 places, 167 transitions, 1502 flow. Second operand 12 states and 164 transitions. [2024-06-14 15:51:11,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 183 transitions, 1940 flow [2024-06-14 15:51:11,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 183 transitions, 1803 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-14 15:51:11,534 INFO L231 Difference]: Finished difference. Result has 223 places, 164 transitions, 1471 flow [2024-06-14 15:51:11,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1471, PETRI_PLACES=223, PETRI_TRANSITIONS=164} [2024-06-14 15:51:11,534 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 191 predicate places. [2024-06-14 15:51:11,534 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 164 transitions, 1471 flow [2024-06-14 15:51:11,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:11,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:11,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:11,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 15:51:11,535 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:51:11,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:11,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1987435313, now seen corresponding path program 12 times [2024-06-14 15:51:11,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:11,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825210558] [2024-06-14 15:51:11,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:11,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:18,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:18,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825210558] [2024-06-14 15:51:18,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825210558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:18,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:18,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:51:18,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133310673] [2024-06-14 15:51:18,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:18,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:51:18,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:18,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:51:18,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:51:18,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:51:18,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 164 transitions, 1471 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:18,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:18,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:51:18,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:19,195 INFO L124 PetriNetUnfolderBase]: 404/856 cut-off events. [2024-06-14 15:51:19,195 INFO L125 PetriNetUnfolderBase]: For 51107/51107 co-relation queries the response was YES. [2024-06-14 15:51:19,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4343 conditions, 856 events. 404/856 cut-off events. For 51107/51107 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4944 event pairs, 71 based on Foata normal form. 8/861 useless extension candidates. Maximal degree in co-relation 4242. Up to 619 conditions per place. [2024-06-14 15:51:19,206 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 116 selfloop transitions, 49 changer transitions 9/178 dead transitions. [2024-06-14 15:51:19,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 178 transitions, 1851 flow [2024-06-14 15:51:19,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:51:19,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:51:19,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2024-06-14 15:51:19,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065656565656566 [2024-06-14 15:51:19,207 INFO L175 Difference]: Start difference. First operand has 223 places, 164 transitions, 1471 flow. Second operand 12 states and 161 transitions. [2024-06-14 15:51:19,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 178 transitions, 1851 flow [2024-06-14 15:51:19,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 178 transitions, 1709 flow, removed 14 selfloop flow, removed 11 redundant places. [2024-06-14 15:51:19,295 INFO L231 Difference]: Finished difference. Result has 221 places, 159 transitions, 1391 flow [2024-06-14 15:51:19,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1391, PETRI_PLACES=221, PETRI_TRANSITIONS=159} [2024-06-14 15:51:19,295 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 189 predicate places. [2024-06-14 15:51:19,296 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 159 transitions, 1391 flow [2024-06-14 15:51:19,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:19,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:19,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:19,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 15:51:19,296 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:51:19,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:19,297 INFO L85 PathProgramCache]: Analyzing trace with hash 43083155, now seen corresponding path program 13 times [2024-06-14 15:51:19,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:19,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135818587] [2024-06-14 15:51:19,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:19,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:25,548 INFO L134 CoverageAnalysis]: 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:25,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:25,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135818587] [2024-06-14 15:51:25,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135818587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:25,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:25,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:51:25,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039093025] [2024-06-14 15:51:25,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:25,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:51:25,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:25,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:51:25,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:51:25,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:51:25,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 159 transitions, 1391 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:25,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:25,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:51:25,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:26,147 INFO L124 PetriNetUnfolderBase]: 385/823 cut-off events. [2024-06-14 15:51:26,147 INFO L125 PetriNetUnfolderBase]: For 39175/39175 co-relation queries the response was YES. [2024-06-14 15:51:26,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3843 conditions, 823 events. 385/823 cut-off events. For 39175/39175 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4724 event pairs, 67 based on Foata normal form. 8/828 useless extension candidates. Maximal degree in co-relation 3743. Up to 574 conditions per place. [2024-06-14 15:51:26,154 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 109 selfloop transitions, 52 changer transitions 9/174 dead transitions. [2024-06-14 15:51:26,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 174 transitions, 1765 flow [2024-06-14 15:51:26,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:51:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:51:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2024-06-14 15:51:26,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40326340326340326 [2024-06-14 15:51:26,155 INFO L175 Difference]: Start difference. First operand has 221 places, 159 transitions, 1391 flow. Second operand 13 states and 173 transitions. [2024-06-14 15:51:26,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 174 transitions, 1765 flow [2024-06-14 15:51:26,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 174 transitions, 1633 flow, removed 15 selfloop flow, removed 13 redundant places. [2024-06-14 15:51:26,238 INFO L231 Difference]: Finished difference. Result has 218 places, 154 transitions, 1333 flow [2024-06-14 15:51:26,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1333, PETRI_PLACES=218, PETRI_TRANSITIONS=154} [2024-06-14 15:51:26,238 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2024-06-14 15:51:26,238 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 154 transitions, 1333 flow [2024-06-14 15:51:26,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:26,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:26,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:26,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 15:51:26,239 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:51:26,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:26,239 INFO L85 PathProgramCache]: Analyzing trace with hash 54134345, now seen corresponding path program 14 times [2024-06-14 15:51:26,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:26,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032709642] [2024-06-14 15:51:26,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:26,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:32,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032709642] [2024-06-14 15:51:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032709642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:32,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:32,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:51:32,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378961548] [2024-06-14 15:51:32,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:32,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:51:32,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:32,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:51:32,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:51:32,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:51:32,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 154 transitions, 1333 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:32,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:32,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:51:32,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:32,797 INFO L124 PetriNetUnfolderBase]: 388/833 cut-off events. [2024-06-14 15:51:32,797 INFO L125 PetriNetUnfolderBase]: For 42940/42940 co-relation queries the response was YES. [2024-06-14 15:51:32,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4100 conditions, 833 events. 388/833 cut-off events. For 42940/42940 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4791 event pairs, 75 based on Foata normal form. 6/835 useless extension candidates. Maximal degree in co-relation 4002. Up to 475 conditions per place. [2024-06-14 15:51:32,804 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 105 selfloop transitions, 57 changer transitions 9/175 dead transitions. [2024-06-14 15:51:32,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 175 transitions, 1887 flow [2024-06-14 15:51:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-14 15:51:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-14 15:51:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 178 transitions. [2024-06-14 15:51:32,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4149184149184149 [2024-06-14 15:51:32,806 INFO L175 Difference]: Start difference. First operand has 218 places, 154 transitions, 1333 flow. Second operand 13 states and 178 transitions. [2024-06-14 15:51:32,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 175 transitions, 1887 flow [2024-06-14 15:51:32,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 175 transitions, 1769 flow, removed 5 selfloop flow, removed 14 redundant places. [2024-06-14 15:51:32,934 INFO L231 Difference]: Finished difference. Result has 214 places, 151 transitions, 1312 flow [2024-06-14 15:51:32,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1312, PETRI_PLACES=214, PETRI_TRANSITIONS=151} [2024-06-14 15:51:32,934 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 182 predicate places. [2024-06-14 15:51:32,934 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 151 transitions, 1312 flow [2024-06-14 15:51:32,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:32,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:32,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:32,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 15:51:32,935 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:51:32,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:32,936 INFO L85 PathProgramCache]: Analyzing trace with hash 350413037, now seen corresponding path program 15 times [2024-06-14 15:51:32,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:32,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848260832] [2024-06-14 15:51:32,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:32,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:39,312 INFO L134 CoverageAnalysis]: 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,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:39,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848260832] [2024-06-14 15:51:39,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848260832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:39,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:39,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:51:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420274648] [2024-06-14 15:51:39,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:39,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:51:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:39,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:51:39,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:51:39,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:51:39,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 151 transitions, 1312 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:39,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:51:39,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:40,038 INFO L124 PetriNetUnfolderBase]: 379/804 cut-off events. [2024-06-14 15:51:40,038 INFO L125 PetriNetUnfolderBase]: For 37881/37881 co-relation queries the response was YES. [2024-06-14 15:51:40,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4161 conditions, 804 events. 379/804 cut-off events. For 37881/37881 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4532 event pairs, 74 based on Foata normal form. 2/802 useless extension candidates. Maximal degree in co-relation 4065. Up to 535 conditions per place. [2024-06-14 15:51:40,044 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 103 selfloop transitions, 62 changer transitions 0/169 dead transitions. [2024-06-14 15:51:40,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 169 transitions, 1856 flow [2024-06-14 15:51:40,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:51:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:51:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 166 transitions. [2024-06-14 15:51:40,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41919191919191917 [2024-06-14 15:51:40,046 INFO L175 Difference]: Start difference. First operand has 214 places, 151 transitions, 1312 flow. Second operand 12 states and 166 transitions. [2024-06-14 15:51:40,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 169 transitions, 1856 flow [2024-06-14 15:51:40,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 169 transitions, 1738 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-14 15:51:40,135 INFO L231 Difference]: Finished difference. Result has 212 places, 153 transitions, 1380 flow [2024-06-14 15:51:40,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1380, PETRI_PLACES=212, PETRI_TRANSITIONS=153} [2024-06-14 15:51:40,135 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 180 predicate places. [2024-06-14 15:51:40,136 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 153 transitions, 1380 flow [2024-06-14 15:51:40,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:40,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:40,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 15:51:40,136 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:51:40,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash 864838099, now seen corresponding path program 16 times [2024-06-14 15:51:40,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:40,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097574842] [2024-06-14 15:51:40,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:40,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:47,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:47,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097574842] [2024-06-14 15:51:47,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097574842] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:47,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:47,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:51:47,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272112832] [2024-06-14 15:51:47,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:47,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:51:47,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:47,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:51:47,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:51:47,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:51:47,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 153 transitions, 1380 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:47,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:47,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:51:47,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:48,196 INFO L124 PetriNetUnfolderBase]: 391/830 cut-off events. [2024-06-14 15:51:48,196 INFO L125 PetriNetUnfolderBase]: For 50195/50195 co-relation queries the response was YES. [2024-06-14 15:51:48,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4347 conditions, 830 events. 391/830 cut-off events. For 50195/50195 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4690 event pairs, 80 based on Foata normal form. 8/834 useless extension candidates. Maximal degree in co-relation 4251. Up to 571 conditions per place. [2024-06-14 15:51:48,204 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 100 selfloop transitions, 56 changer transitions 9/169 dead transitions. [2024-06-14 15:51:48,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 169 transitions, 1790 flow [2024-06-14 15:51:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:51:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:51:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2024-06-14 15:51:48,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-14 15:51:48,205 INFO L175 Difference]: Start difference. First operand has 212 places, 153 transitions, 1380 flow. Second operand 12 states and 164 transitions. [2024-06-14 15:51:48,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 169 transitions, 1790 flow [2024-06-14 15:51:48,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 169 transitions, 1565 flow, removed 27 selfloop flow, removed 11 redundant places. [2024-06-14 15:51:48,308 INFO L231 Difference]: Finished difference. Result has 213 places, 150 transitions, 1265 flow [2024-06-14 15:51:48,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1265, PETRI_PLACES=213, PETRI_TRANSITIONS=150} [2024-06-14 15:51:48,309 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 181 predicate places. [2024-06-14 15:51:48,309 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 150 transitions, 1265 flow [2024-06-14 15:51:48,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:48,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:48,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:48,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 15:51:48,310 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:51:48,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash 606290659, now seen corresponding path program 17 times [2024-06-14 15:51:48,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:48,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136842530] [2024-06-14 15:51:48,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:48,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:55,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:55,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136842530] [2024-06-14 15:51:55,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136842530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:55,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:55,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:51:55,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806093191] [2024-06-14 15:51:55,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:55,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:51:55,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:55,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:51:55,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:51:55,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:51:55,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 150 transitions, 1265 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:55,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:55,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:51:55,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:55,999 INFO L124 PetriNetUnfolderBase]: 386/826 cut-off events. [2024-06-14 15:51:55,999 INFO L125 PetriNetUnfolderBase]: For 51213/51213 co-relation queries the response was YES. [2024-06-14 15:51:56,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4070 conditions, 826 events. 386/826 cut-off events. For 51213/51213 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4670 event pairs, 76 based on Foata normal form. 8/831 useless extension candidates. Maximal degree in co-relation 3975. Up to 597 conditions per place. [2024-06-14 15:51:56,006 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 106 selfloop transitions, 47 changer transitions 9/166 dead transitions. [2024-06-14 15:51:56,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 166 transitions, 1653 flow [2024-06-14 15:51:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:51:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:51:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 162 transitions. [2024-06-14 15:51:56,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 15:51:56,007 INFO L175 Difference]: Start difference. First operand has 213 places, 150 transitions, 1265 flow. Second operand 12 states and 162 transitions. [2024-06-14 15:51:56,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 166 transitions, 1653 flow [2024-06-14 15:51:56,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 166 transitions, 1537 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-14 15:51:56,094 INFO L231 Difference]: Finished difference. Result has 211 places, 147 transitions, 1222 flow [2024-06-14 15:51:56,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1222, PETRI_PLACES=211, PETRI_TRANSITIONS=147} [2024-06-14 15:51:56,095 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 179 predicate places. [2024-06-14 15:51:56,095 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 147 transitions, 1222 flow [2024-06-14 15:51:56,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:56,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:56,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:56,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 15:51:56,096 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:51:56,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:56,096 INFO L85 PathProgramCache]: Analyzing trace with hash 599140819, now seen corresponding path program 18 times [2024-06-14 15:51:56,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:56,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185198444] [2024-06-14 15:51:56,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:56,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:03,017 INFO L134 CoverageAnalysis]: 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:03,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:03,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185198444] [2024-06-14 15:52:03,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185198444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:03,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:03,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:52:03,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883537625] [2024-06-14 15:52:03,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:03,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:52:03,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:03,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:52:03,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:52:03,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:52:03,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 147 transitions, 1222 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:03,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:03,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:52:03,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:03,701 INFO L124 PetriNetUnfolderBase]: 367/788 cut-off events. [2024-06-14 15:52:03,701 INFO L125 PetriNetUnfolderBase]: For 40807/40807 co-relation queries the response was YES. [2024-06-14 15:52:03,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3593 conditions, 788 events. 367/788 cut-off events. For 40807/40807 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4409 event pairs, 78 based on Foata normal form. 8/792 useless extension candidates. Maximal degree in co-relation 3499. Up to 540 conditions per place. [2024-06-14 15:52:03,708 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 97 selfloop transitions, 51 changer transitions 9/161 dead transitions. [2024-06-14 15:52:03,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 161 transitions, 1568 flow [2024-06-14 15:52:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:52:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:52:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2024-06-14 15:52:03,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065656565656566 [2024-06-14 15:52:03,710 INFO L175 Difference]: Start difference. First operand has 211 places, 147 transitions, 1222 flow. Second operand 12 states and 161 transitions. [2024-06-14 15:52:03,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 161 transitions, 1568 flow [2024-06-14 15:52:03,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 161 transitions, 1444 flow, removed 15 selfloop flow, removed 11 redundant places. [2024-06-14 15:52:03,784 INFO L231 Difference]: Finished difference. Result has 209 places, 142 transitions, 1171 flow [2024-06-14 15:52:03,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1171, PETRI_PLACES=209, PETRI_TRANSITIONS=142} [2024-06-14 15:52:03,785 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2024-06-14 15:52:03,785 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 142 transitions, 1171 flow [2024-06-14 15:52:03,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:03,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:03,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:03,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 15:52:03,786 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:52:03,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:03,786 INFO L85 PathProgramCache]: Analyzing trace with hash -978414135, now seen corresponding path program 1 times [2024-06-14 15:52:03,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:03,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613632582] [2024-06-14 15:52:03,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:03,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:12,018 INFO L134 CoverageAnalysis]: 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:12,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:12,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613632582] [2024-06-14 15:52:12,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613632582] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:12,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:12,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:12,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823955843] [2024-06-14 15:52:12,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:12,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:12,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:12,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:12,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:12,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:52:12,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 142 transitions, 1171 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:12,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:12,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:52:12,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:12,658 INFO L124 PetriNetUnfolderBase]: 358/773 cut-off events. [2024-06-14 15:52:12,658 INFO L125 PetriNetUnfolderBase]: For 35289/35289 co-relation queries the response was YES. [2024-06-14 15:52:12,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3499 conditions, 773 events. 358/773 cut-off events. For 35289/35289 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4348 event pairs, 64 based on Foata normal form. 6/775 useless extension candidates. Maximal degree in co-relation 3406. Up to 617 conditions per place. [2024-06-14 15:52:12,664 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 127 selfloop transitions, 6 changer transitions 21/158 dead transitions. [2024-06-14 15:52:12,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 158 transitions, 1527 flow [2024-06-14 15:52:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:52:12,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:52:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-14 15:52:12,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 15:52:12,666 INFO L175 Difference]: Start difference. First operand has 209 places, 142 transitions, 1171 flow. Second operand 9 states and 117 transitions. [2024-06-14 15:52:12,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 158 transitions, 1527 flow [2024-06-14 15:52:12,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 158 transitions, 1413 flow, removed 4 selfloop flow, removed 13 redundant places. [2024-06-14 15:52:12,742 INFO L231 Difference]: Finished difference. Result has 202 places, 136 transitions, 1039 flow [2024-06-14 15:52:12,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1039, PETRI_PLACES=202, PETRI_TRANSITIONS=136} [2024-06-14 15:52:12,743 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 170 predicate places. [2024-06-14 15:52:12,743 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 136 transitions, 1039 flow [2024-06-14 15:52:12,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:12,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:12,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:12,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 15:52:12,744 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:52:12,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:12,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1648445875, now seen corresponding path program 2 times [2024-06-14 15:52:12,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:12,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036511951] [2024-06-14 15:52:12,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:12,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:19,897 INFO L134 CoverageAnalysis]: 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:19,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:19,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036511951] [2024-06-14 15:52:19,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036511951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:19,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:19,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:19,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605918206] [2024-06-14 15:52:19,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:19,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:19,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:19,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:19,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:20,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:52:20,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 136 transitions, 1039 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:20,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:20,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:52:20,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:20,297 INFO L124 PetriNetUnfolderBase]: 330/722 cut-off events. [2024-06-14 15:52:20,297 INFO L125 PetriNetUnfolderBase]: For 33993/33993 co-relation queries the response was YES. [2024-06-14 15:52:20,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 722 events. 330/722 cut-off events. For 33993/33993 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4016 event pairs, 60 based on Foata normal form. 6/725 useless extension candidates. Maximal degree in co-relation 3118. Up to 500 conditions per place. [2024-06-14 15:52:20,303 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 92 selfloop transitions, 45 changer transitions 10/151 dead transitions. [2024-06-14 15:52:20,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 151 transitions, 1377 flow [2024-06-14 15:52:20,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:52:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:52:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-14 15:52:20,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-14 15:52:20,304 INFO L175 Difference]: Start difference. First operand has 202 places, 136 transitions, 1039 flow. Second operand 11 states and 148 transitions. [2024-06-14 15:52:20,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 151 transitions, 1377 flow [2024-06-14 15:52:20,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 151 transitions, 1351 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 15:52:20,379 INFO L231 Difference]: Finished difference. Result has 194 places, 133 transitions, 1085 flow [2024-06-14 15:52:20,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1085, PETRI_PLACES=194, PETRI_TRANSITIONS=133} [2024-06-14 15:52:20,380 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 162 predicate places. [2024-06-14 15:52:20,380 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 133 transitions, 1085 flow [2024-06-14 15:52:20,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:20,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:20,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:20,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 15:52:20,381 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:52:20,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:20,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1774962761, now seen corresponding path program 3 times [2024-06-14 15:52:20,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:20,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36467648] [2024-06-14 15:52:20,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:20,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:27,610 INFO L134 CoverageAnalysis]: 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:27,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36467648] [2024-06-14 15:52:27,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36467648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:27,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:27,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:27,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877460297] [2024-06-14 15:52:27,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:27,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:27,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:27,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:27,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:27,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:52:27,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 133 transitions, 1085 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:27,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:27,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:52:27,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:28,143 INFO L124 PetriNetUnfolderBase]: 323/709 cut-off events. [2024-06-14 15:52:28,143 INFO L125 PetriNetUnfolderBase]: For 29122/29122 co-relation queries the response was YES. [2024-06-14 15:52:28,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3192 conditions, 709 events. 323/709 cut-off events. For 29122/29122 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3902 event pairs, 58 based on Foata normal form. 6/712 useless extension candidates. Maximal degree in co-relation 3106. Up to 482 conditions per place. [2024-06-14 15:52:28,149 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 91 selfloop transitions, 41 changer transitions 13/149 dead transitions. [2024-06-14 15:52:28,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 149 transitions, 1421 flow [2024-06-14 15:52:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:52:28,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:52:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-14 15:52:28,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-14 15:52:28,150 INFO L175 Difference]: Start difference. First operand has 194 places, 133 transitions, 1085 flow. Second operand 11 states and 147 transitions. [2024-06-14 15:52:28,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 149 transitions, 1421 flow [2024-06-14 15:52:28,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 149 transitions, 1325 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 15:52:28,225 INFO L231 Difference]: Finished difference. Result has 191 places, 129 transitions, 1047 flow [2024-06-14 15:52:28,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1047, PETRI_PLACES=191, PETRI_TRANSITIONS=129} [2024-06-14 15:52:28,226 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 159 predicate places. [2024-06-14 15:52:28,226 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 129 transitions, 1047 flow [2024-06-14 15:52:28,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:28,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:28,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:28,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 15:52:28,226 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:52:28,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:28,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1383312811, now seen corresponding path program 4 times [2024-06-14 15:52:28,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:28,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904784618] [2024-06-14 15:52:28,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:28,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:35,231 INFO L134 CoverageAnalysis]: 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:35,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:35,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904784618] [2024-06-14 15:52:35,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904784618] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:35,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:35,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:35,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494065123] [2024-06-14 15:52:35,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:35,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:35,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:35,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:35,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:35,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:52:35,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 129 transitions, 1047 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:35,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:52:35,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:35,810 INFO L124 PetriNetUnfolderBase]: 312/684 cut-off events. [2024-06-14 15:52:35,811 INFO L125 PetriNetUnfolderBase]: For 28231/28231 co-relation queries the response was YES. [2024-06-14 15:52:35,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3089 conditions, 684 events. 312/684 cut-off events. For 28231/28231 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3703 event pairs, 52 based on Foata normal form. 6/687 useless extension candidates. Maximal degree in co-relation 3004. Up to 436 conditions per place. [2024-06-14 15:52:35,816 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 90 selfloop transitions, 40 changer transitions 12/146 dead transitions. [2024-06-14 15:52:35,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 146 transitions, 1379 flow [2024-06-14 15:52:35,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:52:35,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:52:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-14 15:52:35,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-14 15:52:35,817 INFO L175 Difference]: Start difference. First operand has 191 places, 129 transitions, 1047 flow. Second operand 11 states and 147 transitions. [2024-06-14 15:52:35,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 146 transitions, 1379 flow [2024-06-14 15:52:35,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 146 transitions, 1289 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:52:35,883 INFO L231 Difference]: Finished difference. Result has 186 places, 125 transitions, 1013 flow [2024-06-14 15:52:35,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1013, PETRI_PLACES=186, PETRI_TRANSITIONS=125} [2024-06-14 15:52:35,883 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2024-06-14 15:52:35,884 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 125 transitions, 1013 flow [2024-06-14 15:52:35,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:35,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:35,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-14 15:52:35,884 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:52:35,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:35,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1560444331, now seen corresponding path program 5 times [2024-06-14 15:52:35,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:35,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147668185] [2024-06-14 15:52:35,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:35,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:43,347 INFO L134 CoverageAnalysis]: 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:43,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147668185] [2024-06-14 15:52:43,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147668185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:43,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:43,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:43,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825401205] [2024-06-14 15:52:43,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:43,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:43,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:43,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:43,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:52:43,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 125 transitions, 1013 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:43,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:43,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:52:43,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:43,964 INFO L124 PetriNetUnfolderBase]: 298/660 cut-off events. [2024-06-14 15:52:43,964 INFO L125 PetriNetUnfolderBase]: For 26306/26306 co-relation queries the response was YES. [2024-06-14 15:52:43,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2983 conditions, 660 events. 298/660 cut-off events. For 26306/26306 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3567 event pairs, 54 based on Foata normal form. 6/663 useless extension candidates. Maximal degree in co-relation 2900. Up to 446 conditions per place. [2024-06-14 15:52:43,969 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 88 selfloop transitions, 38 changer transitions 10/140 dead transitions. [2024-06-14 15:52:43,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 140 transitions, 1329 flow [2024-06-14 15:52:43,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:52:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:52:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-14 15:52:43,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39118457300275483 [2024-06-14 15:52:43,970 INFO L175 Difference]: Start difference. First operand has 186 places, 125 transitions, 1013 flow. Second operand 11 states and 142 transitions. [2024-06-14 15:52:43,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 140 transitions, 1329 flow [2024-06-14 15:52:44,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 140 transitions, 1243 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 15:52:44,035 INFO L231 Difference]: Finished difference. Result has 181 places, 122 transitions, 985 flow [2024-06-14 15:52:44,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=985, PETRI_PLACES=181, PETRI_TRANSITIONS=122} [2024-06-14 15:52:44,040 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-14 15:52:44,040 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 122 transitions, 985 flow [2024-06-14 15:52:44,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:44,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:44,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:44,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-14 15:52:44,041 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:52:44,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash -979700147, now seen corresponding path program 6 times [2024-06-14 15:52:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267908515] [2024-06-14 15:52:44,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:44,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:50,709 INFO L134 CoverageAnalysis]: 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:50,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:50,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267908515] [2024-06-14 15:52:50,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267908515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:50,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:50,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:50,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740853788] [2024-06-14 15:52:50,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:50,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:50,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:50,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:50,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:50,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:52:50,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 122 transitions, 985 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:50,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:50,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:52:50,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:51,082 INFO L124 PetriNetUnfolderBase]: 291/647 cut-off events. [2024-06-14 15:52:51,082 INFO L125 PetriNetUnfolderBase]: For 24510/24510 co-relation queries the response was YES. [2024-06-14 15:52:51,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 647 events. 291/647 cut-off events. For 24510/24510 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3478 event pairs, 54 based on Foata normal form. 6/650 useless extension candidates. Maximal degree in co-relation 2822. Up to 436 conditions per place. [2024-06-14 15:52:51,086 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 86 selfloop transitions, 37 changer transitions 10/137 dead transitions. [2024-06-14 15:52:51,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 137 transitions, 1295 flow [2024-06-14 15:52:51,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:52:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:52:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-14 15:52:51,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-14 15:52:51,088 INFO L175 Difference]: Start difference. First operand has 181 places, 122 transitions, 985 flow. Second operand 11 states and 146 transitions. [2024-06-14 15:52:51,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 137 transitions, 1295 flow [2024-06-14 15:52:51,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 137 transitions, 1215 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:52:51,139 INFO L231 Difference]: Finished difference. Result has 178 places, 119 transitions, 961 flow [2024-06-14 15:52:51,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=961, PETRI_PLACES=178, PETRI_TRANSITIONS=119} [2024-06-14 15:52:51,140 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 146 predicate places. [2024-06-14 15:52:51,140 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 119 transitions, 961 flow [2024-06-14 15:52:51,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:51,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:51,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:51,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-14 15:52:51,140 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:52:51,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:51,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1805289707, now seen corresponding path program 7 times [2024-06-14 15:52:51,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:51,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294084083] [2024-06-14 15:52:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:51,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:59,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:59,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294084083] [2024-06-14 15:52:59,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294084083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:59,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:59,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907704130] [2024-06-14 15:52:59,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:59,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:59,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:59,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:59,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:59,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 15:52:59,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 119 transitions, 961 flow. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call 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:59,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:59,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 15:52:59,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:59,631 INFO L124 PetriNetUnfolderBase]: 284/632 cut-off events. [2024-06-14 15:52:59,632 INFO L125 PetriNetUnfolderBase]: For 23634/23634 co-relation queries the response was YES. [2024-06-14 15:52:59,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2834 conditions, 632 events. 284/632 cut-off events. For 23634/23634 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3375 event pairs, 52 based on Foata normal form. 6/635 useless extension candidates. Maximal degree in co-relation 2754. Up to 418 conditions per place. [2024-06-14 15:52:59,636 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 83 selfloop transitions, 35 changer transitions 13/135 dead transitions. [2024-06-14 15:52:59,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 135 transitions, 1269 flow [2024-06-14 15:52:59,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:52:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:52:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 15:52:59,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371900826446281 [2024-06-14 15:52:59,638 INFO L175 Difference]: Start difference. First operand has 178 places, 119 transitions, 961 flow. Second operand 11 states and 135 transitions. [2024-06-14 15:52:59,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 135 transitions, 1269 flow [2024-06-14 15:52:59,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 135 transitions, 1191 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:52:59,691 INFO L231 Difference]: Finished difference. Result has 175 places, 115 transitions, 929 flow [2024-06-14 15:52:59,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=929, PETRI_PLACES=175, PETRI_TRANSITIONS=115} [2024-06-14 15:52:59,692 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 143 predicate places. [2024-06-14 15:52:59,692 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 115 transitions, 929 flow [2024-06-14 15:52:59,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call 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:59,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:59,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:59,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-14 15:52:59,693 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:52:59,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:59,693 INFO L85 PathProgramCache]: Analyzing trace with hash 50466889, now seen corresponding path program 8 times [2024-06-14 15:52:59,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:59,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133033527] [2024-06-14 15:52:59,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:59,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:07,323 INFO L134 CoverageAnalysis]: 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,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:07,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133033527] [2024-06-14 15:53:07,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133033527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:07,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:07,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:07,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008738266] [2024-06-14 15:53:07,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:07,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:07,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:07,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:07,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:07,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:53:07,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 115 transitions, 929 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:07,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:53:07,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:07,839 INFO L124 PetriNetUnfolderBase]: 273/611 cut-off events. [2024-06-14 15:53:07,839 INFO L125 PetriNetUnfolderBase]: For 22778/22778 co-relation queries the response was YES. [2024-06-14 15:53:07,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 611 events. 273/611 cut-off events. For 22778/22778 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3231 event pairs, 50 based on Foata normal form. 6/614 useless extension candidates. Maximal degree in co-relation 2666. Up to 400 conditions per place. [2024-06-14 15:53:07,843 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 79 selfloop transitions, 31 changer transitions 17/131 dead transitions. [2024-06-14 15:53:07,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 131 transitions, 1229 flow [2024-06-14 15:53:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-14 15:53:07,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39118457300275483 [2024-06-14 15:53:07,844 INFO L175 Difference]: Start difference. First operand has 175 places, 115 transitions, 929 flow. Second operand 11 states and 142 transitions. [2024-06-14 15:53:07,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 131 transitions, 1229 flow [2024-06-14 15:53:07,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 131 transitions, 1153 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:07,895 INFO L231 Difference]: Finished difference. Result has 170 places, 108 transitions, 869 flow [2024-06-14 15:53:07,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=869, PETRI_PLACES=170, PETRI_TRANSITIONS=108} [2024-06-14 15:53:07,896 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 138 predicate places. [2024-06-14 15:53:07,896 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 108 transitions, 869 flow [2024-06-14 15:53:07,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:07,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:07,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-14 15:53:07,896 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:53:07,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:07,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1512417085, now seen corresponding path program 9 times [2024-06-14 15:53:07,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:07,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030862830] [2024-06-14 15:53:07,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:07,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:15,716 INFO L134 CoverageAnalysis]: 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:15,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:15,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030862830] [2024-06-14 15:53:15,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030862830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:15,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:15,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:15,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678018989] [2024-06-14 15:53:15,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:15,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:15,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:15,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:15,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:15,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:53:15,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 108 transitions, 869 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:15,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:15,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:53:15,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:16,238 INFO L124 PetriNetUnfolderBase]: 257/585 cut-off events. [2024-06-14 15:53:16,239 INFO L125 PetriNetUnfolderBase]: For 21106/21106 co-relation queries the response was YES. [2024-06-14 15:53:16,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2617 conditions, 585 events. 257/585 cut-off events. For 21106/21106 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3090 event pairs, 46 based on Foata normal form. 6/588 useless extension candidates. Maximal degree in co-relation 2540. Up to 374 conditions per place. [2024-06-14 15:53:16,242 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 76 selfloop transitions, 26 changer transitions 19/125 dead transitions. [2024-06-14 15:53:16,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 125 transitions, 1159 flow [2024-06-14 15:53:16,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:53:16,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-14 15:53:16,244 INFO L175 Difference]: Start difference. First operand has 170 places, 108 transitions, 869 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:53:16,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 125 transitions, 1159 flow [2024-06-14 15:53:16,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 125 transitions, 1091 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 15:53:16,286 INFO L231 Difference]: Finished difference. Result has 164 places, 100 transitions, 798 flow [2024-06-14 15:53:16,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=798, PETRI_PLACES=164, PETRI_TRANSITIONS=100} [2024-06-14 15:53:16,286 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2024-06-14 15:53:16,287 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 100 transitions, 798 flow [2024-06-14 15:53:16,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:16,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:16,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:16,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-14 15:53:16,288 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:53:16,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1273084937, now seen corresponding path program 10 times [2024-06-14 15:53:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:16,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950301196] [2024-06-14 15:53:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:24,750 INFO L134 CoverageAnalysis]: 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:24,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:24,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950301196] [2024-06-14 15:53:24,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950301196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:24,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:24,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:24,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780949861] [2024-06-14 15:53:24,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:24,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:24,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:24,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:24,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:24,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:53:24,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 100 transitions, 798 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:24,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:24,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:53:24,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:25,197 INFO L124 PetriNetUnfolderBase]: 234/538 cut-off events. [2024-06-14 15:53:25,198 INFO L125 PetriNetUnfolderBase]: For 19468/19468 co-relation queries the response was YES. [2024-06-14 15:53:25,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 538 events. 234/538 cut-off events. For 19468/19468 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2799 event pairs, 37 based on Foata normal form. 6/541 useless extension candidates. Maximal degree in co-relation 2326. Up to 225 conditions per place. [2024-06-14 15:53:25,201 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 59 selfloop transitions, 34 changer transitions 21/118 dead transitions. [2024-06-14 15:53:25,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 118 transitions, 1076 flow [2024-06-14 15:53:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-14 15:53:25,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-14 15:53:25,202 INFO L175 Difference]: Start difference. First operand has 164 places, 100 transitions, 798 flow. Second operand 11 states and 146 transitions. [2024-06-14 15:53:25,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 118 transitions, 1076 flow [2024-06-14 15:53:25,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 118 transitions, 1014 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:25,245 INFO L231 Difference]: Finished difference. Result has 157 places, 89 transitions, 727 flow [2024-06-14 15:53:25,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=727, PETRI_PLACES=157, PETRI_TRANSITIONS=89} [2024-06-14 15:53:25,246 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 125 predicate places. [2024-06-14 15:53:25,246 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 89 transitions, 727 flow [2024-06-14 15:53:25,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:25,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:25,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:25,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-14 15:53:25,247 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:53:25,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:25,247 INFO L85 PathProgramCache]: Analyzing trace with hash -90449041, now seen corresponding path program 11 times [2024-06-14 15:53:25,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:25,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405831326] [2024-06-14 15:53:25,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:25,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:32,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:32,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405831326] [2024-06-14 15:53:32,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405831326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:32,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:32,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:32,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485595173] [2024-06-14 15:53:32,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:32,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:32,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:32,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:32,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:33,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:53:33,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 89 transitions, 727 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:33,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:53:33,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:33,279 INFO L124 PetriNetUnfolderBase]: 202/466 cut-off events. [2024-06-14 15:53:33,279 INFO L125 PetriNetUnfolderBase]: For 17128/17128 co-relation queries the response was YES. [2024-06-14 15:53:33,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 466 events. 202/466 cut-off events. For 17128/17128 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2321 event pairs, 33 based on Foata normal form. 6/469 useless extension candidates. Maximal degree in co-relation 2093. Up to 221 conditions per place. [2024-06-14 15:53:33,283 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 55 selfloop transitions, 35 changer transitions 12/106 dead transitions. [2024-06-14 15:53:33,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 106 transitions, 979 flow [2024-06-14 15:53:33,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-14 15:53:33,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-14 15:53:33,284 INFO L175 Difference]: Start difference. First operand has 157 places, 89 transitions, 727 flow. Second operand 11 states and 146 transitions. [2024-06-14 15:53:33,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 106 transitions, 979 flow [2024-06-14 15:53:33,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 106 transitions, 888 flow, removed 6 selfloop flow, removed 14 redundant places. [2024-06-14 15:53:33,310 INFO L231 Difference]: Finished difference. Result has 143 places, 85 transitions, 683 flow [2024-06-14 15:53:33,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=683, PETRI_PLACES=143, PETRI_TRANSITIONS=85} [2024-06-14 15:53:33,310 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-14 15:53:33,310 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 85 transitions, 683 flow [2024-06-14 15:53:33,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:33,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:33,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-14 15:53:33,311 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:53:33,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:33,311 INFO L85 PathProgramCache]: Analyzing trace with hash 50099423, now seen corresponding path program 12 times [2024-06-14 15:53:33,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:33,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638628224] [2024-06-14 15:53:33,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:33,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:41,117 INFO L134 CoverageAnalysis]: 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:41,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638628224] [2024-06-14 15:53:41,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638628224] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:41,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:41,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:41,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137032517] [2024-06-14 15:53:41,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:41,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:41,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:41,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:41,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:41,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:53:41,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 85 transitions, 683 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:41,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:41,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:53:41,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:41,683 INFO L124 PetriNetUnfolderBase]: 188/440 cut-off events. [2024-06-14 15:53:41,684 INFO L125 PetriNetUnfolderBase]: For 13660/13660 co-relation queries the response was YES. [2024-06-14 15:53:41,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2003 conditions, 440 events. 188/440 cut-off events. For 13660/13660 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2162 event pairs, 36 based on Foata normal form. 6/443 useless extension candidates. Maximal degree in co-relation 1949. Up to 289 conditions per place. [2024-06-14 15:53:41,687 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 63 selfloop transitions, 23 changer transitions 10/100 dead transitions. [2024-06-14 15:53:41,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 100 transitions, 919 flow [2024-06-14 15:53:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-14 15:53:41,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-14 15:53:41,688 INFO L175 Difference]: Start difference. First operand has 143 places, 85 transitions, 683 flow. Second operand 11 states and 144 transitions. [2024-06-14 15:53:41,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 100 transitions, 919 flow [2024-06-14 15:53:41,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 100 transitions, 841 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-14 15:53:41,708 INFO L231 Difference]: Finished difference. Result has 137 places, 82 transitions, 633 flow [2024-06-14 15:53:41,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=633, PETRI_PLACES=137, PETRI_TRANSITIONS=82} [2024-06-14 15:53:41,709 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 105 predicate places. [2024-06-14 15:53:41,709 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 82 transitions, 633 flow [2024-06-14 15:53:41,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:41,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:41,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:41,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-14 15:53:41,709 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:53:41,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:41,710 INFO L85 PathProgramCache]: Analyzing trace with hash 352861279, now seen corresponding path program 13 times [2024-06-14 15:53:41,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:41,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107625016] [2024-06-14 15:53:41,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:41,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:49,260 INFO L134 CoverageAnalysis]: 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:49,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:49,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107625016] [2024-06-14 15:53:49,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107625016] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:49,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:49,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:49,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633375032] [2024-06-14 15:53:49,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:49,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:49,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:49,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:49,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:49,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:53:49,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 82 transitions, 633 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:49,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:49,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:53:49,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:49,818 INFO L124 PetriNetUnfolderBase]: 181/425 cut-off events. [2024-06-14 15:53:49,819 INFO L125 PetriNetUnfolderBase]: For 11734/11734 co-relation queries the response was YES. [2024-06-14 15:53:49,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 425 events. 181/425 cut-off events. For 11734/11734 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2061 event pairs, 31 based on Foata normal form. 6/428 useless extension candidates. Maximal degree in co-relation 1825. Up to 265 conditions per place. [2024-06-14 15:53:49,821 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 62 selfloop transitions, 22 changer transitions 10/98 dead transitions. [2024-06-14 15:53:49,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 98 transitions, 867 flow [2024-06-14 15:53:49,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:53:49,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-14 15:53:49,822 INFO L175 Difference]: Start difference. First operand has 137 places, 82 transitions, 633 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:53:49,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 98 transitions, 867 flow [2024-06-14 15:53:49,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 98 transitions, 817 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:49,840 INFO L231 Difference]: Finished difference. Result has 134 places, 78 transitions, 604 flow [2024-06-14 15:53:49,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=604, PETRI_PLACES=134, PETRI_TRANSITIONS=78} [2024-06-14 15:53:49,841 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 102 predicate places. [2024-06-14 15:53:49,841 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 78 transitions, 604 flow [2024-06-14 15:53:49,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:49,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:49,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:49,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-14 15:53:49,842 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:53:49,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:49,842 INFO L85 PathProgramCache]: Analyzing trace with hash 936975549, now seen corresponding path program 14 times [2024-06-14 15:53:49,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:49,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838402031] [2024-06-14 15:53:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:49,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:56,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:56,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838402031] [2024-06-14 15:53:56,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838402031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:56,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:56,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:56,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538958609] [2024-06-14 15:53:56,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:56,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:56,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:56,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:53:56,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 78 transitions, 604 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:56,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:56,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:53:56,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:56,949 INFO L124 PetriNetUnfolderBase]: 166/390 cut-off events. [2024-06-14 15:53:56,950 INFO L125 PetriNetUnfolderBase]: For 8532/8532 co-relation queries the response was YES. [2024-06-14 15:53:56,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 390 events. 166/390 cut-off events. For 8532/8532 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1849 event pairs, 34 based on Foata normal form. 2/389 useless extension candidates. Maximal degree in co-relation 1715. Up to 265 conditions per place. [2024-06-14 15:53:56,952 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 63 selfloop transitions, 25 changer transitions 0/92 dead transitions. [2024-06-14 15:53:56,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 92 transitions, 822 flow [2024-06-14 15:53:56,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-14 15:53:56,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39118457300275483 [2024-06-14 15:53:56,953 INFO L175 Difference]: Start difference. First operand has 134 places, 78 transitions, 604 flow. Second operand 11 states and 142 transitions. [2024-06-14 15:53:56,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 92 transitions, 822 flow [2024-06-14 15:53:56,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 92 transitions, 772 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-14 15:53:56,969 INFO L231 Difference]: Finished difference. Result has 129 places, 79 transitions, 622 flow [2024-06-14 15:53:56,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=622, PETRI_PLACES=129, PETRI_TRANSITIONS=79} [2024-06-14 15:53:56,969 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 97 predicate places. [2024-06-14 15:53:56,969 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 79 transitions, 622 flow [2024-06-14 15:53:56,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:56,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:56,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:56,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-14 15:53:56,970 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:53:56,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash -950636561, now seen corresponding path program 15 times [2024-06-14 15:53:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:56,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985388300] [2024-06-14 15:53:56,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:56,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:04,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:04,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985388300] [2024-06-14 15:54:04,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985388300] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:04,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:04,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:54:04,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165328195] [2024-06-14 15:54:04,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:04,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:54:04,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:04,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:54:04,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:54:04,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:54:04,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 79 transitions, 622 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:04,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:04,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:54:04,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:04,560 INFO L124 PetriNetUnfolderBase]: 174/410 cut-off events. [2024-06-14 15:54:04,560 INFO L125 PetriNetUnfolderBase]: For 10008/10008 co-relation queries the response was YES. [2024-06-14 15:54:04,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 410 events. 174/410 cut-off events. For 10008/10008 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1959 event pairs, 36 based on Foata normal form. 6/413 useless extension candidates. Maximal degree in co-relation 1777. Up to 269 conditions per place. [2024-06-14 15:54:04,563 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 60 selfloop transitions, 21 changer transitions 10/95 dead transitions. [2024-06-14 15:54:04,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 95 transitions, 852 flow [2024-06-14 15:54:04,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:54:04,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:54:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 155 transitions. [2024-06-14 15:54:04,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39141414141414144 [2024-06-14 15:54:04,564 INFO L175 Difference]: Start difference. First operand has 129 places, 79 transitions, 622 flow. Second operand 12 states and 155 transitions. [2024-06-14 15:54:04,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 95 transitions, 852 flow [2024-06-14 15:54:04,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 95 transitions, 794 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-14 15:54:04,579 INFO L231 Difference]: Finished difference. Result has 132 places, 76 transitions, 589 flow [2024-06-14 15:54:04,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=589, PETRI_PLACES=132, PETRI_TRANSITIONS=76} [2024-06-14 15:54:04,579 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2024-06-14 15:54:04,579 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 76 transitions, 589 flow [2024-06-14 15:54:04,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:04,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:04,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:04,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-14 15:54:04,580 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:04,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:04,580 INFO L85 PathProgramCache]: Analyzing trace with hash 80253389, now seen corresponding path program 16 times [2024-06-14 15:54:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:04,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647804337] [2024-06-14 15:54:04,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:04,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:12,172 INFO L134 CoverageAnalysis]: 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:12,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647804337] [2024-06-14 15:54:12,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647804337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:12,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:12,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:12,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667758760] [2024-06-14 15:54:12,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:12,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:12,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:12,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:12,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:12,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:54:12,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 76 transitions, 589 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:12,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:12,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:54:12,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:12,767 INFO L124 PetriNetUnfolderBase]: 167/397 cut-off events. [2024-06-14 15:54:12,767 INFO L125 PetriNetUnfolderBase]: For 10500/10500 co-relation queries the response was YES. [2024-06-14 15:54:12,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1760 conditions, 397 events. 167/397 cut-off events. For 10500/10500 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1866 event pairs, 34 based on Foata normal form. 6/400 useless extension candidates. Maximal degree in co-relation 1711. Up to 245 conditions per place. [2024-06-14 15:54:12,769 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 57 selfloop transitions, 22 changer transitions 9/92 dead transitions. [2024-06-14 15:54:12,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 92 transitions, 813 flow [2024-06-14 15:54:12,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:12,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:54:12,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-14 15:54:12,770 INFO L175 Difference]: Start difference. First operand has 132 places, 76 transitions, 589 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:54:12,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 92 transitions, 813 flow [2024-06-14 15:54:12,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 92 transitions, 767 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 15:54:12,787 INFO L231 Difference]: Finished difference. Result has 128 places, 73 transitions, 569 flow [2024-06-14 15:54:12,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=569, PETRI_PLACES=128, PETRI_TRANSITIONS=73} [2024-06-14 15:54:12,787 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 96 predicate places. [2024-06-14 15:54:12,787 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 73 transitions, 569 flow [2024-06-14 15:54:12,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call 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:12,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:12,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:12,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-14 15:54:12,788 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:54:12,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:12,788 INFO L85 PathProgramCache]: Analyzing trace with hash 319757167, now seen corresponding path program 17 times [2024-06-14 15:54:12,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:12,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839298840] [2024-06-14 15:54:12,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:12,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:20,477 INFO L134 CoverageAnalysis]: 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:20,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:20,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839298840] [2024-06-14 15:54:20,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839298840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:20,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:20,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-14 15:54:20,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123106363] [2024-06-14 15:54:20,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:20,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-14 15:54:20,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:20,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-14 15:54:20,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-14 15:54:20,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:54:20,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 73 transitions, 569 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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:20,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:20,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:54:20,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:21,040 INFO L124 PetriNetUnfolderBase]: 157/377 cut-off events. [2024-06-14 15:54:21,040 INFO L125 PetriNetUnfolderBase]: For 9962/9962 co-relation queries the response was YES. [2024-06-14 15:54:21,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 377 events. 157/377 cut-off events. For 9962/9962 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1757 event pairs, 34 based on Foata normal form. 6/380 useless extension candidates. Maximal degree in co-relation 1639. Up to 241 conditions per place. [2024-06-14 15:54:21,043 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 57 selfloop transitions, 18 changer transitions 10/89 dead transitions. [2024-06-14 15:54:21,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 89 transitions, 787 flow [2024-06-14 15:54:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:54:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:54:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2024-06-14 15:54:21,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-14 15:54:21,044 INFO L175 Difference]: Start difference. First operand has 128 places, 73 transitions, 569 flow. Second operand 12 states and 152 transitions. [2024-06-14 15:54:21,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 89 transitions, 787 flow [2024-06-14 15:54:21,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 89 transitions, 737 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-14 15:54:21,057 INFO L231 Difference]: Finished difference. Result has 125 places, 70 transitions, 538 flow [2024-06-14 15:54:21,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=538, PETRI_PLACES=125, PETRI_TRANSITIONS=70} [2024-06-14 15:54:21,058 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 93 predicate places. [2024-06-14 15:54:21,058 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 70 transitions, 538 flow [2024-06-14 15:54:21,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call 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,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:21,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:21,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-14 15:54:21,058 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:54:21,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:21,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1393251115, now seen corresponding path program 18 times [2024-06-14 15:54:21,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:21,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807082664] [2024-06-14 15:54:21,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:21,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15