./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix000.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 76401ed0 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix000.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m [2024-06-20 18:16:28,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 18:16:28,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 18:16:28,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 18:16:28,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 18:16:28,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 18:16:28,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 18:16:28,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 18:16:28,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 18:16:28,219 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 18:16:28,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 18:16:28,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 18:16:28,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 18:16:28,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 18:16:28,221 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 18:16:28,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 18:16:28,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 18:16:28,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 18:16:28,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 18:16:28,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 18:16:28,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 18:16:28,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 18:16:28,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 18:16:28,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 18:16:28,223 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 18:16:28,224 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 18:16:28,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 18:16:28,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 18:16:28,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 18:16:28,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 18:16:28,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 18:16:28,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 18:16:28,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:16:28,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 18:16:28,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 18:16:28,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 18:16:28,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 18:16:28,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 18:16:28,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 18:16:28,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 18:16:28,239 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 18:16:28,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 18:16:28,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 18:16:28,239 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-20 18:16:28,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 18:16:28,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 18:16:28,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 18:16:28,419 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 18:16:28,420 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 18:16:28,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2024-06-20 18:16:29,584 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 18:16:29,803 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 18:16:29,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2024-06-20 18:16:29,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5428abb/bc1677520dff4fb3b5419936a7290d88/FLAG3f34e10dc [2024-06-20 18:16:29,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5428abb/bc1677520dff4fb3b5419936a7290d88 [2024-06-20 18:16:29,833 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 18:16:29,834 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 18:16:29,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix000.oepc.yml/witness.yml [2024-06-20 18:16:29,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 18:16:29,953 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 18:16:29,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 18:16:29,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 18:16:29,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 18:16:29,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:16:29" (1/2) ... [2024-06-20 18:16:29,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10778382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:16:29, skipping insertion in model container [2024-06-20 18:16:29,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:16:29" (1/2) ... [2024-06-20 18:16:29,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4fcbdf28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:16:29, skipping insertion in model container [2024-06-20 18:16:29,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:16:29" (2/2) ... [2024-06-20 18:16:29,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10778382 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:16:29, skipping insertion in model container [2024-06-20 18:16:29,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:16:29" (2/2) ... [2024-06-20 18:16:29,960 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 18:16:30,021 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 18:16:30,023 INFO L97 edCorrectnessWitness]: Location invariant before [L835-L835] (((((((((((((((((! multithreaded || y$r_buff1_thd2 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-20 18:16:30,023 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] (((((((((((((((((! multithreaded || y$r_buff1_thd2 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 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 )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-20 18:16:30,024 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 18:16:30,024 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-20 18:16:30,061 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 18:16:30,374 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:16:30,382 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 18:16:30,664 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:16:30,688 INFO L206 MainTranslator]: Completed translation [2024-06-20 18:16:30,688 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:16:30 WrapperNode [2024-06-20 18:16:30,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 18:16:30,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 18:16:30,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 18:16:30,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 18:16:30,694 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 20.06 06:16:30" (1/1) ... [2024-06-20 18:16:30,721 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 20.06 06:16:30" (1/1) ... [2024-06-20 18:16:30,773 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-06-20 18:16:30,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 18:16:30,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 18:16:30,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 18:16:30,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 18:16:30,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:16:30" (1/1) ... [2024-06-20 18:16:30,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:16:30" (1/1) ... [2024-06-20 18:16:30,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:16:30" (1/1) ... [2024-06-20 18:16:30,824 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-20 18:16:30,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:16:30" (1/1) ... [2024-06-20 18:16:30,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:16:30" (1/1) ... [2024-06-20 18:16:30,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:16:30" (1/1) ... [2024-06-20 18:16:30,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:16:30" (1/1) ... [2024-06-20 18:16:30,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:16:30" (1/1) ... [2024-06-20 18:16:30,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:16:30" (1/1) ... [2024-06-20 18:16:30,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 18:16:30,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 18:16:30,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 18:16:30,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 18:16:30,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:16:30" (1/1) ... [2024-06-20 18:16:30,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:16:30,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:16:30,897 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-20 18:16:30,916 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-20 18:16:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 18:16:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 18:16:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 18:16:30,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 18:16:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 18:16:30,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 18:16:30,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 18:16:30,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 18:16:30,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 18:16:30,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 18:16:30,933 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 18:16:31,039 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 18:16:31,040 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 18:16:31,751 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 18:16:31,752 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 18:16:31,966 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 18:16:31,966 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 18:16:31,968 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:16:31 BoogieIcfgContainer [2024-06-20 18:16:31,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 18:16:31,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 18:16:31,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 18:16:31,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 18:16:31,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 06:16:29" (1/4) ... [2024-06-20 18:16:31,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739757eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:16:31, skipping insertion in model container [2024-06-20 18:16:31,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:16:29" (2/4) ... [2024-06-20 18:16:31,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739757eb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:16:31, skipping insertion in model container [2024-06-20 18:16:31,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:16:30" (3/4) ... [2024-06-20 18:16:31,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739757eb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:16:31, skipping insertion in model container [2024-06-20 18:16:31,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:16:31" (4/4) ... [2024-06-20 18:16:31,981 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2024-06-20 18:16:31,996 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 18:16:31,996 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-20 18:16:31,996 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 18:16:32,065 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 18:16:32,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-20 18:16:32,133 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-20 18:16:32,133 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:16:32,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 18:16:32,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-20 18:16:32,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-20 18:16:32,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 18:16:32,158 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;@50cb0048, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 18:16:32,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-20 18:16:32,166 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 18:16:32,166 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-20 18:16:32,166 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:16:32,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:16:32,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 18:16:32,167 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-20 18:16:32,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:16:32,175 INFO L85 PathProgramCache]: Analyzing trace with hash 368677949, now seen corresponding path program 1 times [2024-06-20 18:16:32,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:16:32,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219353569] [2024-06-20 18:16:32,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:16:32,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:16:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:16:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:16:36,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:16:36,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219353569] [2024-06-20 18:16:36,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219353569] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:16:36,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:16:36,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 18:16:36,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991904503] [2024-06-20 18:16:36,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:16:36,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 18:16:36,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:16:36,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 18:16:36,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 18:16:36,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2024-06-20 18:16:36,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:16:36,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:16:36,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2024-06-20 18:16:36,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:16:36,427 INFO L124 PetriNetUnfolderBase]: 162/309 cut-off events. [2024-06-20 18:16:36,427 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-20 18:16:36,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 309 events. 162/309 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1182 event pairs, 97 based on Foata normal form. 1/302 useless extension candidates. Maximal degree in co-relation 609. Up to 288 conditions per place. [2024-06-20 18:16:36,432 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 21 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-20 18:16:36,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 115 flow [2024-06-20 18:16:36,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 18:16:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 18:16:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-06-20 18:16:36,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2024-06-20 18:16:36,445 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 56 transitions. [2024-06-20 18:16:36,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 115 flow [2024-06-20 18:16:36,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-20 18:16:36,449 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-20 18:16:36,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-20 18:16:36,453 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-20 18:16:36,454 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-20 18:16:36,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:16:36,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:16:36,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:16:36,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 18:16:36,455 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-20 18:16:36,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:16:36,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2112218588, now seen corresponding path program 1 times [2024-06-20 18:16:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:16:36,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844625677] [2024-06-20 18:16:36,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:16:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:16:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:16:39,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-20 18:16:39,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:16:39,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844625677] [2024-06-20 18:16:39,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844625677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:16:39,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:16:39,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 18:16:39,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063610357] [2024-06-20 18:16:39,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:16:39,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 18:16:39,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:16:39,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 18:16:39,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-20 18:16:39,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2024-06-20 18:16:39,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:16:39,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:16:39,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2024-06-20 18:16:39,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:16:40,193 INFO L124 PetriNetUnfolderBase]: 159/306 cut-off events. [2024-06-20 18:16:40,193 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-06-20 18:16:40,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 306 events. 159/306 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1173 event pairs, 79 based on Foata normal form. 2/306 useless extension candidates. Maximal degree in co-relation 682. Up to 274 conditions per place. [2024-06-20 18:16:40,199 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 25 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-20 18:16:40,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 157 flow [2024-06-20 18:16:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 18:16:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 18:16:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2024-06-20 18:16:40,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-06-20 18:16:40,204 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 72 transitions. [2024-06-20 18:16:40,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 157 flow [2024-06-20 18:16:40,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 18:16:40,209 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-20 18:16:40,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-20 18:16:40,211 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-20 18:16:40,211 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-20 18:16:40,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:16:40,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:16:40,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:16:40,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 18:16:40,212 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-20 18:16:40,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:16:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1054267720, now seen corresponding path program 1 times [2024-06-20 18:16:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:16:40,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538046286] [2024-06-20 18:16:40,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:16:40,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:16:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:16:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:16:43,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:16:43,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538046286] [2024-06-20 18:16:43,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538046286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:16:43,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:16:43,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 18:16:43,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388825366] [2024-06-20 18:16:43,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:16:43,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 18:16:43,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:16:43,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 18:16:43,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-20 18:16:43,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2024-06-20 18:16:43,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:16:43,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:16:43,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2024-06-20 18:16:43,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:16:44,145 INFO L124 PetriNetUnfolderBase]: 153/300 cut-off events. [2024-06-20 18:16:44,145 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2024-06-20 18:16:44,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 300 events. 153/300 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1128 event pairs, 43 based on Foata normal form. 4/302 useless extension candidates. Maximal degree in co-relation 733. Up to 246 conditions per place. [2024-06-20 18:16:44,147 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 30 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-20 18:16:44,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 209 flow [2024-06-20 18:16:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:16:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:16:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-06-20 18:16:44,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5741935483870968 [2024-06-20 18:16:44,148 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 89 transitions. [2024-06-20 18:16:44,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 209 flow [2024-06-20 18:16:44,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-20 18:16:44,150 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 119 flow [2024-06-20 18:16:44,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-06-20 18:16:44,151 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-20 18:16:44,151 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 119 flow [2024-06-20 18:16:44,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:16:44,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:16:44,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:16:44,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 18:16:44,152 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-20 18:16:44,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:16:44,152 INFO L85 PathProgramCache]: Analyzing trace with hash -905032760, now seen corresponding path program 1 times [2024-06-20 18:16:44,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:16:44,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248004564] [2024-06-20 18:16:44,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:16:44,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:16:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:16:48,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-20 18:16:48,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:16:48,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248004564] [2024-06-20 18:16:48,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248004564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:16:48,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:16:48,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:16:48,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144449995] [2024-06-20 18:16:48,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:16:48,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 18:16:48,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:16:48,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 18:16:48,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-20 18:16:48,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:16:48,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:16:48,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:16:48,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:16:48,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:16:48,957 INFO L124 PetriNetUnfolderBase]: 211/379 cut-off events. [2024-06-20 18:16:48,957 INFO L125 PetriNetUnfolderBase]: For 353/353 co-relation queries the response was YES. [2024-06-20 18:16:48,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1053 conditions, 379 events. 211/379 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1339 event pairs, 92 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 1037. Up to 368 conditions per place. [2024-06-20 18:16:48,960 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 28 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2024-06-20 18:16:48,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 205 flow [2024-06-20 18:16:48,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:16:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:16:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2024-06-20 18:16:48,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-20 18:16:48,963 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 119 flow. Second operand 5 states and 61 transitions. [2024-06-20 18:16:48,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 205 flow [2024-06-20 18:16:48,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 190 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-20 18:16:48,966 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 131 flow [2024-06-20 18:16:48,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-20 18:16:48,968 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-20 18:16:48,968 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 131 flow [2024-06-20 18:16:48,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:16:48,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:16:48,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:16:48,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 18:16:48,968 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-20 18:16:48,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:16:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1405231846, now seen corresponding path program 1 times [2024-06-20 18:16:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:16:48,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496197292] [2024-06-20 18:16:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:16:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:16:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:16:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:16:52,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:16:52,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496197292] [2024-06-20 18:16:52,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496197292] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:16:52,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:16:52,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:16:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215417563] [2024-06-20 18:16:52,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:16:52,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:16:52,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:16:52,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:16:52,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:16:52,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-20 18:16:52,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 131 flow. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:16:52,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:16:52,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-20 18:16:52,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:16:53,063 INFO L124 PetriNetUnfolderBase]: 190/354 cut-off events. [2024-06-20 18:16:53,064 INFO L125 PetriNetUnfolderBase]: For 526/526 co-relation queries the response was YES. [2024-06-20 18:16:53,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 354 events. 190/354 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1260 event pairs, 34 based on Foata normal form. 4/356 useless extension candidates. Maximal degree in co-relation 1002. Up to 272 conditions per place. [2024-06-20 18:16:53,066 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 39 selfloop transitions, 12 changer transitions 0/56 dead transitions. [2024-06-20 18:16:53,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 291 flow [2024-06-20 18:16:53,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:16:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:16:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-20 18:16:53,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-20 18:16:53,068 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 131 flow. Second operand 8 states and 124 transitions. [2024-06-20 18:16:53,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 291 flow [2024-06-20 18:16:53,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 280 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-20 18:16:53,072 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 162 flow [2024-06-20 18:16:53,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-20 18:16:53,077 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-20 18:16:53,077 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 162 flow [2024-06-20 18:16:53,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:16:53,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:16:53,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:16:53,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 18:16:53,079 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-20 18:16:53,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:16:53,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2008756451, now seen corresponding path program 1 times [2024-06-20 18:16:53,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:16:53,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932564178] [2024-06-20 18:16:53,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:16:53,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:16:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:16:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:16:57,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:16:57,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932564178] [2024-06-20 18:16:57,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932564178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:16:57,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:16:57,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:16:57,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350902818] [2024-06-20 18:16:57,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:16:57,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:16:57,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:16:57,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:16:57,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:16:57,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:16:57,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:16:57,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:16:57,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:16:57,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:16:57,997 INFO L124 PetriNetUnfolderBase]: 201/362 cut-off events. [2024-06-20 18:16:57,997 INFO L125 PetriNetUnfolderBase]: For 703/703 co-relation queries the response was YES. [2024-06-20 18:16:57,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 362 events. 201/362 cut-off events. For 703/703 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1232 event pairs, 49 based on Foata normal form. 3/363 useless extension candidates. Maximal degree in co-relation 1144. Up to 342 conditions per place. [2024-06-20 18:16:58,000 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 34 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-20 18:16:58,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 272 flow [2024-06-20 18:16:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:16:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:16:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2024-06-20 18:16:58,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2024-06-20 18:16:58,001 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 162 flow. Second operand 6 states and 71 transitions. [2024-06-20 18:16:58,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 272 flow [2024-06-20 18:16:58,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 248 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-20 18:16:58,003 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 171 flow [2024-06-20 18:16:58,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2024-06-20 18:16:58,004 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-20 18:16:58,004 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 171 flow [2024-06-20 18:16:58,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:16:58,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:16:58,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:16:58,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 18:16:58,005 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-20 18:16:58,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:16:58,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1294430037, now seen corresponding path program 1 times [2024-06-20 18:16:58,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:16:58,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674150474] [2024-06-20 18:16:58,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:16:58,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:16:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:17:02,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-20 18:17:02,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:17:02,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674150474] [2024-06-20 18:17:02,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674150474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:17:02,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:17:02,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:17:02,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526512299] [2024-06-20 18:17:02,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:17:02,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:17:02,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:17:02,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:17:02,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:17:02,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:17:02,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 171 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:02,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:17:02,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:17:02,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:17:02,372 INFO L124 PetriNetUnfolderBase]: 204/367 cut-off events. [2024-06-20 18:17:02,373 INFO L125 PetriNetUnfolderBase]: For 863/863 co-relation queries the response was YES. [2024-06-20 18:17:02,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 367 events. 204/367 cut-off events. For 863/863 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1257 event pairs, 49 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 1211. Up to 340 conditions per place. [2024-06-20 18:17:02,376 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 37 selfloop transitions, 11 changer transitions 0/50 dead transitions. [2024-06-20 18:17:02,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 319 flow [2024-06-20 18:17:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:17:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:17:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2024-06-20 18:17:02,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-20 18:17:02,377 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 171 flow. Second operand 6 states and 75 transitions. [2024-06-20 18:17:02,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 319 flow [2024-06-20 18:17:02,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 302 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 18:17:02,381 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 201 flow [2024-06-20 18:17:02,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-06-20 18:17:02,382 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2024-06-20 18:17:02,382 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 201 flow [2024-06-20 18:17:02,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:02,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:17:02,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:17:02,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 18:17:02,383 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-20 18:17:02,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:17:02,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1265593527, now seen corresponding path program 2 times [2024-06-20 18:17:02,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:17:02,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498854577] [2024-06-20 18:17:02,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:17:02,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:17:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:17:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:17:06,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:17:06,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498854577] [2024-06-20 18:17:06,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498854577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:17:06,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:17:06,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:17:06,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54221685] [2024-06-20 18:17:06,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:17:06,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:17:06,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:17:06,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:17:06,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:17:06,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:17:06,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 201 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:06,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:17:06,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:17:06,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:17:07,191 INFO L124 PetriNetUnfolderBase]: 202/364 cut-off events. [2024-06-20 18:17:07,192 INFO L125 PetriNetUnfolderBase]: For 1096/1096 co-relation queries the response was YES. [2024-06-20 18:17:07,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 364 events. 202/364 cut-off events. For 1096/1096 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1248 event pairs, 48 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 1263. Up to 350 conditions per place. [2024-06-20 18:17:07,196 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 36 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-20 18:17:07,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 303 flow [2024-06-20 18:17:07,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:17:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:17:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2024-06-20 18:17:07,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-20 18:17:07,198 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 201 flow. Second operand 6 states and 69 transitions. [2024-06-20 18:17:07,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 303 flow [2024-06-20 18:17:07,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 291 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-20 18:17:07,201 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 210 flow [2024-06-20 18:17:07,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2024-06-20 18:17:07,202 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2024-06-20 18:17:07,203 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 210 flow [2024-06-20 18:17:07,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:07,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:17:07,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:17:07,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 18:17:07,203 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-20 18:17:07,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:17:07,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1502645367, now seen corresponding path program 1 times [2024-06-20 18:17:07,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:17:07,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444551977] [2024-06-20 18:17:07,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:17:07,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:17:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:17:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:17:12,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:17:12,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444551977] [2024-06-20 18:17:12,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444551977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:17:12,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:17:12,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:17:12,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97910030] [2024-06-20 18:17:12,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:17:12,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:17:12,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:17:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:17:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:17:12,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:17:12,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:12,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:17:12,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:17:12,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:17:12,577 INFO L124 PetriNetUnfolderBase]: 205/369 cut-off events. [2024-06-20 18:17:12,577 INFO L125 PetriNetUnfolderBase]: For 1404/1404 co-relation queries the response was YES. [2024-06-20 18:17:12,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 369 events. 205/369 cut-off events. For 1404/1404 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1277 event pairs, 48 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 1329. Up to 325 conditions per place. [2024-06-20 18:17:12,580 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 40 selfloop transitions, 16 changer transitions 0/58 dead transitions. [2024-06-20 18:17:12,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 392 flow [2024-06-20 18:17:12,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:17:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:17:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-20 18:17:12,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377880184331797 [2024-06-20 18:17:12,582 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 210 flow. Second operand 7 states and 95 transitions. [2024-06-20 18:17:12,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 392 flow [2024-06-20 18:17:12,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 371 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-20 18:17:12,589 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 250 flow [2024-06-20 18:17:12,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2024-06-20 18:17:12,590 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2024-06-20 18:17:12,590 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 250 flow [2024-06-20 18:17:12,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:12,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:17:12,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:17:12,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 18:17:12,591 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-20 18:17:12,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:17:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1767734308, now seen corresponding path program 1 times [2024-06-20 18:17:12,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:17:12,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299435254] [2024-06-20 18:17:12,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:17:12,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:17:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:17:17,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-20 18:17:17,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:17:17,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299435254] [2024-06-20 18:17:17,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299435254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:17:17,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:17:17,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:17:17,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947549687] [2024-06-20 18:17:17,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:17:17,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:17:17,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:17:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:17:17,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:17:17,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:17:17,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 250 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:17,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:17:17,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:17:17,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:17:17,797 INFO L124 PetriNetUnfolderBase]: 224/400 cut-off events. [2024-06-20 18:17:17,798 INFO L125 PetriNetUnfolderBase]: For 1956/1956 co-relation queries the response was YES. [2024-06-20 18:17:17,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 400 events. 224/400 cut-off events. For 1956/1956 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1396 event pairs, 51 based on Foata normal form. 3/401 useless extension candidates. Maximal degree in co-relation 1523. Up to 346 conditions per place. [2024-06-20 18:17:17,800 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 48 selfloop transitions, 15 changer transitions 0/65 dead transitions. [2024-06-20 18:17:17,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 454 flow [2024-06-20 18:17:17,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:17:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:17:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-20 18:17:17,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147465437788018 [2024-06-20 18:17:17,802 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 250 flow. Second operand 7 states and 90 transitions. [2024-06-20 18:17:17,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 454 flow [2024-06-20 18:17:17,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 431 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-20 18:17:17,805 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 301 flow [2024-06-20 18:17:17,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-06-20 18:17:17,806 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-06-20 18:17:17,807 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 301 flow [2024-06-20 18:17:17,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:17,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:17:17,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:17:17,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 18:17:17,808 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-20 18:17:17,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:17:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1767734091, now seen corresponding path program 2 times [2024-06-20 18:17:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:17:17,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101201827] [2024-06-20 18:17:17,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:17:17,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:17:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:17:22,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-20 18:17:22,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:17:22,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101201827] [2024-06-20 18:17:22,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101201827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:17:22,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:17:22,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:17:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896851787] [2024-06-20 18:17:22,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:17:22,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:17:22,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:17:22,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:17:22,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:17:22,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:17:22,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 301 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:22,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:17:22,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:17:22,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:17:23,033 INFO L124 PetriNetUnfolderBase]: 227/405 cut-off events. [2024-06-20 18:17:23,033 INFO L125 PetriNetUnfolderBase]: For 2310/2310 co-relation queries the response was YES. [2024-06-20 18:17:23,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 405 events. 227/405 cut-off events. For 2310/2310 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1426 event pairs, 50 based on Foata normal form. 1/404 useless extension candidates. Maximal degree in co-relation 1666. Up to 376 conditions per place. [2024-06-20 18:17:23,035 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 47 selfloop transitions, 13 changer transitions 0/62 dead transitions. [2024-06-20 18:17:23,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 457 flow [2024-06-20 18:17:23,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:17:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:17:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-20 18:17:23,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3824884792626728 [2024-06-20 18:17:23,037 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 301 flow. Second operand 7 states and 83 transitions. [2024-06-20 18:17:23,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 457 flow [2024-06-20 18:17:23,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 446 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-20 18:17:23,039 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 337 flow [2024-06-20 18:17:23,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2024-06-20 18:17:23,040 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2024-06-20 18:17:23,040 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 337 flow [2024-06-20 18:17:23,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:23,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:17:23,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:17:23,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 18:17:23,041 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-20 18:17:23,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:17:23,041 INFO L85 PathProgramCache]: Analyzing trace with hash -578425824, now seen corresponding path program 2 times [2024-06-20 18:17:23,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:17:23,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139701629] [2024-06-20 18:17:23,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:17:23,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:17:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:17:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:17:27,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:17:27,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139701629] [2024-06-20 18:17:27,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139701629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:17:27,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:17:27,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:17:27,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582248530] [2024-06-20 18:17:27,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:17:27,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:17:27,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:17:27,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:17:27,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:17:27,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:17:27,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 337 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:27,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:17:27,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:17:27,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:17:27,517 INFO L124 PetriNetUnfolderBase]: 236/420 cut-off events. [2024-06-20 18:17:27,517 INFO L125 PetriNetUnfolderBase]: For 2909/2909 co-relation queries the response was YES. [2024-06-20 18:17:27,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1813 conditions, 420 events. 236/420 cut-off events. For 2909/2909 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1487 event pairs, 49 based on Foata normal form. 3/421 useless extension candidates. Maximal degree in co-relation 1781. Up to 397 conditions per place. [2024-06-20 18:17:27,520 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 51 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2024-06-20 18:17:27,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 495 flow [2024-06-20 18:17:27,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:17:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:17:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2024-06-20 18:17:27,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3686635944700461 [2024-06-20 18:17:27,522 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 337 flow. Second operand 7 states and 80 transitions. [2024-06-20 18:17:27,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 495 flow [2024-06-20 18:17:27,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 468 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-20 18:17:27,527 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 353 flow [2024-06-20 18:17:27,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=353, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-06-20 18:17:27,529 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-06-20 18:17:27,529 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 353 flow [2024-06-20 18:17:27,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:27,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:17:27,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:17:27,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 18:17:27,529 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-20 18:17:27,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:17:27,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1974387531, now seen corresponding path program 3 times [2024-06-20 18:17:27,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:17:27,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865114557] [2024-06-20 18:17:27,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:17:27,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:17:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:17:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:17:33,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:17:33,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865114557] [2024-06-20 18:17:33,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865114557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:17:33,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:17:33,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:17:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056765237] [2024-06-20 18:17:33,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:17:33,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:17:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:17:33,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:17:33,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:17:33,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:17:33,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 353 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:33,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:17:33,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:17:33,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:17:33,517 INFO L124 PetriNetUnfolderBase]: 234/417 cut-off events. [2024-06-20 18:17:33,517 INFO L125 PetriNetUnfolderBase]: For 3213/3213 co-relation queries the response was YES. [2024-06-20 18:17:33,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 417 events. 234/417 cut-off events. For 3213/3213 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1478 event pairs, 49 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 1809. Up to 400 conditions per place. [2024-06-20 18:17:33,520 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 49 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2024-06-20 18:17:33,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 61 transitions, 487 flow [2024-06-20 18:17:33,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:17:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:17:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-20 18:17:33,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391705069124424 [2024-06-20 18:17:33,521 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 353 flow. Second operand 7 states and 85 transitions. [2024-06-20 18:17:33,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 61 transitions, 487 flow [2024-06-20 18:17:33,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 460 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 18:17:33,525 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 351 flow [2024-06-20 18:17:33,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2024-06-20 18:17:33,525 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2024-06-20 18:17:33,526 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 351 flow [2024-06-20 18:17:33,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:33,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:17:33,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:17:33,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 18:17:33,526 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-20 18:17:33,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:17:33,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1508359504, now seen corresponding path program 3 times [2024-06-20 18:17:33,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:17:33,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470073502] [2024-06-20 18:17:33,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:17:33,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:17:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:17:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:17:37,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:17:37,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470073502] [2024-06-20 18:17:37,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470073502] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:17:37,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:17:37,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:17:37,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725111672] [2024-06-20 18:17:37,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:17:37,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:17:37,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:17:37,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:17:37,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:17:37,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:17:37,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 351 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:37,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:17:37,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:17:37,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:17:38,019 INFO L124 PetriNetUnfolderBase]: 228/408 cut-off events. [2024-06-20 18:17:38,019 INFO L125 PetriNetUnfolderBase]: For 3537/3537 co-relation queries the response was YES. [2024-06-20 18:17:38,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1795 conditions, 408 events. 228/408 cut-off events. For 3537/3537 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1444 event pairs, 47 based on Foata normal form. 3/409 useless extension candidates. Maximal degree in co-relation 1762. Up to 373 conditions per place. [2024-06-20 18:17:38,021 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 49 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2024-06-20 18:17:38,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 66 transitions, 517 flow [2024-06-20 18:17:38,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:17:38,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:17:38,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-20 18:17:38,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36693548387096775 [2024-06-20 18:17:38,023 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 351 flow. Second operand 8 states and 91 transitions. [2024-06-20 18:17:38,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 66 transitions, 517 flow [2024-06-20 18:17:38,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 478 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-20 18:17:38,027 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 364 flow [2024-06-20 18:17:38,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=364, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2024-06-20 18:17:38,028 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2024-06-20 18:17:38,028 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 364 flow [2024-06-20 18:17:38,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:38,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:17:38,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:17:38,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 18:17:38,029 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-20 18:17:38,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:17:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1039578874, now seen corresponding path program 1 times [2024-06-20 18:17:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:17:38,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021814278] [2024-06-20 18:17:38,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:17:38,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:17:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:17:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:17:42,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:17:42,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021814278] [2024-06-20 18:17:42,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021814278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:17:42,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:17:42,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:17:42,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204153757] [2024-06-20 18:17:42,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:17:42,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:17:42,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:17:42,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:17:42,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:17:43,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:17:43,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 364 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:43,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:17:43,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:17:43,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:17:43,405 INFO L124 PetriNetUnfolderBase]: 234/418 cut-off events. [2024-06-20 18:17:43,405 INFO L125 PetriNetUnfolderBase]: For 4000/4000 co-relation queries the response was YES. [2024-06-20 18:17:43,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1877 conditions, 418 events. 234/418 cut-off events. For 4000/4000 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1487 event pairs, 46 based on Foata normal form. 2/418 useless extension candidates. Maximal degree in co-relation 1843. Up to 366 conditions per place. [2024-06-20 18:17:43,408 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 59 selfloop transitions, 14 changer transitions 0/75 dead transitions. [2024-06-20 18:17:43,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 75 transitions, 572 flow [2024-06-20 18:17:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:17:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:17:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-20 18:17:43,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951612903225806 [2024-06-20 18:17:43,410 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 364 flow. Second operand 8 states and 98 transitions. [2024-06-20 18:17:43,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 75 transitions, 572 flow [2024-06-20 18:17:43,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 75 transitions, 528 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-20 18:17:43,414 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 370 flow [2024-06-20 18:17:43,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=370, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2024-06-20 18:17:43,414 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 43 predicate places. [2024-06-20 18:17:43,415 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 370 flow [2024-06-20 18:17:43,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:43,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:17:43,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:17:43,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 18:17:43,415 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-20 18:17:43,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:17:43,416 INFO L85 PathProgramCache]: Analyzing trace with hash -662633126, now seen corresponding path program 2 times [2024-06-20 18:17:43,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:17:43,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451613535] [2024-06-20 18:17:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:17:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:17:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:17:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:17:48,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:17:48,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451613535] [2024-06-20 18:17:48,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451613535] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:17:48,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:17:48,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:17:48,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779539420] [2024-06-20 18:17:48,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:17:48,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:17:48,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:17:48,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:17:48,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:17:48,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:17:48,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 370 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:48,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:17:48,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:17:48,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:17:49,132 INFO L124 PetriNetUnfolderBase]: 237/423 cut-off events. [2024-06-20 18:17:49,132 INFO L125 PetriNetUnfolderBase]: For 4348/4348 co-relation queries the response was YES. [2024-06-20 18:17:49,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1945 conditions, 423 events. 237/423 cut-off events. For 4348/4348 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1524 event pairs, 46 based on Foata normal form. 1/422 useless extension candidates. Maximal degree in co-relation 1910. Up to 358 conditions per place. [2024-06-20 18:17:49,135 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 52 selfloop transitions, 24 changer transitions 0/78 dead transitions. [2024-06-20 18:17:49,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 78 transitions, 633 flow [2024-06-20 18:17:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:17:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:17:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-20 18:17:49,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2024-06-20 18:17:49,137 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 370 flow. Second operand 8 states and 99 transitions. [2024-06-20 18:17:49,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 78 transitions, 633 flow [2024-06-20 18:17:49,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 78 transitions, 594 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 18:17:49,142 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 439 flow [2024-06-20 18:17:49,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=439, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2024-06-20 18:17:49,142 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2024-06-20 18:17:49,142 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 439 flow [2024-06-20 18:17:49,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:49,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:17:49,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:17:49,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 18:17:49,143 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-20 18:17:49,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:17:49,144 INFO L85 PathProgramCache]: Analyzing trace with hash -662632940, now seen corresponding path program 1 times [2024-06-20 18:17:49,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:17:49,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946692691] [2024-06-20 18:17:49,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:17:49,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:17:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:17:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:17:54,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:17:54,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946692691] [2024-06-20 18:17:54,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946692691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:17:54,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:17:54,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:17:54,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315791109] [2024-06-20 18:17:54,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:17:54,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:17:54,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:17:54,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:17:54,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:17:54,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:17:54,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 439 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:54,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:17:54,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:17:54,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:17:54,855 INFO L124 PetriNetUnfolderBase]: 250/444 cut-off events. [2024-06-20 18:17:54,855 INFO L125 PetriNetUnfolderBase]: For 5234/5234 co-relation queries the response was YES. [2024-06-20 18:17:54,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 444 events. 250/444 cut-off events. For 5234/5234 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1623 event pairs, 46 based on Foata normal form. 1/443 useless extension candidates. Maximal degree in co-relation 2080. Up to 336 conditions per place. [2024-06-20 18:17:54,858 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 57 selfloop transitions, 27 changer transitions 0/86 dead transitions. [2024-06-20 18:17:54,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 86 transitions, 707 flow [2024-06-20 18:17:54,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:17:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:17:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-20 18:17:54,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-20 18:17:54,860 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 439 flow. Second operand 8 states and 104 transitions. [2024-06-20 18:17:54,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 86 transitions, 707 flow [2024-06-20 18:17:54,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 86 transitions, 676 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-20 18:17:54,867 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 510 flow [2024-06-20 18:17:54,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=510, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2024-06-20 18:17:54,868 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 52 predicate places. [2024-06-20 18:17:54,868 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 510 flow [2024-06-20 18:17:54,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:17:54,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:17:54,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:17:54,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 18:17:54,869 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-20 18:17:54,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:17:54,869 INFO L85 PathProgramCache]: Analyzing trace with hash -657991310, now seen corresponding path program 2 times [2024-06-20 18:17:54,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:17:54,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375355172] [2024-06-20 18:17:54,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:17:54,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:17:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:18:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:18:00,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:18:00,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375355172] [2024-06-20 18:18:00,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375355172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:18:00,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:18:00,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:18:00,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037344612] [2024-06-20 18:18:00,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:18:00,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:18:00,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:18:00,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:18:00,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:18:00,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:18:00,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 510 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:00,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:18:00,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:18:00,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:18:00,780 INFO L124 PetriNetUnfolderBase]: 268/473 cut-off events. [2024-06-20 18:18:00,780 INFO L125 PetriNetUnfolderBase]: For 6369/6369 co-relation queries the response was YES. [2024-06-20 18:18:00,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 473 events. 268/473 cut-off events. For 6369/6369 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1759 event pairs, 47 based on Foata normal form. 1/472 useless extension candidates. Maximal degree in co-relation 2423. Up to 396 conditions per place. [2024-06-20 18:18:00,784 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 64 selfloop transitions, 24 changer transitions 0/90 dead transitions. [2024-06-20 18:18:00,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 807 flow [2024-06-20 18:18:00,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:18:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:18:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-20 18:18:00,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153225806451613 [2024-06-20 18:18:00,785 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 510 flow. Second operand 8 states and 103 transitions. [2024-06-20 18:18:00,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 807 flow [2024-06-20 18:18:00,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 90 transitions, 769 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-20 18:18:00,791 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 575 flow [2024-06-20 18:18:00,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=575, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2024-06-20 18:18:00,792 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-20 18:18:00,792 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 575 flow [2024-06-20 18:18:00,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:00,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:18:00,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:18:00,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 18:18:00,793 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-20 18:18:00,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:18:00,793 INFO L85 PathProgramCache]: Analyzing trace with hash -657984800, now seen corresponding path program 3 times [2024-06-20 18:18:00,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:18:00,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757209907] [2024-06-20 18:18:00,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:18:00,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:18:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:18:06,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-20 18:18:06,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:18:06,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757209907] [2024-06-20 18:18:06,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757209907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:18:06,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:18:06,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:18:06,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052060870] [2024-06-20 18:18:06,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:18:06,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:18:06,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:18:06,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:18:06,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:18:06,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:18:06,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 575 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:06,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:18:06,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:18:06,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:18:06,912 INFO L124 PetriNetUnfolderBase]: 262/464 cut-off events. [2024-06-20 18:18:06,912 INFO L125 PetriNetUnfolderBase]: For 6941/6941 co-relation queries the response was YES. [2024-06-20 18:18:06,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2488 conditions, 464 events. 262/464 cut-off events. For 6941/6941 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1728 event pairs, 47 based on Foata normal form. 3/465 useless extension candidates. Maximal degree in co-relation 2445. Up to 397 conditions per place. [2024-06-20 18:18:06,917 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 66 selfloop transitions, 21 changer transitions 0/89 dead transitions. [2024-06-20 18:18:06,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 89 transitions, 797 flow [2024-06-20 18:18:06,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:18:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:18:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-20 18:18:06,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-20 18:18:06,918 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 575 flow. Second operand 8 states and 100 transitions. [2024-06-20 18:18:06,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 89 transitions, 797 flow [2024-06-20 18:18:06,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 89 transitions, 770 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 18:18:06,931 INFO L231 Difference]: Finished difference. Result has 91 places, 74 transitions, 596 flow [2024-06-20 18:18:06,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=596, PETRI_PLACES=91, PETRI_TRANSITIONS=74} [2024-06-20 18:18:06,931 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 61 predicate places. [2024-06-20 18:18:06,932 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 74 transitions, 596 flow [2024-06-20 18:18:06,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:06,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:18:06,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:18:06,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 18:18:06,932 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-20 18:18:06,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:18:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash 848570920, now seen corresponding path program 3 times [2024-06-20 18:18:06,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:18:06,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183224898] [2024-06-20 18:18:06,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:18:06,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:18:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:18:13,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-20 18:18:13,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:18:13,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183224898] [2024-06-20 18:18:13,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183224898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:18:13,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:18:13,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:18:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654727119] [2024-06-20 18:18:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:18:13,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:18:13,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:18:13,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:18:13,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:18:13,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-20 18:18:13,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 74 transitions, 596 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-20 18:18:13,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:18:13,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-20 18:18:13,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:18:13,626 INFO L124 PetriNetUnfolderBase]: 265/469 cut-off events. [2024-06-20 18:18:13,626 INFO L125 PetriNetUnfolderBase]: For 7330/7330 co-relation queries the response was YES. [2024-06-20 18:18:13,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 469 events. 265/469 cut-off events. For 7330/7330 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1737 event pairs, 50 based on Foata normal form. 1/468 useless extension candidates. Maximal degree in co-relation 2557. Up to 437 conditions per place. [2024-06-20 18:18:13,631 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 68 selfloop transitions, 15 changer transitions 0/86 dead transitions. [2024-06-20 18:18:13,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 86 transitions, 804 flow [2024-06-20 18:18:13,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:18:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:18:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-20 18:18:13,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45622119815668205 [2024-06-20 18:18:13,634 INFO L175 Difference]: Start difference. First operand has 91 places, 74 transitions, 596 flow. Second operand 7 states and 99 transitions. [2024-06-20 18:18:13,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 86 transitions, 804 flow [2024-06-20 18:18:13,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 86 transitions, 757 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-20 18:18:13,644 INFO L231 Difference]: Finished difference. Result has 91 places, 76 transitions, 604 flow [2024-06-20 18:18:13,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=604, PETRI_PLACES=91, PETRI_TRANSITIONS=76} [2024-06-20 18:18:13,644 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 61 predicate places. [2024-06-20 18:18:13,645 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 76 transitions, 604 flow [2024-06-20 18:18:13,645 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-20 18:18:13,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:18:13,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:18:13,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 18:18:13,645 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-20 18:18:13,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:18:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash -759604848, now seen corresponding path program 4 times [2024-06-20 18:18:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:18:13,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878417672] [2024-06-20 18:18:13,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:18:13,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:18:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:18:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:18:20,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:18:20,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878417672] [2024-06-20 18:18:20,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878417672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:18:20,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:18:20,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:18:20,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905429180] [2024-06-20 18:18:20,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:18:20,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:18:20,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:18:20,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:18:20,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:18:20,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:18:20,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 76 transitions, 604 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:20,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:18:20,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:18:20,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:18:20,770 INFO L124 PetriNetUnfolderBase]: 274/484 cut-off events. [2024-06-20 18:18:20,771 INFO L125 PetriNetUnfolderBase]: For 8437/8437 co-relation queries the response was YES. [2024-06-20 18:18:20,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 484 events. 274/484 cut-off events. For 8437/8437 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1822 event pairs, 47 based on Foata normal form. 3/485 useless extension candidates. Maximal degree in co-relation 2638. Up to 438 conditions per place. [2024-06-20 18:18:20,775 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 72 selfloop transitions, 17 changer transitions 0/91 dead transitions. [2024-06-20 18:18:20,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 845 flow [2024-06-20 18:18:20,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:18:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:18:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-20 18:18:20,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38306451612903225 [2024-06-20 18:18:20,777 INFO L175 Difference]: Start difference. First operand has 91 places, 76 transitions, 604 flow. Second operand 8 states and 95 transitions. [2024-06-20 18:18:20,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 845 flow [2024-06-20 18:18:20,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 810 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 18:18:20,788 INFO L231 Difference]: Finished difference. Result has 94 places, 79 transitions, 640 flow [2024-06-20 18:18:20,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=640, PETRI_PLACES=94, PETRI_TRANSITIONS=79} [2024-06-20 18:18:20,790 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 64 predicate places. [2024-06-20 18:18:20,790 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 79 transitions, 640 flow [2024-06-20 18:18:20,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:20,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:18:20,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:18:20,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 18:18:20,791 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-20 18:18:20,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:18:20,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1084752976, now seen corresponding path program 5 times [2024-06-20 18:18:20,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:18:20,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877354459] [2024-06-20 18:18:20,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:18:20,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:18:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:18:28,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-20 18:18:28,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:18:28,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877354459] [2024-06-20 18:18:28,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877354459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:18:28,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:18:28,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:18:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144212640] [2024-06-20 18:18:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:18:28,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:18:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:18:28,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:18:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:18:28,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:18:28,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 79 transitions, 640 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:28,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:18:28,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:18:28,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:18:28,623 INFO L124 PetriNetUnfolderBase]: 273/483 cut-off events. [2024-06-20 18:18:28,624 INFO L125 PetriNetUnfolderBase]: For 8847/8847 co-relation queries the response was YES. [2024-06-20 18:18:28,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2711 conditions, 483 events. 273/483 cut-off events. For 8847/8847 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1810 event pairs, 48 based on Foata normal form. 3/484 useless extension candidates. Maximal degree in co-relation 2664. Up to 449 conditions per place. [2024-06-20 18:18:28,628 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 75 selfloop transitions, 14 changer transitions 0/91 dead transitions. [2024-06-20 18:18:28,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 91 transitions, 866 flow [2024-06-20 18:18:28,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:18:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:18:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2024-06-20 18:18:28,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36693548387096775 [2024-06-20 18:18:28,631 INFO L175 Difference]: Start difference. First operand has 94 places, 79 transitions, 640 flow. Second operand 8 states and 91 transitions. [2024-06-20 18:18:28,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 91 transitions, 866 flow [2024-06-20 18:18:28,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 826 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 18:18:28,642 INFO L231 Difference]: Finished difference. Result has 96 places, 81 transitions, 658 flow [2024-06-20 18:18:28,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=658, PETRI_PLACES=96, PETRI_TRANSITIONS=81} [2024-06-20 18:18:28,643 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2024-06-20 18:18:28,643 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 81 transitions, 658 flow [2024-06-20 18:18:28,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:28,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:18:28,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:18:28,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 18:18:28,645 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-20 18:18:28,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:18:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash -485501420, now seen corresponding path program 6 times [2024-06-20 18:18:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:18:28,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238693227] [2024-06-20 18:18:28,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:18:28,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:18:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:18:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:18:35,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:18:35,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238693227] [2024-06-20 18:18:35,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238693227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:18:35,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:18:35,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:18:35,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801869538] [2024-06-20 18:18:35,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:18:35,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:18:35,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:18:35,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:18:35,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:18:35,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 18:18:35,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 81 transitions, 658 flow. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:35,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:18:35,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 18:18:35,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:18:36,060 INFO L124 PetriNetUnfolderBase]: 271/480 cut-off events. [2024-06-20 18:18:36,061 INFO L125 PetriNetUnfolderBase]: For 8958/8958 co-relation queries the response was YES. [2024-06-20 18:18:36,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2702 conditions, 480 events. 271/480 cut-off events. For 8958/8958 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1802 event pairs, 46 based on Foata normal form. 1/479 useless extension candidates. Maximal degree in co-relation 2654. Up to 417 conditions per place. [2024-06-20 18:18:36,065 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 66 selfloop transitions, 23 changer transitions 0/91 dead transitions. [2024-06-20 18:18:36,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 91 transitions, 864 flow [2024-06-20 18:18:36,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:18:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:18:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-20 18:18:36,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-06-20 18:18:36,067 INFO L175 Difference]: Start difference. First operand has 96 places, 81 transitions, 658 flow. Second operand 8 states and 86 transitions. [2024-06-20 18:18:36,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 91 transitions, 864 flow [2024-06-20 18:18:36,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 91 transitions, 817 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-20 18:18:36,080 INFO L231 Difference]: Finished difference. Result has 97 places, 81 transitions, 662 flow [2024-06-20 18:18:36,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=662, PETRI_PLACES=97, PETRI_TRANSITIONS=81} [2024-06-20 18:18:36,081 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 67 predicate places. [2024-06-20 18:18:36,081 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 81 transitions, 662 flow [2024-06-20 18:18:36,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:36,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:18:36,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:18:36,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 18:18:36,082 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-20 18:18:36,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:18:36,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1084761594, now seen corresponding path program 1 times [2024-06-20 18:18:36,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:18:36,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780943933] [2024-06-20 18:18:36,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:18:36,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:18:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:18:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:18:41,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:18:41,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780943933] [2024-06-20 18:18:41,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780943933] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:18:41,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:18:41,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:18:41,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731115363] [2024-06-20 18:18:41,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:18:41,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:18:41,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:18:41,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:18:41,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:18:42,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:18:42,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 81 transitions, 662 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:42,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:18:42,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:18:42,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:18:42,395 INFO L124 PetriNetUnfolderBase]: 267/474 cut-off events. [2024-06-20 18:18:42,396 INFO L125 PetriNetUnfolderBase]: For 9474/9474 co-relation queries the response was YES. [2024-06-20 18:18:42,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 474 events. 267/474 cut-off events. For 9474/9474 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1779 event pairs, 47 based on Foata normal form. 2/474 useless extension candidates. Maximal degree in co-relation 2615. Up to 446 conditions per place. [2024-06-20 18:18:42,400 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 77 selfloop transitions, 13 changer transitions 0/92 dead transitions. [2024-06-20 18:18:42,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 92 transitions, 878 flow [2024-06-20 18:18:42,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:18:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:18:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-20 18:18:42,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355 [2024-06-20 18:18:42,402 INFO L175 Difference]: Start difference. First operand has 97 places, 81 transitions, 662 flow. Second operand 8 states and 89 transitions. [2024-06-20 18:18:42,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 92 transitions, 878 flow [2024-06-20 18:18:42,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 92 transitions, 783 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-20 18:18:42,415 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 618 flow [2024-06-20 18:18:42,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=618, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2024-06-20 18:18:42,415 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 67 predicate places. [2024-06-20 18:18:42,415 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 618 flow [2024-06-20 18:18:42,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:42,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:18:42,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:18:42,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 18:18:42,416 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-20 18:18:42,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:18:42,417 INFO L85 PathProgramCache]: Analyzing trace with hash -485501606, now seen corresponding path program 4 times [2024-06-20 18:18:42,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:18:42,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189238930] [2024-06-20 18:18:42,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:18:42,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:18:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:18:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:18:49,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:18:49,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189238930] [2024-06-20 18:18:49,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189238930] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:18:49,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:18:49,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:18:49,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458155551] [2024-06-20 18:18:49,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:18:49,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:18:49,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:18:49,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:18:49,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:18:49,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:18:49,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 618 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:49,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:18:49,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:18:49,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:18:49,637 INFO L124 PetriNetUnfolderBase]: 268/476 cut-off events. [2024-06-20 18:18:49,637 INFO L125 PetriNetUnfolderBase]: For 9835/9835 co-relation queries the response was YES. [2024-06-20 18:18:49,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2594 conditions, 476 events. 268/476 cut-off events. For 9835/9835 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1792 event pairs, 49 based on Foata normal form. 2/476 useless extension candidates. Maximal degree in co-relation 2546. Up to 453 conditions per place. [2024-06-20 18:18:49,642 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 76 selfloop transitions, 14 changer transitions 0/92 dead transitions. [2024-06-20 18:18:49,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 92 transitions, 832 flow [2024-06-20 18:18:49,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:18:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:18:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-20 18:18:49,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 18:18:49,644 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 618 flow. Second operand 8 states and 88 transitions. [2024-06-20 18:18:49,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 92 transitions, 832 flow [2024-06-20 18:18:49,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 790 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-20 18:18:49,660 INFO L231 Difference]: Finished difference. Result has 99 places, 85 transitions, 632 flow [2024-06-20 18:18:49,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=632, PETRI_PLACES=99, PETRI_TRANSITIONS=85} [2024-06-20 18:18:49,661 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2024-06-20 18:18:49,661 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 85 transitions, 632 flow [2024-06-20 18:18:49,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:49,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:18:49,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:18:49,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 18:18:49,662 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-20 18:18:49,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:18:49,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1085060806, now seen corresponding path program 1 times [2024-06-20 18:18:49,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:18:49,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329038496] [2024-06-20 18:18:49,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:18:49,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:18:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:18:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:18:57,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:18:57,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329038496] [2024-06-20 18:18:57,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329038496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:18:57,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:18:57,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:18:57,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154479574] [2024-06-20 18:18:57,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:18:57,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:18:57,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:18:57,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:18:57,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:18:57,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:18:57,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 85 transitions, 632 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:57,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:18:57,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:18:57,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:18:57,948 INFO L124 PetriNetUnfolderBase]: 265/471 cut-off events. [2024-06-20 18:18:57,948 INFO L125 PetriNetUnfolderBase]: For 10029/10029 co-relation queries the response was YES. [2024-06-20 18:18:57,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2569 conditions, 471 events. 265/471 cut-off events. For 10029/10029 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1741 event pairs, 46 based on Foata normal form. 2/471 useless extension candidates. Maximal degree in co-relation 2520. Up to 445 conditions per place. [2024-06-20 18:18:57,953 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 80 selfloop transitions, 12 changer transitions 0/94 dead transitions. [2024-06-20 18:18:57,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 94 transitions, 836 flow [2024-06-20 18:18:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:18:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:18:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-20 18:18:57,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-20 18:18:57,954 INFO L175 Difference]: Start difference. First operand has 99 places, 85 transitions, 632 flow. Second operand 8 states and 87 transitions. [2024-06-20 18:18:57,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 94 transitions, 836 flow [2024-06-20 18:18:57,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 94 transitions, 798 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 18:18:57,969 INFO L231 Difference]: Finished difference. Result has 101 places, 85 transitions, 622 flow [2024-06-20 18:18:57,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=622, PETRI_PLACES=101, PETRI_TRANSITIONS=85} [2024-06-20 18:18:57,970 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 71 predicate places. [2024-06-20 18:18:57,970 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 85 transitions, 622 flow [2024-06-20 18:18:57,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:18:57,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:18:57,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:18:57,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 18:18:57,971 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-20 18:18:57,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:18:57,971 INFO L85 PathProgramCache]: Analyzing trace with hash 929491443, now seen corresponding path program 1 times [2024-06-20 18:18:57,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:18:57,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394451252] [2024-06-20 18:18:57,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:18:57,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:18:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:19:06,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-20 18:19:06,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:19:06,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394451252] [2024-06-20 18:19:06,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394451252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:19:06,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:19:06,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:19:06,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135606694] [2024-06-20 18:19:06,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:19:06,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:19:06,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:19:06,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:19:06,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:19:06,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:19:06,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 85 transitions, 622 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:19:06,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:19:06,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:19:06,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:19:06,585 INFO L124 PetriNetUnfolderBase]: 268/476 cut-off events. [2024-06-20 18:19:06,585 INFO L125 PetriNetUnfolderBase]: For 10435/10435 co-relation queries the response was YES. [2024-06-20 18:19:06,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2609 conditions, 476 events. 268/476 cut-off events. For 10435/10435 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1782 event pairs, 47 based on Foata normal form. 1/475 useless extension candidates. Maximal degree in co-relation 2559. Up to 435 conditions per place. [2024-06-20 18:19:06,590 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 87 selfloop transitions, 15 changer transitions 0/104 dead transitions. [2024-06-20 18:19:06,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 104 transitions, 886 flow [2024-06-20 18:19:06,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:19:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:19:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-20 18:19:06,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-20 18:19:06,593 INFO L175 Difference]: Start difference. First operand has 101 places, 85 transitions, 622 flow. Second operand 9 states and 105 transitions. [2024-06-20 18:19:06,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 104 transitions, 886 flow [2024-06-20 18:19:06,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 104 transitions, 858 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-20 18:19:06,609 INFO L231 Difference]: Finished difference. Result has 104 places, 87 transitions, 645 flow [2024-06-20 18:19:06,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=645, PETRI_PLACES=104, PETRI_TRANSITIONS=87} [2024-06-20 18:19:06,610 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 74 predicate places. [2024-06-20 18:19:06,610 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 87 transitions, 645 flow [2024-06-20 18:19:06,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:19:06,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:19:06,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:19:06,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 18:19:06,611 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-20 18:19:06,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:19:06,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1071744243, now seen corresponding path program 2 times [2024-06-20 18:19:06,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:19:06,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188642320] [2024-06-20 18:19:06,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:19:06,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:19:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:19:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:19:13,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:19:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188642320] [2024-06-20 18:19:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188642320] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:19:13,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:19:13,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:19:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077834102] [2024-06-20 18:19:13,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:19:13,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:19:13,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:19:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:19:13,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:19:14,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:19:14,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 87 transitions, 645 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:19:14,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:19:14,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:19:14,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:19:14,531 INFO L124 PetriNetUnfolderBase]: 309/542 cut-off events. [2024-06-20 18:19:14,532 INFO L125 PetriNetUnfolderBase]: For 14133/14133 co-relation queries the response was YES. [2024-06-20 18:19:14,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3144 conditions, 542 events. 309/542 cut-off events. For 14133/14133 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2122 event pairs, 45 based on Foata normal form. 2/542 useless extension candidates. Maximal degree in co-relation 3093. Up to 297 conditions per place. [2024-06-20 18:19:14,536 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 72 selfloop transitions, 46 changer transitions 0/120 dead transitions. [2024-06-20 18:19:14,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 120 transitions, 1219 flow [2024-06-20 18:19:14,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:19:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:19:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-20 18:19:14,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43727598566308246 [2024-06-20 18:19:14,538 INFO L175 Difference]: Start difference. First operand has 104 places, 87 transitions, 645 flow. Second operand 9 states and 122 transitions. [2024-06-20 18:19:14,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 120 transitions, 1219 flow [2024-06-20 18:19:14,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 120 transitions, 1181 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-20 18:19:14,556 INFO L231 Difference]: Finished difference. Result has 108 places, 97 transitions, 842 flow [2024-06-20 18:19:14,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=842, PETRI_PLACES=108, PETRI_TRANSITIONS=97} [2024-06-20 18:19:14,557 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2024-06-20 18:19:14,557 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 97 transitions, 842 flow [2024-06-20 18:19:14,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:19:14,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:19:14,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:19:14,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 18:19:14,558 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-20 18:19:14,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:19:14,558 INFO L85 PathProgramCache]: Analyzing trace with hash 933216310, now seen corresponding path program 1 times [2024-06-20 18:19:14,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:19:14,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481193097] [2024-06-20 18:19:14,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:19:14,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:19:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:19:22,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-20 18:19:22,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:19:22,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481193097] [2024-06-20 18:19:22,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481193097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:19:22,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:19:22,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:19:22,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406907232] [2024-06-20 18:19:22,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:19:22,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:19:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:19:22,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:19:22,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:19:23,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:19:23,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 97 transitions, 842 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:19:23,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:19:23,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:19:23,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:19:23,526 INFO L124 PetriNetUnfolderBase]: 325/568 cut-off events. [2024-06-20 18:19:23,527 INFO L125 PetriNetUnfolderBase]: For 16533/16533 co-relation queries the response was YES. [2024-06-20 18:19:23,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3549 conditions, 568 events. 325/568 cut-off events. For 16533/16533 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2262 event pairs, 52 based on Foata normal form. 2/568 useless extension candidates. Maximal degree in co-relation 3495. Up to 429 conditions per place. [2024-06-20 18:19:23,532 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 81 selfloop transitions, 36 changer transitions 0/119 dead transitions. [2024-06-20 18:19:23,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 119 transitions, 1214 flow [2024-06-20 18:19:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:19:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:19:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-20 18:19:23,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40860215053763443 [2024-06-20 18:19:23,535 INFO L175 Difference]: Start difference. First operand has 108 places, 97 transitions, 842 flow. Second operand 9 states and 114 transitions. [2024-06-20 18:19:23,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 119 transitions, 1214 flow [2024-06-20 18:19:23,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 119 transitions, 1168 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-20 18:19:23,560 INFO L231 Difference]: Finished difference. Result has 114 places, 101 transitions, 913 flow [2024-06-20 18:19:23,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=913, PETRI_PLACES=114, PETRI_TRANSITIONS=101} [2024-06-20 18:19:23,561 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 84 predicate places. [2024-06-20 18:19:23,561 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 101 transitions, 913 flow [2024-06-20 18:19:23,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:19:23,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:19:23,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:19:23,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 18:19:23,562 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-20 18:19:23,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:19:23,562 INFO L85 PathProgramCache]: Analyzing trace with hash 933210358, now seen corresponding path program 1 times [2024-06-20 18:19:23,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:19:23,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772087847] [2024-06-20 18:19:23,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:19:23,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:19:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:19:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:19:31,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:19:31,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772087847] [2024-06-20 18:19:31,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772087847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:19:31,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:19:31,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:19:31,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885379657] [2024-06-20 18:19:31,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:19:31,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:19:31,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:19:31,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:19:31,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:19:31,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:19:31,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 101 transitions, 913 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:19:31,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:19:31,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:19:31,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:19:32,108 INFO L124 PetriNetUnfolderBase]: 323/565 cut-off events. [2024-06-20 18:19:32,109 INFO L125 PetriNetUnfolderBase]: For 16758/16758 co-relation queries the response was YES. [2024-06-20 18:19:32,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3594 conditions, 565 events. 323/565 cut-off events. For 16758/16758 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2229 event pairs, 59 based on Foata normal form. 1/564 useless extension candidates. Maximal degree in co-relation 3539. Up to 497 conditions per place. [2024-06-20 18:19:32,114 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 85 selfloop transitions, 28 changer transitions 0/115 dead transitions. [2024-06-20 18:19:32,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 115 transitions, 1177 flow [2024-06-20 18:19:32,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:19:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:19:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-20 18:19:32,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-20 18:19:32,115 INFO L175 Difference]: Start difference. First operand has 114 places, 101 transitions, 913 flow. Second operand 9 states and 107 transitions. [2024-06-20 18:19:32,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 115 transitions, 1177 flow [2024-06-20 18:19:32,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 115 transitions, 1124 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-20 18:19:32,141 INFO L231 Difference]: Finished difference. Result has 118 places, 101 transitions, 921 flow [2024-06-20 18:19:32,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=921, PETRI_PLACES=118, PETRI_TRANSITIONS=101} [2024-06-20 18:19:32,142 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2024-06-20 18:19:32,142 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 101 transitions, 921 flow [2024-06-20 18:19:32,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:19:32,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:19:32,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:19:32,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 18:19:32,143 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-20 18:19:32,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:19:32,143 INFO L85 PathProgramCache]: Analyzing trace with hash 933210513, now seen corresponding path program 3 times [2024-06-20 18:19:32,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:19:32,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089620831] [2024-06-20 18:19:32,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:19:32,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:19:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:19:39,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-20 18:19:39,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:19:39,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089620831] [2024-06-20 18:19:39,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089620831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:19:39,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:19:39,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:19:39,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569710746] [2024-06-20 18:19:39,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:19:39,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:19:39,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:19:39,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:19:39,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:19:40,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 18:19:40,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 101 transitions, 921 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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-20 18:19:40,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:19:40,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 18:19:40,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:19:40,489 INFO L124 PetriNetUnfolderBase]: 321/562 cut-off events. [2024-06-20 18:19:40,489 INFO L125 PetriNetUnfolderBase]: For 17419/17419 co-relation queries the response was YES. [2024-06-20 18:19:40,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3601 conditions, 562 events. 321/562 cut-off events. For 17419/17419 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2230 event pairs, 45 based on Foata normal form. 1/561 useless extension candidates. Maximal degree in co-relation 3544. Up to 381 conditions per place. [2024-06-20 18:19:40,494 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 79 selfloop transitions, 44 changer transitions 0/125 dead transitions. [2024-06-20 18:19:40,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 125 transitions, 1326 flow [2024-06-20 18:19:40,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:19:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:19:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-20 18:19:40,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 18:19:40,495 INFO L175 Difference]: Start difference. First operand has 118 places, 101 transitions, 921 flow. Second operand 9 states and 108 transitions. [2024-06-20 18:19:40,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 125 transitions, 1326 flow [2024-06-20 18:19:40,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 125 transitions, 1255 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 18:19:40,525 INFO L231 Difference]: Finished difference. Result has 121 places, 108 transitions, 1036 flow [2024-06-20 18:19:40,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1036, PETRI_PLACES=121, PETRI_TRANSITIONS=108} [2024-06-20 18:19:40,526 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 91 predicate places. [2024-06-20 18:19:40,526 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 108 transitions, 1036 flow [2024-06-20 18:19:40,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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-20 18:19:40,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:19:40,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:19:40,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 18:19:40,527 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-20 18:19:40,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:19:40,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2014563483, now seen corresponding path program 4 times [2024-06-20 18:19:40,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:19:40,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047059452] [2024-06-20 18:19:40,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:19:40,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:19:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:19:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:19:47,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:19:47,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047059452] [2024-06-20 18:19:47,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047059452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:19:47,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:19:47,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:19:47,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497372914] [2024-06-20 18:19:47,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:19:47,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:19:47,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:19:47,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:19:47,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:19:47,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:19:47,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 108 transitions, 1036 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:19:47,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:19:47,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:19:47,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:19:48,207 INFO L124 PetriNetUnfolderBase]: 358/622 cut-off events. [2024-06-20 18:19:48,207 INFO L125 PetriNetUnfolderBase]: For 22217/22217 co-relation queries the response was YES. [2024-06-20 18:19:48,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4280 conditions, 622 events. 358/622 cut-off events. For 22217/22217 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2512 event pairs, 57 based on Foata normal form. 2/622 useless extension candidates. Maximal degree in co-relation 4220. Up to 498 conditions per place. [2024-06-20 18:19:48,212 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 101 selfloop transitions, 33 changer transitions 0/136 dead transitions. [2024-06-20 18:19:48,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 136 transitions, 1545 flow [2024-06-20 18:19:48,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:19:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:19:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-20 18:19:48,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-20 18:19:48,213 INFO L175 Difference]: Start difference. First operand has 121 places, 108 transitions, 1036 flow. Second operand 9 states and 117 transitions. [2024-06-20 18:19:48,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 136 transitions, 1545 flow [2024-06-20 18:19:48,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 136 transitions, 1504 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-20 18:19:48,237 INFO L231 Difference]: Finished difference. Result has 127 places, 117 transitions, 1209 flow [2024-06-20 18:19:48,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1209, PETRI_PLACES=127, PETRI_TRANSITIONS=117} [2024-06-20 18:19:48,238 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2024-06-20 18:19:48,238 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 117 transitions, 1209 flow [2024-06-20 18:19:48,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:19:48,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:19:48,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:19:48,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 18:19:48,239 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-20 18:19:48,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:19:48,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2014355876, now seen corresponding path program 2 times [2024-06-20 18:19:48,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:19:48,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426777093] [2024-06-20 18:19:48,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:19:48,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:19:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:19:54,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-20 18:19:54,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:19:54,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426777093] [2024-06-20 18:19:54,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426777093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:19:54,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:19:54,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:19:54,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190220370] [2024-06-20 18:19:54,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:19:54,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:19:54,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:19:54,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:19:54,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:19:55,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:19:55,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 117 transitions, 1209 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:19:55,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:19:55,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:19:55,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:19:55,407 INFO L124 PetriNetUnfolderBase]: 364/632 cut-off events. [2024-06-20 18:19:55,407 INFO L125 PetriNetUnfolderBase]: For 23996/23996 co-relation queries the response was YES. [2024-06-20 18:19:55,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4505 conditions, 632 events. 364/632 cut-off events. For 23996/23996 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2579 event pairs, 61 based on Foata normal form. 2/632 useless extension candidates. Maximal degree in co-relation 4442. Up to 559 conditions per place. [2024-06-20 18:19:55,413 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 110 selfloop transitions, 23 changer transitions 0/135 dead transitions. [2024-06-20 18:19:55,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 135 transitions, 1535 flow [2024-06-20 18:19:55,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:19:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:19:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-20 18:19:55,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265232974910394 [2024-06-20 18:19:55,414 INFO L175 Difference]: Start difference. First operand has 127 places, 117 transitions, 1209 flow. Second operand 9 states and 119 transitions. [2024-06-20 18:19:55,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 135 transitions, 1535 flow [2024-06-20 18:19:55,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 135 transitions, 1474 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-20 18:19:55,455 INFO L231 Difference]: Finished difference. Result has 131 places, 119 transitions, 1223 flow [2024-06-20 18:19:55,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1223, PETRI_PLACES=131, PETRI_TRANSITIONS=119} [2024-06-20 18:19:55,456 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 101 predicate places. [2024-06-20 18:19:55,456 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 119 transitions, 1223 flow [2024-06-20 18:19:55,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:19:55,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:19:55,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:19:55,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 18:19:55,457 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-20 18:19:55,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:19:55,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1199567247, now seen corresponding path program 5 times [2024-06-20 18:19:55,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:19:55,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624958387] [2024-06-20 18:19:55,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:19:55,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:19:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:20:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:20:02,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:20:02,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624958387] [2024-06-20 18:20:02,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624958387] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:20:02,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:20:02,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:20:02,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947660398] [2024-06-20 18:20:02,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:20:02,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:20:02,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:20:02,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:20:02,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:20:02,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:20:02,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 119 transitions, 1223 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:20:02,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:20:02,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:20:02,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:20:03,060 INFO L124 PetriNetUnfolderBase]: 363/631 cut-off events. [2024-06-20 18:20:03,061 INFO L125 PetriNetUnfolderBase]: For 24727/24727 co-relation queries the response was YES. [2024-06-20 18:20:03,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4507 conditions, 631 events. 363/631 cut-off events. For 24727/24727 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2576 event pairs, 56 based on Foata normal form. 3/632 useless extension candidates. Maximal degree in co-relation 4442. Up to 553 conditions per place. [2024-06-20 18:20:03,081 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 111 selfloop transitions, 24 changer transitions 0/137 dead transitions. [2024-06-20 18:20:03,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 137 transitions, 1557 flow [2024-06-20 18:20:03,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:20:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:20:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-20 18:20:03,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-20 18:20:03,090 INFO L175 Difference]: Start difference. First operand has 131 places, 119 transitions, 1223 flow. Second operand 9 states and 111 transitions. [2024-06-20 18:20:03,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 137 transitions, 1557 flow [2024-06-20 18:20:03,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 137 transitions, 1502 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-20 18:20:03,122 INFO L231 Difference]: Finished difference. Result has 133 places, 121 transitions, 1250 flow [2024-06-20 18:20:03,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1250, PETRI_PLACES=133, PETRI_TRANSITIONS=121} [2024-06-20 18:20:03,123 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places. [2024-06-20 18:20:03,123 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 121 transitions, 1250 flow [2024-06-20 18:20:03,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:20:03,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:20:03,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:20:03,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 18:20:03,124 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-20 18:20:03,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:20:03,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1077106623, now seen corresponding path program 6 times [2024-06-20 18:20:03,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:20:03,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761647531] [2024-06-20 18:20:03,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:20:03,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:20:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:20:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:20:07,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:20:07,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761647531] [2024-06-20 18:20:07,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761647531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:20:07,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:20:07,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:20:07,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264939221] [2024-06-20 18:20:07,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:20:07,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:20:07,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:20:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:20:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:20:08,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 18:20:08,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 121 transitions, 1250 flow. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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-20 18:20:08,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:20:08,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 18:20:08,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:20:08,295 INFO L124 PetriNetUnfolderBase]: 361/628 cut-off events. [2024-06-20 18:20:08,295 INFO L125 PetriNetUnfolderBase]: For 24289/24289 co-relation queries the response was YES. [2024-06-20 18:20:08,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4511 conditions, 628 events. 361/628 cut-off events. For 24289/24289 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2573 event pairs, 55 based on Foata normal form. 1/627 useless extension candidates. Maximal degree in co-relation 4445. Up to 535 conditions per place. [2024-06-20 18:20:08,300 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 105 selfloop transitions, 31 changer transitions 0/138 dead transitions. [2024-06-20 18:20:08,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 138 transitions, 1582 flow [2024-06-20 18:20:08,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:20:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:20:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-20 18:20:08,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3727598566308244 [2024-06-20 18:20:08,329 INFO L175 Difference]: Start difference. First operand has 133 places, 121 transitions, 1250 flow. Second operand 9 states and 104 transitions. [2024-06-20 18:20:08,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 138 transitions, 1582 flow [2024-06-20 18:20:08,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 138 transitions, 1526 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-20 18:20:08,364 INFO L231 Difference]: Finished difference. Result has 135 places, 123 transitions, 1285 flow [2024-06-20 18:20:08,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1285, PETRI_PLACES=135, PETRI_TRANSITIONS=123} [2024-06-20 18:20:08,365 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 105 predicate places. [2024-06-20 18:20:08,365 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 123 transitions, 1285 flow [2024-06-20 18:20:08,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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-20 18:20:08,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:20:08,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:20:08,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 18:20:08,366 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-20 18:20:08,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:20:08,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1199365654, now seen corresponding path program 3 times [2024-06-20 18:20:08,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:20:08,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46807882] [2024-06-20 18:20:08,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:20:08,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:20:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:20:16,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-20 18:20:16,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:20:16,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46807882] [2024-06-20 18:20:16,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46807882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:20:16,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:20:16,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:20:16,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062920715] [2024-06-20 18:20:16,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:20:16,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:20:16,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:20:16,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:20:16,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:20:16,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:20:16,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 123 transitions, 1285 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:20:16,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:20:16,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:20:16,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:20:16,879 INFO L124 PetriNetUnfolderBase]: 367/638 cut-off events. [2024-06-20 18:20:16,879 INFO L125 PetriNetUnfolderBase]: For 26418/26418 co-relation queries the response was YES. [2024-06-20 18:20:16,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4608 conditions, 638 events. 367/638 cut-off events. For 26418/26418 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2624 event pairs, 57 based on Foata normal form. 2/638 useless extension candidates. Maximal degree in co-relation 4541. Up to 553 conditions per place. [2024-06-20 18:20:16,885 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 112 selfloop transitions, 27 changer transitions 0/141 dead transitions. [2024-06-20 18:20:16,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 141 transitions, 1627 flow [2024-06-20 18:20:16,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:20:16,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:20:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-20 18:20:16,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4336917562724014 [2024-06-20 18:20:16,887 INFO L175 Difference]: Start difference. First operand has 135 places, 123 transitions, 1285 flow. Second operand 9 states and 121 transitions. [2024-06-20 18:20:16,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 141 transitions, 1627 flow [2024-06-20 18:20:16,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 141 transitions, 1574 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-20 18:20:16,940 INFO L231 Difference]: Finished difference. Result has 139 places, 125 transitions, 1319 flow [2024-06-20 18:20:16,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1319, PETRI_PLACES=139, PETRI_TRANSITIONS=125} [2024-06-20 18:20:16,940 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2024-06-20 18:20:16,941 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 125 transitions, 1319 flow [2024-06-20 18:20:16,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:20:16,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:20:16,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:20:16,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 18:20:16,941 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-20 18:20:16,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:20:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash -2014563638, now seen corresponding path program 2 times [2024-06-20 18:20:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:20:16,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626324795] [2024-06-20 18:20:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:20:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:20:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:20:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:20:24,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:20:24,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626324795] [2024-06-20 18:20:24,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626324795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:20:24,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:20:24,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:20:24,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044189653] [2024-06-20 18:20:24,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:20:24,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:20:24,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:20:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:20:24,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:20:24,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:20:24,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 125 transitions, 1319 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:20:24,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:20:24,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:20:24,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:20:25,213 INFO L124 PetriNetUnfolderBase]: 364/633 cut-off events. [2024-06-20 18:20:25,213 INFO L125 PetriNetUnfolderBase]: For 26488/26488 co-relation queries the response was YES. [2024-06-20 18:20:25,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4630 conditions, 633 events. 364/633 cut-off events. For 26488/26488 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2590 event pairs, 64 based on Foata normal form. 1/632 useless extension candidates. Maximal degree in co-relation 4561. Up to 598 conditions per place. [2024-06-20 18:20:25,220 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 117 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2024-06-20 18:20:25,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 137 transitions, 1631 flow [2024-06-20 18:20:25,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:20:25,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:20:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-20 18:20:25,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36200716845878134 [2024-06-20 18:20:25,221 INFO L175 Difference]: Start difference. First operand has 139 places, 125 transitions, 1319 flow. Second operand 9 states and 101 transitions. [2024-06-20 18:20:25,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 137 transitions, 1631 flow [2024-06-20 18:20:25,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 137 transitions, 1562 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-20 18:20:25,276 INFO L231 Difference]: Finished difference. Result has 141 places, 126 transitions, 1307 flow [2024-06-20 18:20:25,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1307, PETRI_PLACES=141, PETRI_TRANSITIONS=126} [2024-06-20 18:20:25,277 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 111 predicate places. [2024-06-20 18:20:25,277 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 126 transitions, 1307 flow [2024-06-20 18:20:25,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:20:25,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:20:25,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:20:25,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 18:20:25,278 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-20 18:20:25,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:20:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2072913055, now seen corresponding path program 7 times [2024-06-20 18:20:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:20:25,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954169046] [2024-06-20 18:20:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:20:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:20:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:20:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:20:32,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:20:32,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954169046] [2024-06-20 18:20:32,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954169046] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:20:32,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:20:32,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:20:32,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967379335] [2024-06-20 18:20:32,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:20:32,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:20:32,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:20:32,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:20:32,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:20:32,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:20:32,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 126 transitions, 1307 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:20:32,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:20:32,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:20:32,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:20:32,629 INFO L124 PetriNetUnfolderBase]: 373/648 cut-off events. [2024-06-20 18:20:32,630 INFO L125 PetriNetUnfolderBase]: For 29176/29176 co-relation queries the response was YES. [2024-06-20 18:20:32,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4720 conditions, 648 events. 373/648 cut-off events. For 29176/29176 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2677 event pairs, 59 based on Foata normal form. 3/649 useless extension candidates. Maximal degree in co-relation 4650. Up to 591 conditions per place. [2024-06-20 18:20:32,636 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 121 selfloop transitions, 20 changer transitions 0/143 dead transitions. [2024-06-20 18:20:32,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 143 transitions, 1668 flow [2024-06-20 18:20:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:20:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:20:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-20 18:20:32,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-20 18:20:32,638 INFO L175 Difference]: Start difference. First operand has 141 places, 126 transitions, 1307 flow. Second operand 9 states and 106 transitions. [2024-06-20 18:20:32,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 143 transitions, 1668 flow [2024-06-20 18:20:32,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 143 transitions, 1621 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-20 18:20:32,693 INFO L231 Difference]: Finished difference. Result has 143 places, 129 transitions, 1357 flow [2024-06-20 18:20:32,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1357, PETRI_PLACES=143, PETRI_TRANSITIONS=129} [2024-06-20 18:20:32,693 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 113 predicate places. [2024-06-20 18:20:32,693 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 129 transitions, 1357 flow [2024-06-20 18:20:32,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:20:32,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:20:32,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:20:32,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 18:20:32,694 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-20 18:20:32,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:20:32,695 INFO L85 PathProgramCache]: Analyzing trace with hash -723190932, now seen corresponding path program 4 times [2024-06-20 18:20:32,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:20:32,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817390385] [2024-06-20 18:20:32,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:20:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:20:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:20:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:20:40,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:20:40,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817390385] [2024-06-20 18:20:40,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817390385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:20:40,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:20:40,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:20:40,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432682281] [2024-06-20 18:20:40,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:20:40,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:20:40,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:20:40,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:20:40,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:20:40,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:20:40,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 129 transitions, 1357 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:20:40,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:20:40,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:20:40,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:20:40,921 INFO L124 PetriNetUnfolderBase]: 369/642 cut-off events. [2024-06-20 18:20:40,922 INFO L125 PetriNetUnfolderBase]: For 28648/28648 co-relation queries the response was YES. [2024-06-20 18:20:40,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4691 conditions, 642 events. 369/642 cut-off events. For 28648/28648 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2643 event pairs, 57 based on Foata normal form. 2/642 useless extension candidates. Maximal degree in co-relation 4620. Up to 606 conditions per place. [2024-06-20 18:20:40,928 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 125 selfloop transitions, 15 changer transitions 0/142 dead transitions. [2024-06-20 18:20:40,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 142 transitions, 1681 flow [2024-06-20 18:20:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:20:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:20:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-20 18:20:40,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-20 18:20:40,929 INFO L175 Difference]: Start difference. First operand has 143 places, 129 transitions, 1357 flow. Second operand 9 states and 99 transitions. [2024-06-20 18:20:40,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 142 transitions, 1681 flow [2024-06-20 18:20:40,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 142 transitions, 1621 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-20 18:20:40,990 INFO L231 Difference]: Finished difference. Result has 145 places, 131 transitions, 1356 flow [2024-06-20 18:20:40,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1356, PETRI_PLACES=145, PETRI_TRANSITIONS=131} [2024-06-20 18:20:40,991 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2024-06-20 18:20:40,991 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 131 transitions, 1356 flow [2024-06-20 18:20:40,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:20:40,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:20:40,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:20:40,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 18:20:40,992 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-20 18:20:40,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:20:40,992 INFO L85 PathProgramCache]: Analyzing trace with hash -989103259, now seen corresponding path program 8 times [2024-06-20 18:20:40,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:20:40,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928990887] [2024-06-20 18:20:40,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:20:40,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:20:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:20:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:20:48,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:20:48,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928990887] [2024-06-20 18:20:48,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928990887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:20:48,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:20:48,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:20:48,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297791898] [2024-06-20 18:20:48,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:20:48,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:20:48,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:20:48,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:20:48,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:20:48,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:20:48,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 131 transitions, 1356 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:20:48,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:20:48,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:20:48,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:20:48,679 INFO L124 PetriNetUnfolderBase]: 372/647 cut-off events. [2024-06-20 18:20:48,679 INFO L125 PetriNetUnfolderBase]: For 29128/29128 co-relation queries the response was YES. [2024-06-20 18:20:48,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4740 conditions, 647 events. 372/647 cut-off events. For 29128/29128 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2682 event pairs, 50 based on Foata normal form. 1/646 useless extension candidates. Maximal degree in co-relation 4668. Up to 550 conditions per place. [2024-06-20 18:20:48,686 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 112 selfloop transitions, 32 changer transitions 0/146 dead transitions. [2024-06-20 18:20:48,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 146 transitions, 1785 flow [2024-06-20 18:20:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:20:48,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:20:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-20 18:20:48,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-20 18:20:48,687 INFO L175 Difference]: Start difference. First operand has 145 places, 131 transitions, 1356 flow. Second operand 9 states and 107 transitions. [2024-06-20 18:20:48,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 146 transitions, 1785 flow [2024-06-20 18:20:48,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 146 transitions, 1742 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-20 18:20:48,750 INFO L231 Difference]: Finished difference. Result has 147 places, 133 transitions, 1415 flow [2024-06-20 18:20:48,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1313, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1415, PETRI_PLACES=147, PETRI_TRANSITIONS=133} [2024-06-20 18:20:48,751 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2024-06-20 18:20:48,751 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 133 transitions, 1415 flow [2024-06-20 18:20:48,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:20:48,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:20:48,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:20:48,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 18:20:48,752 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-20 18:20:48,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:20:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash -732395142, now seen corresponding path program 5 times [2024-06-20 18:20:48,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:20:48,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943418344] [2024-06-20 18:20:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:20:48,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:20:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:20:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:20:56,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:20:56,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943418344] [2024-06-20 18:20:56,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943418344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:20:56,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:20:56,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:20:56,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338997348] [2024-06-20 18:20:56,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:20:56,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:20:56,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:20:56,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:20:56,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:20:56,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:20:56,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 133 transitions, 1415 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:20:56,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:20:56,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:20:56,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:20:57,380 INFO L124 PetriNetUnfolderBase]: 378/657 cut-off events. [2024-06-20 18:20:57,380 INFO L125 PetriNetUnfolderBase]: For 31775/31775 co-relation queries the response was YES. [2024-06-20 18:20:57,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4876 conditions, 657 events. 378/657 cut-off events. For 31775/31775 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2719 event pairs, 57 based on Foata normal form. 2/657 useless extension candidates. Maximal degree in co-relation 4803. Up to 617 conditions per place. [2024-06-20 18:20:57,386 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 129 selfloop transitions, 16 changer transitions 0/147 dead transitions. [2024-06-20 18:20:57,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 147 transitions, 1761 flow [2024-06-20 18:20:57,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:20:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:20:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-20 18:20:57,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-20 18:20:57,388 INFO L175 Difference]: Start difference. First operand has 147 places, 133 transitions, 1415 flow. Second operand 9 states and 110 transitions. [2024-06-20 18:20:57,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 147 transitions, 1761 flow [2024-06-20 18:20:57,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 147 transitions, 1623 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-20 18:20:57,450 INFO L231 Difference]: Finished difference. Result has 147 places, 135 transitions, 1346 flow [2024-06-20 18:20:57,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1346, PETRI_PLACES=147, PETRI_TRANSITIONS=135} [2024-06-20 18:20:57,450 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2024-06-20 18:20:57,451 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 135 transitions, 1346 flow [2024-06-20 18:20:57,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:20:57,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:20:57,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:20:57,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 18:20:57,451 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-20 18:20:57,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:20:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash -988895652, now seen corresponding path program 6 times [2024-06-20 18:20:57,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:20:57,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619406209] [2024-06-20 18:20:57,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:20:57,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:20:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:21:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:21:06,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:21:06,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619406209] [2024-06-20 18:21:06,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619406209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:21:06,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:21:06,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:21:06,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394054213] [2024-06-20 18:21:06,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:21:06,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:21:06,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:21:06,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:21:06,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:21:06,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:21:06,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 135 transitions, 1346 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:21:06,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:21:06,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:21:06,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:21:07,123 INFO L124 PetriNetUnfolderBase]: 387/672 cut-off events. [2024-06-20 18:21:07,123 INFO L125 PetriNetUnfolderBase]: For 32886/32886 co-relation queries the response was YES. [2024-06-20 18:21:07,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4839 conditions, 672 events. 387/672 cut-off events. For 32886/32886 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2815 event pairs, 54 based on Foata normal form. 2/672 useless extension candidates. Maximal degree in co-relation 4767. Up to 611 conditions per place. [2024-06-20 18:21:07,129 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 131 selfloop transitions, 22 changer transitions 0/155 dead transitions. [2024-06-20 18:21:07,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 155 transitions, 1736 flow [2024-06-20 18:21:07,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:21:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:21:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-20 18:21:07,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154 [2024-06-20 18:21:07,130 INFO L175 Difference]: Start difference. First operand has 147 places, 135 transitions, 1346 flow. Second operand 9 states and 115 transitions. [2024-06-20 18:21:07,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 155 transitions, 1736 flow [2024-06-20 18:21:07,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 155 transitions, 1687 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-20 18:21:07,193 INFO L231 Difference]: Finished difference. Result has 151 places, 141 transitions, 1422 flow [2024-06-20 18:21:07,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1422, PETRI_PLACES=151, PETRI_TRANSITIONS=141} [2024-06-20 18:21:07,194 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-20 18:21:07,194 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 141 transitions, 1422 flow [2024-06-20 18:21:07,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:21:07,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:21:07,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:21:07,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 18:21:07,197 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-20 18:21:07,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:21:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash -732395359, now seen corresponding path program 9 times [2024-06-20 18:21:07,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:21:07,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731181013] [2024-06-20 18:21:07,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:21:07,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:21:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:21:14,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:21:14,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:21:14,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731181013] [2024-06-20 18:21:14,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731181013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:21:14,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:21:14,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:21:14,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399842758] [2024-06-20 18:21:14,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:21:14,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:21:14,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:21:14,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:21:14,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:21:14,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:21:14,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 141 transitions, 1422 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:21:14,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:21:14,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:21:14,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:21:15,150 INFO L124 PetriNetUnfolderBase]: 386/671 cut-off events. [2024-06-20 18:21:15,150 INFO L125 PetriNetUnfolderBase]: For 33868/33868 co-relation queries the response was YES. [2024-06-20 18:21:15,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4891 conditions, 671 events. 386/671 cut-off events. For 33868/33868 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2821 event pairs, 52 based on Foata normal form. 3/672 useless extension candidates. Maximal degree in co-relation 4816. Up to 626 conditions per place. [2024-06-20 18:21:15,157 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 136 selfloop transitions, 17 changer transitions 0/155 dead transitions. [2024-06-20 18:21:15,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 155 transitions, 1789 flow [2024-06-20 18:21:15,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:21:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:21:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-20 18:21:15,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-20 18:21:15,159 INFO L175 Difference]: Start difference. First operand has 151 places, 141 transitions, 1422 flow. Second operand 9 states and 102 transitions. [2024-06-20 18:21:15,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 155 transitions, 1789 flow [2024-06-20 18:21:15,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 155 transitions, 1738 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-20 18:21:15,222 INFO L231 Difference]: Finished difference. Result has 155 places, 143 transitions, 1442 flow [2024-06-20 18:21:15,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1442, PETRI_PLACES=155, PETRI_TRANSITIONS=143} [2024-06-20 18:21:15,222 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places. [2024-06-20 18:21:15,223 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 143 transitions, 1442 flow [2024-06-20 18:21:15,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:21:15,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:21:15,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:21:15,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 18:21:15,223 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-20 18:21:15,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:21:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash -989097462, now seen corresponding path program 7 times [2024-06-20 18:21:15,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:21:15,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631591564] [2024-06-20 18:21:15,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:21:15,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:21:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:21:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:21:22,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:21:22,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631591564] [2024-06-20 18:21:22,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631591564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:21:22,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:21:22,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:21:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777395955] [2024-06-20 18:21:22,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:21:22,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:21:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:21:22,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:21:22,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:21:23,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:21:23,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 143 transitions, 1442 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:21:23,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:21:23,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:21:23,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:21:23,445 INFO L124 PetriNetUnfolderBase]: 382/665 cut-off events. [2024-06-20 18:21:23,446 INFO L125 PetriNetUnfolderBase]: For 32204/32204 co-relation queries the response was YES. [2024-06-20 18:21:23,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4782 conditions, 665 events. 382/665 cut-off events. For 32204/32204 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2789 event pairs, 47 based on Foata normal form. 2/665 useless extension candidates. Maximal degree in co-relation 4706. Up to 584 conditions per place. [2024-06-20 18:21:23,452 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 126 selfloop transitions, 27 changer transitions 0/155 dead transitions. [2024-06-20 18:21:23,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 155 transitions, 1782 flow [2024-06-20 18:21:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:21:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:21:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-20 18:21:23,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050179211469534 [2024-06-20 18:21:23,453 INFO L175 Difference]: Start difference. First operand has 155 places, 143 transitions, 1442 flow. Second operand 9 states and 113 transitions. [2024-06-20 18:21:23,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 155 transitions, 1782 flow [2024-06-20 18:21:23,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 155 transitions, 1728 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-20 18:21:23,526 INFO L231 Difference]: Finished difference. Result has 157 places, 143 transitions, 1447 flow [2024-06-20 18:21:23,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1447, PETRI_PLACES=157, PETRI_TRANSITIONS=143} [2024-06-20 18:21:23,527 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places. [2024-06-20 18:21:23,527 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 143 transitions, 1447 flow [2024-06-20 18:21:23,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:21:23,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:21:23,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:21:23,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 18:21:23,528 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-20 18:21:23,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:21:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash -989097679, now seen corresponding path program 10 times [2024-06-20 18:21:23,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:21:23,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953326625] [2024-06-20 18:21:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:21:23,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:21:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:21:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:21:30,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:21:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953326625] [2024-06-20 18:21:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953326625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:21:30,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:21:30,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:21:30,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905496645] [2024-06-20 18:21:30,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:21:30,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:21:30,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:21:30,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:21:30,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:21:30,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:21:30,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 143 transitions, 1447 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:21:30,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:21:30,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:21:30,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:21:31,140 INFO L124 PetriNetUnfolderBase]: 380/662 cut-off events. [2024-06-20 18:21:31,140 INFO L125 PetriNetUnfolderBase]: For 32110/32110 co-relation queries the response was YES. [2024-06-20 18:21:31,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 662 events. 380/662 cut-off events. For 32110/32110 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2765 event pairs, 45 based on Foata normal form. 1/661 useless extension candidates. Maximal degree in co-relation 4675. Up to 568 conditions per place. [2024-06-20 18:21:31,146 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 120 selfloop transitions, 32 changer transitions 0/154 dead transitions. [2024-06-20 18:21:31,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 154 transitions, 1781 flow [2024-06-20 18:21:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:21:31,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:21:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-20 18:21:31,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-20 18:21:31,148 INFO L175 Difference]: Start difference. First operand has 157 places, 143 transitions, 1447 flow. Second operand 9 states and 105 transitions. [2024-06-20 18:21:31,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 154 transitions, 1781 flow [2024-06-20 18:21:31,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 154 transitions, 1642 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-20 18:21:31,229 INFO L231 Difference]: Finished difference. Result has 157 places, 143 transitions, 1377 flow [2024-06-20 18:21:31,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1377, PETRI_PLACES=157, PETRI_TRANSITIONS=143} [2024-06-20 18:21:31,229 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places. [2024-06-20 18:21:31,229 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 143 transitions, 1377 flow [2024-06-20 18:21:31,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:21:31,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:21:31,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:21:31,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 18:21:31,230 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-20 18:21:31,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:21:31,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1689250213, now seen corresponding path program 1 times [2024-06-20 18:21:31,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:21:31,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394764777] [2024-06-20 18:21:31,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:21:31,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:21:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:21:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:21:39,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:21:39,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394764777] [2024-06-20 18:21:39,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394764777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:21:39,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:21:39,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:21:39,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732399139] [2024-06-20 18:21:39,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:21:39,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:21:39,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:21:39,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:21:39,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:21:39,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:21:39,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 143 transitions, 1377 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:21:39,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:21:39,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:21:39,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:21:40,463 INFO L124 PetriNetUnfolderBase]: 391/683 cut-off events. [2024-06-20 18:21:40,463 INFO L125 PetriNetUnfolderBase]: For 36552/36552 co-relation queries the response was YES. [2024-06-20 18:21:40,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4869 conditions, 683 events. 391/683 cut-off events. For 36552/36552 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2888 event pairs, 37 based on Foata normal form. 2/683 useless extension candidates. Maximal degree in co-relation 4792. Up to 596 conditions per place. [2024-06-20 18:21:40,469 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 149 selfloop transitions, 19 changer transitions 0/170 dead transitions. [2024-06-20 18:21:40,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 170 transitions, 1907 flow [2024-06-20 18:21:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:21:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:21:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-20 18:21:40,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507 [2024-06-20 18:21:40,473 INFO L175 Difference]: Start difference. First operand has 157 places, 143 transitions, 1377 flow. Second operand 11 states and 139 transitions. [2024-06-20 18:21:40,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 170 transitions, 1907 flow [2024-06-20 18:21:40,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 170 transitions, 1852 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 18:21:40,558 INFO L231 Difference]: Finished difference. Result has 162 places, 145 transitions, 1402 flow [2024-06-20 18:21:40,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1402, PETRI_PLACES=162, PETRI_TRANSITIONS=145} [2024-06-20 18:21:40,559 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2024-06-20 18:21:40,559 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 145 transitions, 1402 flow [2024-06-20 18:21:40,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:21:40,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:21:40,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:21:40,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 18:21:40,560 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-20 18:21:40,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:21:40,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1802814497, now seen corresponding path program 1 times [2024-06-20 18:21:40,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:21:40,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271645987] [2024-06-20 18:21:40,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:21:40,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:21:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:21:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:21:48,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:21:48,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271645987] [2024-06-20 18:21:48,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271645987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:21:48,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:21:48,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:21:48,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62704978] [2024-06-20 18:21:48,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:21:48,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:21:48,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:21:48,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:21:48,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:21:48,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:21:48,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 145 transitions, 1402 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:21:48,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:21:48,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:21:48,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:21:49,252 INFO L124 PetriNetUnfolderBase]: 402/701 cut-off events. [2024-06-20 18:21:49,253 INFO L125 PetriNetUnfolderBase]: For 38061/38061 co-relation queries the response was YES. [2024-06-20 18:21:49,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5037 conditions, 701 events. 402/701 cut-off events. For 38061/38061 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3000 event pairs, 53 based on Foata normal form. 1/700 useless extension candidates. Maximal degree in co-relation 4959. Up to 636 conditions per place. [2024-06-20 18:21:49,260 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 149 selfloop transitions, 23 changer transitions 0/174 dead transitions. [2024-06-20 18:21:49,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 174 transitions, 1960 flow [2024-06-20 18:21:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:21:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:21:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-20 18:21:49,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522 [2024-06-20 18:21:49,261 INFO L175 Difference]: Start difference. First operand has 162 places, 145 transitions, 1402 flow. Second operand 11 states and 130 transitions. [2024-06-20 18:21:49,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 174 transitions, 1960 flow [2024-06-20 18:21:49,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 174 transitions, 1905 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-20 18:21:49,354 INFO L231 Difference]: Finished difference. Result has 167 places, 151 transitions, 1465 flow [2024-06-20 18:21:49,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1349, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1465, PETRI_PLACES=167, PETRI_TRANSITIONS=151} [2024-06-20 18:21:49,355 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2024-06-20 18:21:49,355 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 151 transitions, 1465 flow [2024-06-20 18:21:49,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:21:49,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:21:49,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:21:49,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 18:21:49,356 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-20 18:21:49,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:21:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1689310663, now seen corresponding path program 2 times [2024-06-20 18:21:49,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:21:49,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250352734] [2024-06-20 18:21:49,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:21:49,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:21:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:21:57,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-20 18:21:57,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:21:57,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250352734] [2024-06-20 18:21:57,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250352734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:21:57,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:21:57,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:21:57,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209060080] [2024-06-20 18:21:57,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:21:57,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:21:57,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:21:57,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:21:57,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:21:57,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:21:57,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 151 transitions, 1465 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:21:57,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:21:57,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:21:57,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:21:57,687 INFO L124 PetriNetUnfolderBase]: 406/709 cut-off events. [2024-06-20 18:21:57,687 INFO L125 PetriNetUnfolderBase]: For 40819/40819 co-relation queries the response was YES. [2024-06-20 18:21:57,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5087 conditions, 709 events. 406/709 cut-off events. For 40819/40819 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3044 event pairs, 53 based on Foata normal form. 2/709 useless extension candidates. Maximal degree in co-relation 5007. Up to 650 conditions per place. [2024-06-20 18:21:57,694 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 153 selfloop transitions, 20 changer transitions 0/175 dead transitions. [2024-06-20 18:21:57,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 175 transitions, 1885 flow [2024-06-20 18:21:57,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:21:57,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:21:57,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-20 18:21:57,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2024-06-20 18:21:57,696 INFO L175 Difference]: Start difference. First operand has 167 places, 151 transitions, 1465 flow. Second operand 11 states and 138 transitions. [2024-06-20 18:21:57,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 175 transitions, 1885 flow [2024-06-20 18:21:57,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 175 transitions, 1853 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 18:21:57,795 INFO L231 Difference]: Finished difference. Result has 172 places, 152 transitions, 1489 flow [2024-06-20 18:21:57,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1489, PETRI_PLACES=172, PETRI_TRANSITIONS=152} [2024-06-20 18:21:57,796 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2024-06-20 18:21:57,796 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 152 transitions, 1489 flow [2024-06-20 18:21:57,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:21:57,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:21:57,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:21:57,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 18:21:57,797 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-20 18:21:57,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:21:57,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1692111947, now seen corresponding path program 2 times [2024-06-20 18:21:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:21:57,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923269315] [2024-06-20 18:21:57,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:21:57,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:21:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:22:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:22:04,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:22:04,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923269315] [2024-06-20 18:22:04,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923269315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:22:04,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:22:04,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:22:04,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526640752] [2024-06-20 18:22:04,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:22:04,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:22:04,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:22:04,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:22:04,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:22:04,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:22:04,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 152 transitions, 1489 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:04,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:22:04,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:22:04,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:22:04,909 INFO L124 PetriNetUnfolderBase]: 409/714 cut-off events. [2024-06-20 18:22:04,909 INFO L125 PetriNetUnfolderBase]: For 41513/41513 co-relation queries the response was YES. [2024-06-20 18:22:04,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5185 conditions, 714 events. 409/714 cut-off events. For 41513/41513 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3080 event pairs, 53 based on Foata normal form. 1/713 useless extension candidates. Maximal degree in co-relation 5103. Up to 670 conditions per place. [2024-06-20 18:22:04,916 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 153 selfloop transitions, 17 changer transitions 0/172 dead transitions. [2024-06-20 18:22:04,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 172 transitions, 1903 flow [2024-06-20 18:22:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:22:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:22:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-20 18:22:04,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096 [2024-06-20 18:22:04,917 INFO L175 Difference]: Start difference. First operand has 172 places, 152 transitions, 1489 flow. Second operand 10 states and 114 transitions. [2024-06-20 18:22:04,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 172 transitions, 1903 flow [2024-06-20 18:22:04,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 172 transitions, 1853 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-20 18:22:05,002 INFO L231 Difference]: Finished difference. Result has 172 places, 154 transitions, 1506 flow [2024-06-20 18:22:05,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1506, PETRI_PLACES=172, PETRI_TRANSITIONS=154} [2024-06-20 18:22:05,003 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2024-06-20 18:22:05,003 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 154 transitions, 1506 flow [2024-06-20 18:22:05,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:05,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:22:05,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:22:05,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 18:22:05,004 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-20 18:22:05,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:22:05,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1692112133, now seen corresponding path program 1 times [2024-06-20 18:22:05,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:22:05,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898047924] [2024-06-20 18:22:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:22:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:22:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:22:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:22:13,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:22:13,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898047924] [2024-06-20 18:22:13,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898047924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:22:13,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:22:13,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:22:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629456773] [2024-06-20 18:22:13,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:22:13,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:22:13,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:22:13,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:22:13,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:22:13,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:22:13,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 154 transitions, 1506 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:13,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:22:13,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:22:13,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:22:13,954 INFO L124 PetriNetUnfolderBase]: 415/724 cut-off events. [2024-06-20 18:22:13,954 INFO L125 PetriNetUnfolderBase]: For 44444/44444 co-relation queries the response was YES. [2024-06-20 18:22:13,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5250 conditions, 724 events. 415/724 cut-off events. For 44444/44444 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3140 event pairs, 52 based on Foata normal form. 2/724 useless extension candidates. Maximal degree in co-relation 5168. Up to 677 conditions per place. [2024-06-20 18:22:13,961 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 156 selfloop transitions, 17 changer transitions 0/175 dead transitions. [2024-06-20 18:22:13,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 175 transitions, 1930 flow [2024-06-20 18:22:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:22:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:22:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-20 18:22:13,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-20 18:22:13,963 INFO L175 Difference]: Start difference. First operand has 172 places, 154 transitions, 1506 flow. Second operand 10 states and 125 transitions. [2024-06-20 18:22:13,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 175 transitions, 1930 flow [2024-06-20 18:22:14,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 175 transitions, 1887 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-20 18:22:14,062 INFO L231 Difference]: Finished difference. Result has 174 places, 156 transitions, 1530 flow [2024-06-20 18:22:14,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1530, PETRI_PLACES=174, PETRI_TRANSITIONS=156} [2024-06-20 18:22:14,063 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 144 predicate places. [2024-06-20 18:22:14,063 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 156 transitions, 1530 flow [2024-06-20 18:22:14,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:14,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:22:14,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:22:14,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 18:22:14,064 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-20 18:22:14,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:22:14,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1802929693, now seen corresponding path program 3 times [2024-06-20 18:22:14,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:22:14,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981690395] [2024-06-20 18:22:14,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:22:14,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:22:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:22:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:22:21,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:22:21,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981690395] [2024-06-20 18:22:21,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981690395] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:22:21,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:22:21,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:22:21,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623533138] [2024-06-20 18:22:21,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:22:21,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:22:21,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:22:21,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:22:21,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:22:21,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:22:21,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 156 transitions, 1530 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:21,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:22:21,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:22:21,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:22:21,828 INFO L124 PetriNetUnfolderBase]: 412/719 cut-off events. [2024-06-20 18:22:21,828 INFO L125 PetriNetUnfolderBase]: For 43613/43613 co-relation queries the response was YES. [2024-06-20 18:22:21,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5187 conditions, 719 events. 412/719 cut-off events. For 43613/43613 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3107 event pairs, 51 based on Foata normal form. 2/719 useless extension candidates. Maximal degree in co-relation 5104. Up to 672 conditions per place. [2024-06-20 18:22:21,836 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 157 selfloop transitions, 16 changer transitions 0/175 dead transitions. [2024-06-20 18:22:21,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 175 transitions, 1928 flow [2024-06-20 18:22:21,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:22:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:22:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-20 18:22:21,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 18:22:21,837 INFO L175 Difference]: Start difference. First operand has 174 places, 156 transitions, 1530 flow. Second operand 10 states and 124 transitions. [2024-06-20 18:22:21,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 175 transitions, 1928 flow [2024-06-20 18:22:21,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 175 transitions, 1871 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-20 18:22:21,931 INFO L231 Difference]: Finished difference. Result has 176 places, 156 transitions, 1509 flow [2024-06-20 18:22:21,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1509, PETRI_PLACES=176, PETRI_TRANSITIONS=156} [2024-06-20 18:22:21,932 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 146 predicate places. [2024-06-20 18:22:21,932 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 156 transitions, 1509 flow [2024-06-20 18:22:21,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:21,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:22:21,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:22:21,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 18:22:21,933 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-20 18:22:21,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:22:21,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1692107297, now seen corresponding path program 3 times [2024-06-20 18:22:21,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:22:21,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587488324] [2024-06-20 18:22:21,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:22:21,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:22:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:22:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:22:28,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:22:28,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587488324] [2024-06-20 18:22:28,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587488324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:22:28,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:22:28,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:22:28,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990465898] [2024-06-20 18:22:28,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:22:28,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:22:28,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:22:28,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:22:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:22:28,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:22:28,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 156 transitions, 1509 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:28,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:22:28,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:22:28,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:22:29,230 INFO L124 PetriNetUnfolderBase]: 410/716 cut-off events. [2024-06-20 18:22:29,230 INFO L125 PetriNetUnfolderBase]: For 42749/42749 co-relation queries the response was YES. [2024-06-20 18:22:29,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5117 conditions, 716 events. 410/716 cut-off events. For 42749/42749 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3096 event pairs, 51 based on Foata normal form. 1/715 useless extension candidates. Maximal degree in co-relation 5033. Up to 651 conditions per place. [2024-06-20 18:22:29,237 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 147 selfloop transitions, 24 changer transitions 0/173 dead transitions. [2024-06-20 18:22:29,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 173 transitions, 1899 flow [2024-06-20 18:22:29,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:22:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:22:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-20 18:22:29,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 18:22:29,238 INFO L175 Difference]: Start difference. First operand has 176 places, 156 transitions, 1509 flow. Second operand 9 states and 108 transitions. [2024-06-20 18:22:29,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 173 transitions, 1899 flow [2024-06-20 18:22:29,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 173 transitions, 1843 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-20 18:22:29,315 INFO L231 Difference]: Finished difference. Result has 175 places, 156 transitions, 1513 flow [2024-06-20 18:22:29,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1513, PETRI_PLACES=175, PETRI_TRANSITIONS=156} [2024-06-20 18:22:29,320 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 145 predicate places. [2024-06-20 18:22:29,320 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 156 transitions, 1513 flow [2024-06-20 18:22:29,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:29,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:22:29,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:22:29,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 18:22:29,321 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-20 18:22:29,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:22:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1135249159, now seen corresponding path program 4 times [2024-06-20 18:22:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:22:29,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900235389] [2024-06-20 18:22:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:22:29,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:22:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:22:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:22:34,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:22:34,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900235389] [2024-06-20 18:22:34,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900235389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:22:34,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:22:34,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:22:34,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192672834] [2024-06-20 18:22:34,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:22:34,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:22:34,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:22:34,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:22:34,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:22:35,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:22:35,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 156 transitions, 1513 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:35,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:22:35,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:22:35,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:22:35,439 INFO L124 PetriNetUnfolderBase]: 414/724 cut-off events. [2024-06-20 18:22:35,440 INFO L125 PetriNetUnfolderBase]: For 45864/45864 co-relation queries the response was YES. [2024-06-20 18:22:35,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5201 conditions, 724 events. 414/724 cut-off events. For 45864/45864 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3149 event pairs, 52 based on Foata normal form. 2/724 useless extension candidates. Maximal degree in co-relation 5116. Up to 650 conditions per place. [2024-06-20 18:22:35,446 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 142 selfloop transitions, 29 changer transitions 0/173 dead transitions. [2024-06-20 18:22:35,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 173 transitions, 1917 flow [2024-06-20 18:22:35,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:22:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:22:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-20 18:22:35,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-20 18:22:35,449 INFO L175 Difference]: Start difference. First operand has 175 places, 156 transitions, 1513 flow. Second operand 10 states and 116 transitions. [2024-06-20 18:22:35,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 173 transitions, 1917 flow [2024-06-20 18:22:35,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 173 transitions, 1868 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 18:22:35,545 INFO L231 Difference]: Finished difference. Result has 177 places, 157 transitions, 1548 flow [2024-06-20 18:22:35,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1548, PETRI_PLACES=177, PETRI_TRANSITIONS=157} [2024-06-20 18:22:35,546 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2024-06-20 18:22:35,546 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 157 transitions, 1548 flow [2024-06-20 18:22:35,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:35,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:22:35,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:22:35,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 18:22:35,547 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-20 18:22:35,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:22:35,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1807398467, now seen corresponding path program 4 times [2024-06-20 18:22:35,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:22:35,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638312366] [2024-06-20 18:22:35,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:22:35,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:22:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:22:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:22:42,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:22:42,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638312366] [2024-06-20 18:22:42,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638312366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:22:42,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:22:42,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:22:42,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152973978] [2024-06-20 18:22:42,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:22:42,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:22:42,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:22:42,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:22:42,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:22:42,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:22:42,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 157 transitions, 1548 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:42,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:22:42,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:22:42,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:22:42,775 INFO L124 PetriNetUnfolderBase]: 412/721 cut-off events. [2024-06-20 18:22:42,775 INFO L125 PetriNetUnfolderBase]: For 41677/41677 co-relation queries the response was YES. [2024-06-20 18:22:42,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5120 conditions, 721 events. 412/721 cut-off events. For 41677/41677 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3145 event pairs, 35 based on Foata normal form. 1/720 useless extension candidates. Maximal degree in co-relation 5035. Up to 440 conditions per place. [2024-06-20 18:22:42,782 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 103 selfloop transitions, 69 changer transitions 0/174 dead transitions. [2024-06-20 18:22:42,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 174 transitions, 2042 flow [2024-06-20 18:22:42,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:22:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:22:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-20 18:22:42,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4336917562724014 [2024-06-20 18:22:42,787 INFO L175 Difference]: Start difference. First operand has 177 places, 157 transitions, 1548 flow. Second operand 9 states and 121 transitions. [2024-06-20 18:22:42,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 174 transitions, 2042 flow [2024-06-20 18:22:42,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 174 transitions, 1962 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-20 18:22:42,886 INFO L231 Difference]: Finished difference. Result has 178 places, 157 transitions, 1613 flow [2024-06-20 18:22:42,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1613, PETRI_PLACES=178, PETRI_TRANSITIONS=157} [2024-06-20 18:22:42,886 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 148 predicate places. [2024-06-20 18:22:42,887 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 157 transitions, 1613 flow [2024-06-20 18:22:42,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:42,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:22:42,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:22:42,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 18:22:42,888 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-20 18:22:42,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:22:42,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1135244199, now seen corresponding path program 2 times [2024-06-20 18:22:42,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:22:42,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712330732] [2024-06-20 18:22:42,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:22:42,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:22:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:22:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:22:52,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:22:52,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712330732] [2024-06-20 18:22:52,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712330732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:22:52,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:22:52,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:22:52,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885770412] [2024-06-20 18:22:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:22:52,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:22:52,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:22:52,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:22:52,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:22:52,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:22:52,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 157 transitions, 1613 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:52,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:22:52,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:22:52,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:22:52,718 INFO L124 PetriNetUnfolderBase]: 484/837 cut-off events. [2024-06-20 18:22:52,719 INFO L125 PetriNetUnfolderBase]: For 63678/63678 co-relation queries the response was YES. [2024-06-20 18:22:52,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6455 conditions, 837 events. 484/837 cut-off events. For 63678/63678 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3758 event pairs, 39 based on Foata normal form. 4/839 useless extension candidates. Maximal degree in co-relation 6369. Up to 384 conditions per place. [2024-06-20 18:22:52,727 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 127 selfloop transitions, 66 changer transitions 0/195 dead transitions. [2024-06-20 18:22:52,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 195 transitions, 2657 flow [2024-06-20 18:22:52,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:22:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:22:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2024-06-20 18:22:52,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45483870967741935 [2024-06-20 18:22:52,729 INFO L175 Difference]: Start difference. First operand has 178 places, 157 transitions, 1613 flow. Second operand 10 states and 141 transitions. [2024-06-20 18:22:52,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 195 transitions, 2657 flow [2024-06-20 18:22:52,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 195 transitions, 2474 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-20 18:22:52,866 INFO L231 Difference]: Finished difference. Result has 179 places, 168 transitions, 1733 flow [2024-06-20 18:22:52,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1733, PETRI_PLACES=179, PETRI_TRANSITIONS=168} [2024-06-20 18:22:52,866 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2024-06-20 18:22:52,866 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 168 transitions, 1733 flow [2024-06-20 18:22:52,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:52,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:22:52,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:22:52,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 18:22:52,867 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-20 18:22:52,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:22:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash -733156331, now seen corresponding path program 3 times [2024-06-20 18:22:52,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:22:52,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472634349] [2024-06-20 18:22:52,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:22:52,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:22:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:22:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:22:59,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:22:59,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472634349] [2024-06-20 18:22:59,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472634349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:22:59,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:22:59,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:22:59,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137982378] [2024-06-20 18:22:59,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:22:59,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:22:59,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:22:59,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:22:59,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:22:59,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:22:59,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 168 transitions, 1733 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:22:59,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:22:59,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:22:59,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:23:00,345 INFO L124 PetriNetUnfolderBase]: 510/879 cut-off events. [2024-06-20 18:23:00,345 INFO L125 PetriNetUnfolderBase]: For 66963/66963 co-relation queries the response was YES. [2024-06-20 18:23:00,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6948 conditions, 879 events. 510/879 cut-off events. For 66963/66963 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3978 event pairs, 38 based on Foata normal form. 2/879 useless extension candidates. Maximal degree in co-relation 6862. Up to 404 conditions per place. [2024-06-20 18:23:00,355 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 114 selfloop transitions, 83 changer transitions 0/199 dead transitions. [2024-06-20 18:23:00,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 199 transitions, 2625 flow [2024-06-20 18:23:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:23:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:23:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2024-06-20 18:23:00,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47096774193548385 [2024-06-20 18:23:00,362 INFO L175 Difference]: Start difference. First operand has 179 places, 168 transitions, 1733 flow. Second operand 10 states and 146 transitions. [2024-06-20 18:23:00,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 199 transitions, 2625 flow [2024-06-20 18:23:00,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 199 transitions, 2524 flow, removed 40 selfloop flow, removed 3 redundant places. [2024-06-20 18:23:00,520 INFO L231 Difference]: Finished difference. Result has 187 places, 175 transitions, 1936 flow [2024-06-20 18:23:00,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1936, PETRI_PLACES=187, PETRI_TRANSITIONS=175} [2024-06-20 18:23:00,521 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2024-06-20 18:23:00,521 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 175 transitions, 1936 flow [2024-06-20 18:23:00,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:23:00,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:23:00,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:23:00,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 18:23:00,522 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-20 18:23:00,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:23:00,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1135071219, now seen corresponding path program 4 times [2024-06-20 18:23:00,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:23:00,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263411020] [2024-06-20 18:23:00,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:23:00,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:23:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:23:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:23:10,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:23:10,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263411020] [2024-06-20 18:23:10,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263411020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:23:10,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:23:10,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:23:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956101036] [2024-06-20 18:23:10,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:23:10,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:23:10,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:23:10,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:23:10,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:23:10,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:23:10,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 175 transitions, 1936 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:23:10,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:23:10,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:23:10,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:23:10,896 INFO L124 PetriNetUnfolderBase]: 502/867 cut-off events. [2024-06-20 18:23:10,896 INFO L125 PetriNetUnfolderBase]: For 66591/66591 co-relation queries the response was YES. [2024-06-20 18:23:10,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6894 conditions, 867 events. 502/867 cut-off events. For 66591/66591 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3931 event pairs, 43 based on Foata normal form. 4/869 useless extension candidates. Maximal degree in co-relation 6805. Up to 400 conditions per place. [2024-06-20 18:23:10,906 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 123 selfloop transitions, 74 changer transitions 0/199 dead transitions. [2024-06-20 18:23:10,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 199 transitions, 2730 flow [2024-06-20 18:23:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:23:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:23:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-20 18:23:10,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44193548387096776 [2024-06-20 18:23:10,909 INFO L175 Difference]: Start difference. First operand has 187 places, 175 transitions, 1936 flow. Second operand 10 states and 137 transitions. [2024-06-20 18:23:10,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 199 transitions, 2730 flow [2024-06-20 18:23:11,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 199 transitions, 2592 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-20 18:23:11,068 INFO L231 Difference]: Finished difference. Result has 191 places, 175 transitions, 1953 flow [2024-06-20 18:23:11,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1798, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1953, PETRI_PLACES=191, PETRI_TRANSITIONS=175} [2024-06-20 18:23:11,069 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 161 predicate places. [2024-06-20 18:23:11,069 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 175 transitions, 1953 flow [2024-06-20 18:23:11,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:23:11,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:23:11,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:23:11,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 18:23:11,070 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-20 18:23:11,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:23:11,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1973037477, now seen corresponding path program 5 times [2024-06-20 18:23:11,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:23:11,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959715409] [2024-06-20 18:23:11,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:23:11,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:23:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:23:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:23:18,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:23:18,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959715409] [2024-06-20 18:23:18,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959715409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:23:18,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:23:18,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:23:18,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141854923] [2024-06-20 18:23:18,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:23:18,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:23:18,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:23:18,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:23:18,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:23:18,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:23:18,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 175 transitions, 1953 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:23:18,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:23:18,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:23:18,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:23:18,706 INFO L124 PetriNetUnfolderBase]: 506/875 cut-off events. [2024-06-20 18:23:18,706 INFO L125 PetriNetUnfolderBase]: For 66541/66541 co-relation queries the response was YES. [2024-06-20 18:23:18,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6985 conditions, 875 events. 506/875 cut-off events. For 66541/66541 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3976 event pairs, 66 based on Foata normal form. 2/875 useless extension candidates. Maximal degree in co-relation 6895. Up to 834 conditions per place. [2024-06-20 18:23:18,714 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 168 selfloop transitions, 19 changer transitions 0/189 dead transitions. [2024-06-20 18:23:18,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 189 transitions, 2381 flow [2024-06-20 18:23:18,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:23:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:23:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-20 18:23:18,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 18:23:18,716 INFO L175 Difference]: Start difference. First operand has 191 places, 175 transitions, 1953 flow. Second operand 10 states and 120 transitions. [2024-06-20 18:23:18,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 189 transitions, 2381 flow [2024-06-20 18:23:18,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 189 transitions, 2237 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-20 18:23:18,827 INFO L231 Difference]: Finished difference. Result has 194 places, 176 transitions, 1875 flow [2024-06-20 18:23:18,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1875, PETRI_PLACES=194, PETRI_TRANSITIONS=176} [2024-06-20 18:23:18,827 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 164 predicate places. [2024-06-20 18:23:18,827 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 176 transitions, 1875 flow [2024-06-20 18:23:18,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:23:18,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:23:18,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:23:18,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 18:23:18,828 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-20 18:23:18,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:23:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1973042437, now seen corresponding path program 5 times [2024-06-20 18:23:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:23:18,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809496722] [2024-06-20 18:23:18,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:23:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:23:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:23:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:23:26,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:23:26,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809496722] [2024-06-20 18:23:26,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809496722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:23:26,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:23:26,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:23:26,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220795046] [2024-06-20 18:23:26,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:23:26,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:23:26,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:23:26,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:23:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:23:26,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:23:26,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 176 transitions, 1875 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:23:26,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:23:26,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:23:26,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:23:26,618 INFO L124 PetriNetUnfolderBase]: 548/943 cut-off events. [2024-06-20 18:23:26,618 INFO L125 PetriNetUnfolderBase]: For 80117/80117 co-relation queries the response was YES. [2024-06-20 18:23:26,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7570 conditions, 943 events. 548/943 cut-off events. For 80117/80117 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4371 event pairs, 55 based on Foata normal form. 4/945 useless extension candidates. Maximal degree in co-relation 7479. Up to 755 conditions per place. [2024-06-20 18:23:26,626 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 162 selfloop transitions, 41 changer transitions 0/205 dead transitions. [2024-06-20 18:23:26,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 205 transitions, 2685 flow [2024-06-20 18:23:26,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:23:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:23:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-20 18:23:26,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42258064516129035 [2024-06-20 18:23:26,628 INFO L175 Difference]: Start difference. First operand has 194 places, 176 transitions, 1875 flow. Second operand 10 states and 131 transitions. [2024-06-20 18:23:26,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 205 transitions, 2685 flow [2024-06-20 18:23:26,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 205 transitions, 2629 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-20 18:23:26,775 INFO L231 Difference]: Finished difference. Result has 196 places, 183 transitions, 2020 flow [2024-06-20 18:23:26,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2020, PETRI_PLACES=196, PETRI_TRANSITIONS=183} [2024-06-20 18:23:26,776 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 166 predicate places. [2024-06-20 18:23:26,776 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 183 transitions, 2020 flow [2024-06-20 18:23:26,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:23:26,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:23:26,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:23:26,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 18:23:26,777 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-20 18:23:26,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:23:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1973221927, now seen corresponding path program 6 times [2024-06-20 18:23:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:23:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366569443] [2024-06-20 18:23:26,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:23:26,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:23:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:23:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:23:33,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:23:33,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366569443] [2024-06-20 18:23:33,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366569443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:23:33,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:23:33,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:23:33,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804979752] [2024-06-20 18:23:33,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:23:33,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:23:33,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:23:33,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:23:33,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:23:34,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:23:34,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 183 transitions, 2020 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:23:34,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:23:34,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:23:34,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:23:34,626 INFO L124 PetriNetUnfolderBase]: 589/1009 cut-off events. [2024-06-20 18:23:34,626 INFO L125 PetriNetUnfolderBase]: For 91431/91431 co-relation queries the response was YES. [2024-06-20 18:23:34,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8555 conditions, 1009 events. 589/1009 cut-off events. For 91431/91431 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4743 event pairs, 58 based on Foata normal form. 2/1009 useless extension candidates. Maximal degree in co-relation 8463. Up to 781 conditions per place. [2024-06-20 18:23:34,638 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 164 selfloop transitions, 49 changer transitions 0/215 dead transitions. [2024-06-20 18:23:34,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 215 transitions, 3022 flow [2024-06-20 18:23:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:23:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:23:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2024-06-20 18:23:34,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4612903225806452 [2024-06-20 18:23:34,640 INFO L175 Difference]: Start difference. First operand has 196 places, 183 transitions, 2020 flow. Second operand 10 states and 143 transitions. [2024-06-20 18:23:34,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 215 transitions, 3022 flow [2024-06-20 18:23:34,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 215 transitions, 2933 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-20 18:23:34,852 INFO L231 Difference]: Finished difference. Result has 203 places, 192 transitions, 2228 flow [2024-06-20 18:23:34,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2228, PETRI_PLACES=203, PETRI_TRANSITIONS=192} [2024-06-20 18:23:34,853 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2024-06-20 18:23:34,853 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 192 transitions, 2228 flow [2024-06-20 18:23:34,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:23:34,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:23:34,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:23:34,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 18:23:34,854 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-20 18:23:34,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:23:34,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1973215417, now seen corresponding path program 7 times [2024-06-20 18:23:34,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:23:34,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805807146] [2024-06-20 18:23:34,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:23:34,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:23:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:23:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:23:42,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:23:42,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805807146] [2024-06-20 18:23:42,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805807146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:23:42,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:23:42,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:23:42,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049422037] [2024-06-20 18:23:42,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:23:42,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:23:42,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:23:42,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:23:42,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:23:42,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:23:42,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 192 transitions, 2228 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:23:42,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:23:42,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:23:42,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:23:43,006 INFO L124 PetriNetUnfolderBase]: 583/1001 cut-off events. [2024-06-20 18:23:43,006 INFO L125 PetriNetUnfolderBase]: For 91823/91823 co-relation queries the response was YES. [2024-06-20 18:23:43,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8496 conditions, 1001 events. 583/1001 cut-off events. For 91823/91823 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4727 event pairs, 59 based on Foata normal form. 4/1003 useless extension candidates. Maximal degree in co-relation 8400. Up to 780 conditions per place. [2024-06-20 18:23:43,018 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 168 selfloop transitions, 45 changer transitions 0/215 dead transitions. [2024-06-20 18:23:43,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 215 transitions, 3082 flow [2024-06-20 18:23:43,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:23:43,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:23:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-20 18:23:43,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.432258064516129 [2024-06-20 18:23:43,020 INFO L175 Difference]: Start difference. First operand has 203 places, 192 transitions, 2228 flow. Second operand 10 states and 134 transitions. [2024-06-20 18:23:43,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 215 transitions, 3082 flow [2024-06-20 18:23:43,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 215 transitions, 2972 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-06-20 18:23:43,237 INFO L231 Difference]: Finished difference. Result has 208 places, 192 transitions, 2215 flow [2024-06-20 18:23:43,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2215, PETRI_PLACES=208, PETRI_TRANSITIONS=192} [2024-06-20 18:23:43,238 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-20 18:23:43,239 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 192 transitions, 2215 flow [2024-06-20 18:23:43,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:23:43,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:23:43,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:23:43,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 18:23:43,239 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-20 18:23:43,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:23:43,240 INFO L85 PathProgramCache]: Analyzing trace with hash -566929247, now seen corresponding path program 5 times [2024-06-20 18:23:43,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:23:43,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001843440] [2024-06-20 18:23:43,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:23:43,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:23:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:23:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:23:49,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:23:49,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001843440] [2024-06-20 18:23:49,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001843440] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:23:49,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:23:49,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:23:49,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881674291] [2024-06-20 18:23:49,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:23:49,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:23:49,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:23:49,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:23:49,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:23:50,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:23:50,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 192 transitions, 2215 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:23:50,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:23:50,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:23:50,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:23:50,435 INFO L124 PetriNetUnfolderBase]: 579/994 cut-off events. [2024-06-20 18:23:50,436 INFO L125 PetriNetUnfolderBase]: For 88681/88681 co-relation queries the response was YES. [2024-06-20 18:23:50,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8363 conditions, 994 events. 579/994 cut-off events. For 88681/88681 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4693 event pairs, 64 based on Foata normal form. 1/993 useless extension candidates. Maximal degree in co-relation 8266. Up to 898 conditions per place. [2024-06-20 18:23:50,445 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 173 selfloop transitions, 33 changer transitions 0/208 dead transitions. [2024-06-20 18:23:50,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 208 transitions, 2673 flow [2024-06-20 18:23:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:23:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:23:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-20 18:23:50,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-20 18:23:50,447 INFO L175 Difference]: Start difference. First operand has 208 places, 192 transitions, 2215 flow. Second operand 10 states and 122 transitions. [2024-06-20 18:23:50,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 208 transitions, 2673 flow [2024-06-20 18:23:50,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 208 transitions, 2582 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-20 18:23:50,611 INFO L231 Difference]: Finished difference. Result has 210 places, 192 transitions, 2195 flow [2024-06-20 18:23:50,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2195, PETRI_PLACES=210, PETRI_TRANSITIONS=192} [2024-06-20 18:23:50,612 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2024-06-20 18:23:50,612 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 192 transitions, 2195 flow [2024-06-20 18:23:50,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:23:50,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:23:50,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:23:50,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 18:23:50,612 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-20 18:23:50,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:23:50,613 INFO L85 PathProgramCache]: Analyzing trace with hash -963175975, now seen corresponding path program 8 times [2024-06-20 18:23:50,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:23:50,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535033742] [2024-06-20 18:23:50,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:23:50,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:23:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:23:59,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:23:59,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:23:59,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535033742] [2024-06-20 18:23:59,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535033742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:23:59,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:23:59,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:23:59,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375500764] [2024-06-20 18:23:59,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:23:59,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:23:59,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:23:59,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:23:59,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:23:59,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:23:59,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 192 transitions, 2195 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:23:59,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:23:59,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:23:59,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:23:59,970 INFO L124 PetriNetUnfolderBase]: 585/1004 cut-off events. [2024-06-20 18:23:59,970 INFO L125 PetriNetUnfolderBase]: For 93514/93514 co-relation queries the response was YES. [2024-06-20 18:23:59,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8436 conditions, 1004 events. 585/1004 cut-off events. For 93514/93514 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4741 event pairs, 59 based on Foata normal form. 2/1004 useless extension candidates. Maximal degree in co-relation 8338. Up to 903 conditions per place. [2024-06-20 18:23:59,982 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 184 selfloop transitions, 29 changer transitions 0/215 dead transitions. [2024-06-20 18:23:59,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 2873 flow [2024-06-20 18:23:59,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:23:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:23:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-20 18:23:59,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2024-06-20 18:23:59,983 INFO L175 Difference]: Start difference. First operand has 210 places, 192 transitions, 2195 flow. Second operand 10 states and 132 transitions. [2024-06-20 18:23:59,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 2873 flow [2024-06-20 18:24:00,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 215 transitions, 2796 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-20 18:24:00,223 INFO L231 Difference]: Finished difference. Result has 212 places, 196 transitions, 2263 flow [2024-06-20 18:24:00,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2263, PETRI_PLACES=212, PETRI_TRANSITIONS=196} [2024-06-20 18:24:00,224 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2024-06-20 18:24:00,224 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 196 transitions, 2263 flow [2024-06-20 18:24:00,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:00,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:24:00,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:24:00,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 18:24:00,225 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-20 18:24:00,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:24:00,226 INFO L85 PathProgramCache]: Analyzing trace with hash -560426873, now seen corresponding path program 1 times [2024-06-20 18:24:00,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:24:00,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996052490] [2024-06-20 18:24:00,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:24:00,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:24:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:24:07,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-20 18:24:07,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:24:07,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996052490] [2024-06-20 18:24:07,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996052490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:24:07,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:24:07,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:24:07,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768856447] [2024-06-20 18:24:07,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:24:07,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:24:07,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:24:07,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:24:07,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:24:07,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:24:07,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 196 transitions, 2263 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:07,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:24:07,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:24:07,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:24:07,783 INFO L124 PetriNetUnfolderBase]: 589/1012 cut-off events. [2024-06-20 18:24:07,783 INFO L125 PetriNetUnfolderBase]: For 96983/96983 co-relation queries the response was YES. [2024-06-20 18:24:07,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8539 conditions, 1012 events. 589/1012 cut-off events. For 96983/96983 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4811 event pairs, 63 based on Foata normal form. 2/1012 useless extension candidates. Maximal degree in co-relation 8440. Up to 950 conditions per place. [2024-06-20 18:24:07,793 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 190 selfloop transitions, 21 changer transitions 0/213 dead transitions. [2024-06-20 18:24:07,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 213 transitions, 2753 flow [2024-06-20 18:24:07,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:24:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:24:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-20 18:24:07,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154 [2024-06-20 18:24:07,796 INFO L175 Difference]: Start difference. First operand has 212 places, 196 transitions, 2263 flow. Second operand 9 states and 115 transitions. [2024-06-20 18:24:07,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 213 transitions, 2753 flow [2024-06-20 18:24:07,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 213 transitions, 2685 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-20 18:24:07,960 INFO L231 Difference]: Finished difference. Result has 216 places, 199 transitions, 2278 flow [2024-06-20 18:24:07,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2278, PETRI_PLACES=216, PETRI_TRANSITIONS=199} [2024-06-20 18:24:07,961 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 186 predicate places. [2024-06-20 18:24:07,961 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 199 transitions, 2278 flow [2024-06-20 18:24:07,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:07,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:24:07,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:24:07,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 18:24:07,962 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-20 18:24:07,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:24:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2133856305, now seen corresponding path program 6 times [2024-06-20 18:24:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:24:07,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69641430] [2024-06-20 18:24:07,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:24:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:24:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:24:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:24:15,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:24:15,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69641430] [2024-06-20 18:24:15,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69641430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:24:15,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:24:15,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:24:15,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637442775] [2024-06-20 18:24:15,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:24:15,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:24:15,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:24:15,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:24:15,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:24:15,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:24:15,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 199 transitions, 2278 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:15,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:24:15,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:24:15,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:24:16,332 INFO L124 PetriNetUnfolderBase]: 583/1003 cut-off events. [2024-06-20 18:24:16,333 INFO L125 PetriNetUnfolderBase]: For 95916/95916 co-relation queries the response was YES. [2024-06-20 18:24:16,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8328 conditions, 1003 events. 583/1003 cut-off events. For 95916/95916 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4768 event pairs, 63 based on Foata normal form. 3/1004 useless extension candidates. Maximal degree in co-relation 8226. Up to 905 conditions per place. [2024-06-20 18:24:16,343 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 183 selfloop transitions, 31 changer transitions 0/216 dead transitions. [2024-06-20 18:24:16,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 216 transitions, 2756 flow [2024-06-20 18:24:16,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:24:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:24:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-20 18:24:16,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967741935483871 [2024-06-20 18:24:16,345 INFO L175 Difference]: Start difference. First operand has 216 places, 199 transitions, 2278 flow. Second operand 10 states and 123 transitions. [2024-06-20 18:24:16,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 216 transitions, 2756 flow [2024-06-20 18:24:16,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 216 transitions, 2694 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-20 18:24:16,528 INFO L231 Difference]: Finished difference. Result has 220 places, 199 transitions, 2284 flow [2024-06-20 18:24:16,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2216, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2284, PETRI_PLACES=220, PETRI_TRANSITIONS=199} [2024-06-20 18:24:16,529 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 190 predicate places. [2024-06-20 18:24:16,529 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 199 transitions, 2284 flow [2024-06-20 18:24:16,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:16,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:24:16,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:24:16,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 18:24:16,530 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-20 18:24:16,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:24:16,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1979478037, now seen corresponding path program 9 times [2024-06-20 18:24:16,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:24:16,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652008763] [2024-06-20 18:24:16,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:24:16,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:24:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:24:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:24:23,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:24:23,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652008763] [2024-06-20 18:24:23,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652008763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:24:23,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:24:23,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:24:23,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684819803] [2024-06-20 18:24:23,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:24:23,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:24:23,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:24:23,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:24:23,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:24:23,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:24:23,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 199 transitions, 2284 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:23,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:24:23,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:24:23,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:24:24,020 INFO L124 PetriNetUnfolderBase]: 579/997 cut-off events. [2024-06-20 18:24:24,020 INFO L125 PetriNetUnfolderBase]: For 93142/93142 co-relation queries the response was YES. [2024-06-20 18:24:24,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8217 conditions, 997 events. 579/997 cut-off events. For 93142/93142 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4713 event pairs, 59 based on Foata normal form. 2/997 useless extension candidates. Maximal degree in co-relation 8114. Up to 899 conditions per place. [2024-06-20 18:24:24,030 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 184 selfloop transitions, 30 changer transitions 0/216 dead transitions. [2024-06-20 18:24:24,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 216 transitions, 2762 flow [2024-06-20 18:24:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:24:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:24:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-20 18:24:24,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-20 18:24:24,032 INFO L175 Difference]: Start difference. First operand has 220 places, 199 transitions, 2284 flow. Second operand 10 states and 122 transitions. [2024-06-20 18:24:24,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 216 transitions, 2762 flow [2024-06-20 18:24:24,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 216 transitions, 2645 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-20 18:24:24,279 INFO L231 Difference]: Finished difference. Result has 220 places, 199 transitions, 2232 flow [2024-06-20 18:24:24,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2167, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2232, PETRI_PLACES=220, PETRI_TRANSITIONS=199} [2024-06-20 18:24:24,280 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 190 predicate places. [2024-06-20 18:24:24,280 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 199 transitions, 2232 flow [2024-06-20 18:24:24,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:24,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:24:24,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:24:24,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 18:24:24,280 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-20 18:24:24,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:24:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash 164205519, now seen corresponding path program 7 times [2024-06-20 18:24:24,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:24:24,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193244932] [2024-06-20 18:24:24,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:24:24,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:24:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:24:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:24:31,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:24:31,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193244932] [2024-06-20 18:24:31,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193244932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:24:31,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:24:31,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:24:31,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047216612] [2024-06-20 18:24:31,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:24:31,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:24:31,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:24:31,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:24:31,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:24:31,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:24:31,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 199 transitions, 2232 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:31,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:24:31,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:24:31,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:24:31,772 INFO L124 PetriNetUnfolderBase]: 588/1012 cut-off events. [2024-06-20 18:24:31,772 INFO L125 PetriNetUnfolderBase]: For 97851/97851 co-relation queries the response was YES. [2024-06-20 18:24:31,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8286 conditions, 1012 events. 588/1012 cut-off events. For 97851/97851 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4812 event pairs, 71 based on Foata normal form. 3/1013 useless extension candidates. Maximal degree in co-relation 8183. Up to 944 conditions per place. [2024-06-20 18:24:31,781 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 191 selfloop transitions, 22 changer transitions 0/215 dead transitions. [2024-06-20 18:24:31,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 215 transitions, 2745 flow [2024-06-20 18:24:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:24:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:24:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-20 18:24:31,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-20 18:24:31,782 INFO L175 Difference]: Start difference. First operand has 220 places, 199 transitions, 2232 flow. Second operand 9 states and 107 transitions. [2024-06-20 18:24:31,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 215 transitions, 2745 flow [2024-06-20 18:24:31,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 2677 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 18:24:31,968 INFO L231 Difference]: Finished difference. Result has 220 places, 202 transitions, 2269 flow [2024-06-20 18:24:31,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2164, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2269, PETRI_PLACES=220, PETRI_TRANSITIONS=202} [2024-06-20 18:24:31,969 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 190 predicate places. [2024-06-20 18:24:31,969 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 202 transitions, 2269 flow [2024-06-20 18:24:31,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:31,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:24:31,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:24:31,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-20 18:24:31,970 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-20 18:24:31,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:24:31,970 INFO L85 PathProgramCache]: Analyzing trace with hash -590999897, now seen corresponding path program 10 times [2024-06-20 18:24:31,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:24:31,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415384102] [2024-06-20 18:24:31,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:24:31,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:24:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:24:39,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-20 18:24:39,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:24:39,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415384102] [2024-06-20 18:24:39,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415384102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:24:39,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:24:39,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:24:39,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412690877] [2024-06-20 18:24:39,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:24:39,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:24:39,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:24:39,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:24:39,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:24:39,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:24:39,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 202 transitions, 2269 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:39,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:24:39,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:24:39,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:24:39,910 INFO L124 PetriNetUnfolderBase]: 620/1064 cut-off events. [2024-06-20 18:24:39,910 INFO L125 PetriNetUnfolderBase]: For 111668/111668 co-relation queries the response was YES. [2024-06-20 18:24:39,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8956 conditions, 1064 events. 620/1064 cut-off events. For 111668/111668 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5129 event pairs, 71 based on Foata normal form. 4/1066 useless extension candidates. Maximal degree in co-relation 8852. Up to 950 conditions per place. [2024-06-20 18:24:39,923 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 194 selfloop transitions, 28 changer transitions 0/224 dead transitions. [2024-06-20 18:24:39,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 224 transitions, 3005 flow [2024-06-20 18:24:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:24:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:24:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-20 18:24:39,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-20 18:24:39,925 INFO L175 Difference]: Start difference. First operand has 220 places, 202 transitions, 2269 flow. Second operand 10 states and 119 transitions. [2024-06-20 18:24:39,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 224 transitions, 3005 flow [2024-06-20 18:24:40,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 224 transitions, 2935 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-20 18:24:40,162 INFO L231 Difference]: Finished difference. Result has 222 places, 207 transitions, 2362 flow [2024-06-20 18:24:40,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2201, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2362, PETRI_PLACES=222, PETRI_TRANSITIONS=207} [2024-06-20 18:24:40,162 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 192 predicate places. [2024-06-20 18:24:40,162 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 207 transitions, 2362 flow [2024-06-20 18:24:40,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:40,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:24:40,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:24:40,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-20 18:24:40,163 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-20 18:24:40,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:24:40,163 INFO L85 PathProgramCache]: Analyzing trace with hash -597429173, now seen corresponding path program 8 times [2024-06-20 18:24:40,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:24:40,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460222002] [2024-06-20 18:24:40,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:24:40,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:24:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:24:46,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:24:46,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:24:46,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460222002] [2024-06-20 18:24:46,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460222002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:24:46,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:24:46,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:24:46,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846858938] [2024-06-20 18:24:46,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:24:46,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:24:46,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:24:46,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:24:46,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:24:46,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:24:46,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 207 transitions, 2362 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:46,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:24:46,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:24:46,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:24:47,054 INFO L124 PetriNetUnfolderBase]: 623/1069 cut-off events. [2024-06-20 18:24:47,055 INFO L125 PetriNetUnfolderBase]: For 105391/105391 co-relation queries the response was YES. [2024-06-20 18:24:47,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9030 conditions, 1069 events. 623/1069 cut-off events. For 105391/105391 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5157 event pairs, 72 based on Foata normal form. 1/1068 useless extension candidates. Maximal degree in co-relation 8926. Up to 939 conditions per place. [2024-06-20 18:24:47,065 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 180 selfloop transitions, 39 changer transitions 0/221 dead transitions. [2024-06-20 18:24:47,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 221 transitions, 2994 flow [2024-06-20 18:24:47,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:24:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:24:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-20 18:24:47,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-20 18:24:47,067 INFO L175 Difference]: Start difference. First operand has 222 places, 207 transitions, 2362 flow. Second operand 9 states and 109 transitions. [2024-06-20 18:24:47,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 221 transitions, 2994 flow [2024-06-20 18:24:47,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 221 transitions, 2914 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-20 18:24:47,290 INFO L231 Difference]: Finished difference. Result has 225 places, 209 transitions, 2401 flow [2024-06-20 18:24:47,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2282, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2401, PETRI_PLACES=225, PETRI_TRANSITIONS=209} [2024-06-20 18:24:47,290 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 195 predicate places. [2024-06-20 18:24:47,290 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 209 transitions, 2401 flow [2024-06-20 18:24:47,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:47,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:24:47,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:24:47,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-20 18:24:47,291 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-20 18:24:47,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:24:47,292 INFO L85 PathProgramCache]: Analyzing trace with hash -597428987, now seen corresponding path program 11 times [2024-06-20 18:24:47,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:24:47,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293039178] [2024-06-20 18:24:47,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:24:47,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:24:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:24:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:24:54,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:24:54,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293039178] [2024-06-20 18:24:54,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293039178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:24:54,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:24:54,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:24:54,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245092637] [2024-06-20 18:24:54,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:24:54,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:24:54,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:24:54,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:24:54,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:24:55,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:24:55,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 209 transitions, 2401 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:55,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:24:55,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:24:55,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:24:55,595 INFO L124 PetriNetUnfolderBase]: 629/1079 cut-off events. [2024-06-20 18:24:55,596 INFO L125 PetriNetUnfolderBase]: For 111316/111316 co-relation queries the response was YES. [2024-06-20 18:24:55,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9147 conditions, 1079 events. 629/1079 cut-off events. For 111316/111316 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5227 event pairs, 65 based on Foata normal form. 2/1079 useless extension candidates. Maximal degree in co-relation 9041. Up to 925 conditions per place. [2024-06-20 18:24:55,605 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 186 selfloop transitions, 41 changer transitions 0/229 dead transitions. [2024-06-20 18:24:55,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 229 transitions, 3142 flow [2024-06-20 18:24:55,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:24:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:24:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-20 18:24:55,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096774193548387 [2024-06-20 18:24:55,606 INFO L175 Difference]: Start difference. First operand has 225 places, 209 transitions, 2401 flow. Second operand 10 states and 127 transitions. [2024-06-20 18:24:55,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 229 transitions, 3142 flow [2024-06-20 18:24:55,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 229 transitions, 2980 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-06-20 18:24:55,818 INFO L231 Difference]: Finished difference. Result has 227 places, 215 transitions, 2474 flow [2024-06-20 18:24:55,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2241, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2474, PETRI_PLACES=227, PETRI_TRANSITIONS=215} [2024-06-20 18:24:55,819 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 197 predicate places. [2024-06-20 18:24:55,819 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 215 transitions, 2474 flow [2024-06-20 18:24:55,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:24:55,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:24:55,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:24:55,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-20 18:24:55,819 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-20 18:24:55,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:24:55,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2097095495, now seen corresponding path program 6 times [2024-06-20 18:24:55,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:24:55,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59730666] [2024-06-20 18:24:55,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:24:55,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:24:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:25:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:25:02,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:25:02,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59730666] [2024-06-20 18:25:02,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59730666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:25:02,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:25:02,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:25:02,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858435391] [2024-06-20 18:25:02,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:25:02,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:25:02,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:25:02,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:25:02,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:25:03,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:25:03,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 215 transitions, 2474 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:03,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:25:03,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:25:03,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:25:03,652 INFO L124 PetriNetUnfolderBase]: 626/1074 cut-off events. [2024-06-20 18:25:03,652 INFO L125 PetriNetUnfolderBase]: For 106304/106304 co-relation queries the response was YES. [2024-06-20 18:25:03,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8965 conditions, 1074 events. 626/1074 cut-off events. For 106304/106304 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5186 event pairs, 86 based on Foata normal form. 2/1074 useless extension candidates. Maximal degree in co-relation 8859. Up to 1045 conditions per place. [2024-06-20 18:25:03,666 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 207 selfloop transitions, 16 changer transitions 0/225 dead transitions. [2024-06-20 18:25:03,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 225 transitions, 2942 flow [2024-06-20 18:25:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:25:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:25:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-20 18:25:03,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-20 18:25:03,668 INFO L175 Difference]: Start difference. First operand has 227 places, 215 transitions, 2474 flow. Second operand 10 states and 115 transitions. [2024-06-20 18:25:03,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 225 transitions, 2942 flow [2024-06-20 18:25:03,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 225 transitions, 2853 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-20 18:25:03,986 INFO L231 Difference]: Finished difference. Result has 231 places, 215 transitions, 2421 flow [2024-06-20 18:25:03,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2385, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2421, PETRI_PLACES=231, PETRI_TRANSITIONS=215} [2024-06-20 18:25:03,987 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places. [2024-06-20 18:25:03,987 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 215 transitions, 2421 flow [2024-06-20 18:25:03,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:03,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:25:03,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:25:03,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-20 18:25:03,988 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-20 18:25:03,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:25:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash -597256007, now seen corresponding path program 12 times [2024-06-20 18:25:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:25:03,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909136646] [2024-06-20 18:25:03,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:25:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:25:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:25:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:25:13,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:25:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909136646] [2024-06-20 18:25:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909136646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:25:13,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:25:13,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:25:13,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684402151] [2024-06-20 18:25:13,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:25:13,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:25:13,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:25:13,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:25:13,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:25:13,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:25:13,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 215 transitions, 2421 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:13,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:25:13,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:25:13,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:25:14,420 INFO L124 PetriNetUnfolderBase]: 642/1100 cut-off events. [2024-06-20 18:25:14,420 INFO L125 PetriNetUnfolderBase]: For 113932/113932 co-relation queries the response was YES. [2024-06-20 18:25:14,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9260 conditions, 1100 events. 642/1100 cut-off events. For 113932/113932 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5347 event pairs, 68 based on Foata normal form. 2/1100 useless extension candidates. Maximal degree in co-relation 9152. Up to 935 conditions per place. [2024-06-20 18:25:14,431 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 192 selfloop transitions, 41 changer transitions 0/235 dead transitions. [2024-06-20 18:25:14,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 235 transitions, 3279 flow [2024-06-20 18:25:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:25:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:25:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-20 18:25:14,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42258064516129035 [2024-06-20 18:25:14,433 INFO L175 Difference]: Start difference. First operand has 231 places, 215 transitions, 2421 flow. Second operand 10 states and 131 transitions. [2024-06-20 18:25:14,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 235 transitions, 3279 flow [2024-06-20 18:25:14,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 235 transitions, 3122 flow, removed 12 selfloop flow, removed 14 redundant places. [2024-06-20 18:25:14,679 INFO L231 Difference]: Finished difference. Result has 227 places, 219 transitions, 2435 flow [2024-06-20 18:25:14,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2264, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2435, PETRI_PLACES=227, PETRI_TRANSITIONS=219} [2024-06-20 18:25:14,680 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 197 predicate places. [2024-06-20 18:25:14,680 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 219 transitions, 2435 flow [2024-06-20 18:25:14,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:14,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:25:14,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:25:14,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-20 18:25:14,681 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-20 18:25:14,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:25:14,681 INFO L85 PathProgramCache]: Analyzing trace with hash -597256193, now seen corresponding path program 9 times [2024-06-20 18:25:14,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:25:14,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901253705] [2024-06-20 18:25:14,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:25:14,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:25:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:25:21,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-20 18:25:21,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:25:21,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901253705] [2024-06-20 18:25:21,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901253705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:25:21,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:25:21,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:25:21,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24530033] [2024-06-20 18:25:21,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:25:21,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:25:21,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:25:21,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:25:21,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:25:21,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:25:21,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 219 transitions, 2435 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:21,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:25:21,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:25:21,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:25:21,813 INFO L124 PetriNetUnfolderBase]: 645/1105 cut-off events. [2024-06-20 18:25:21,814 INFO L125 PetriNetUnfolderBase]: For 114332/114332 co-relation queries the response was YES. [2024-06-20 18:25:21,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9275 conditions, 1105 events. 645/1105 cut-off events. For 114332/114332 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5391 event pairs, 73 based on Foata normal form. 1/1104 useless extension candidates. Maximal degree in co-relation 9169. Up to 974 conditions per place. [2024-06-20 18:25:21,829 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 191 selfloop transitions, 39 changer transitions 0/232 dead transitions. [2024-06-20 18:25:21,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 232 transitions, 3085 flow [2024-06-20 18:25:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:25:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:25:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-20 18:25:21,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-20 18:25:21,843 INFO L175 Difference]: Start difference. First operand has 227 places, 219 transitions, 2435 flow. Second operand 9 states and 109 transitions. [2024-06-20 18:25:21,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 232 transitions, 3085 flow [2024-06-20 18:25:22,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 232 transitions, 2971 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-20 18:25:22,183 INFO L231 Difference]: Finished difference. Result has 228 places, 221 transitions, 2433 flow [2024-06-20 18:25:22,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2321, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2433, PETRI_PLACES=228, PETRI_TRANSITIONS=221} [2024-06-20 18:25:22,184 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 198 predicate places. [2024-06-20 18:25:22,184 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 221 transitions, 2433 flow [2024-06-20 18:25:22,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:22,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:25:22,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:25:22,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-20 18:25:22,184 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-20 18:25:22,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:25:22,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1229418865, now seen corresponding path program 10 times [2024-06-20 18:25:22,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:25:22,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146070998] [2024-06-20 18:25:22,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:25:22,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:25:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:25:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:25:30,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:25:30,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146070998] [2024-06-20 18:25:30,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146070998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:25:30,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:25:30,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:25:30,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228915762] [2024-06-20 18:25:30,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:25:30,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:25:30,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:25:30,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:25:30,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:25:30,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:25:30,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 221 transitions, 2433 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:30,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:25:30,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:25:30,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:25:30,734 INFO L124 PetriNetUnfolderBase]: 639/1096 cut-off events. [2024-06-20 18:25:30,735 INFO L125 PetriNetUnfolderBase]: For 115017/115017 co-relation queries the response was YES. [2024-06-20 18:25:30,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8934 conditions, 1096 events. 639/1096 cut-off events. For 115017/115017 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5338 event pairs, 80 based on Foata normal form. 3/1097 useless extension candidates. Maximal degree in co-relation 8829. Up to 1040 conditions per place. [2024-06-20 18:25:30,747 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 212 selfloop transitions, 19 changer transitions 0/233 dead transitions. [2024-06-20 18:25:30,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 233 transitions, 2931 flow [2024-06-20 18:25:30,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:25:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:25:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-20 18:25:30,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36917562724014336 [2024-06-20 18:25:30,749 INFO L175 Difference]: Start difference. First operand has 228 places, 221 transitions, 2433 flow. Second operand 9 states and 103 transitions. [2024-06-20 18:25:30,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 233 transitions, 2931 flow [2024-06-20 18:25:30,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 233 transitions, 2847 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-20 18:25:30,962 INFO L231 Difference]: Finished difference. Result has 230 places, 221 transitions, 2395 flow [2024-06-20 18:25:30,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2349, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2395, PETRI_PLACES=230, PETRI_TRANSITIONS=221} [2024-06-20 18:25:30,963 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 200 predicate places. [2024-06-20 18:25:30,963 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 221 transitions, 2395 flow [2024-06-20 18:25:30,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:30,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:25:30,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:25:30,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-20 18:25:30,964 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-20 18:25:30,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:25:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash -597249497, now seen corresponding path program 13 times [2024-06-20 18:25:30,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:25:30,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265861423] [2024-06-20 18:25:30,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:25:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:25:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:25:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:25:38,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:25:38,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265861423] [2024-06-20 18:25:38,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265861423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:25:38,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:25:38,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:25:38,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252905473] [2024-06-20 18:25:38,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:25:38,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:25:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:25:38,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:25:38,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:25:38,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:25:38,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 221 transitions, 2395 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:38,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:25:38,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:25:38,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:25:39,149 INFO L124 PetriNetUnfolderBase]: 655/1122 cut-off events. [2024-06-20 18:25:39,149 INFO L125 PetriNetUnfolderBase]: For 117516/117516 co-relation queries the response was YES. [2024-06-20 18:25:39,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9197 conditions, 1122 events. 655/1122 cut-off events. For 117516/117516 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5479 event pairs, 72 based on Foata normal form. 2/1122 useless extension candidates. Maximal degree in co-relation 9092. Up to 859 conditions per place. [2024-06-20 18:25:39,162 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 185 selfloop transitions, 55 changer transitions 0/242 dead transitions. [2024-06-20 18:25:39,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 242 transitions, 3409 flow [2024-06-20 18:25:39,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:25:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:25:39,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-20 18:25:39,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2024-06-20 18:25:39,164 INFO L175 Difference]: Start difference. First operand has 230 places, 221 transitions, 2395 flow. Second operand 10 states and 135 transitions. [2024-06-20 18:25:39,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 242 transitions, 3409 flow [2024-06-20 18:25:39,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 242 transitions, 3294 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-06-20 18:25:39,399 INFO L231 Difference]: Finished difference. Result has 230 places, 225 transitions, 2481 flow [2024-06-20 18:25:39,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2286, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2481, PETRI_PLACES=230, PETRI_TRANSITIONS=225} [2024-06-20 18:25:39,400 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 200 predicate places. [2024-06-20 18:25:39,400 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 225 transitions, 2481 flow [2024-06-20 18:25:39,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:39,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:25:39,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:25:39,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-20 18:25:39,401 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-20 18:25:39,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:25:39,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1229418679, now seen corresponding path program 14 times [2024-06-20 18:25:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:25:39,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830820923] [2024-06-20 18:25:39,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:25:39,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:25:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:25:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:25:46,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:25:46,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830820923] [2024-06-20 18:25:46,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830820923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:25:46,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:25:46,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:25:46,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097785414] [2024-06-20 18:25:46,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:25:46,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:25:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:25:46,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:25:46,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:25:46,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:25:46,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 225 transitions, 2481 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:46,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:25:46,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:25:46,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:25:47,315 INFO L124 PetriNetUnfolderBase]: 667/1142 cut-off events. [2024-06-20 18:25:47,315 INFO L125 PetriNetUnfolderBase]: For 121959/121959 co-relation queries the response was YES. [2024-06-20 18:25:47,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9385 conditions, 1142 events. 667/1142 cut-off events. For 121959/121959 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5610 event pairs, 83 based on Foata normal form. 4/1144 useless extension candidates. Maximal degree in co-relation 9280. Up to 1040 conditions per place. [2024-06-20 18:25:47,330 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 216 selfloop transitions, 27 changer transitions 0/245 dead transitions. [2024-06-20 18:25:47,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 245 transitions, 3257 flow [2024-06-20 18:25:47,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:25:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:25:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-20 18:25:47,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2024-06-20 18:25:47,331 INFO L175 Difference]: Start difference. First operand has 230 places, 225 transitions, 2481 flow. Second operand 10 states and 115 transitions. [2024-06-20 18:25:47,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 245 transitions, 3257 flow [2024-06-20 18:25:47,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 245 transitions, 3064 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-20 18:25:47,684 INFO L231 Difference]: Finished difference. Result has 232 places, 229 transitions, 2440 flow [2024-06-20 18:25:47,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2298, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2440, PETRI_PLACES=232, PETRI_TRANSITIONS=229} [2024-06-20 18:25:47,685 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 202 predicate places. [2024-06-20 18:25:47,685 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 229 transitions, 2440 flow [2024-06-20 18:25:47,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:47,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:25:47,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:25:47,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-20 18:25:47,686 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-20 18:25:47,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:25:47,686 INFO L85 PathProgramCache]: Analyzing trace with hash -590993387, now seen corresponding path program 15 times [2024-06-20 18:25:47,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:25:47,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762420795] [2024-06-20 18:25:47,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:25:47,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:25:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:25:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:25:56,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:25:56,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762420795] [2024-06-20 18:25:56,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762420795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:25:56,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:25:56,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:25:56,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089262432] [2024-06-20 18:25:56,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:25:56,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:25:56,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:25:56,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:25:56,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:25:56,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:25:56,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 229 transitions, 2440 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:56,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:25:56,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:25:56,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:25:57,635 INFO L124 PetriNetUnfolderBase]: 663/1136 cut-off events. [2024-06-20 18:25:57,635 INFO L125 PetriNetUnfolderBase]: For 115261/115261 co-relation queries the response was YES. [2024-06-20 18:25:57,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9033 conditions, 1136 events. 663/1136 cut-off events. For 115261/115261 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5590 event pairs, 82 based on Foata normal form. 2/1136 useless extension candidates. Maximal degree in co-relation 8928. Up to 1059 conditions per place. [2024-06-20 18:25:57,650 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 218 selfloop transitions, 25 changer transitions 0/245 dead transitions. [2024-06-20 18:25:57,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 245 transitions, 2996 flow [2024-06-20 18:25:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:25:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:25:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-20 18:25:57,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096774193548387 [2024-06-20 18:25:57,651 INFO L175 Difference]: Start difference. First operand has 232 places, 229 transitions, 2440 flow. Second operand 10 states and 127 transitions. [2024-06-20 18:25:57,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 245 transitions, 2996 flow [2024-06-20 18:25:57,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 245 transitions, 2847 flow, removed 32 selfloop flow, removed 9 redundant places. [2024-06-20 18:25:57,988 INFO L231 Difference]: Finished difference. Result has 233 places, 230 transitions, 2372 flow [2024-06-20 18:25:57,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2291, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2372, PETRI_PLACES=233, PETRI_TRANSITIONS=230} [2024-06-20 18:25:57,989 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2024-06-20 18:25:57,989 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 230 transitions, 2372 flow [2024-06-20 18:25:57,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:25:57,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:25:57,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:25:57,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-20 18:25:57,990 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-20 18:25:57,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:25:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash -933597211, now seen corresponding path program 2 times [2024-06-20 18:25:57,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:25:57,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705373760] [2024-06-20 18:25:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:25:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:25:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:26:05,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:05,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705373760] [2024-06-20 18:26:05,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705373760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:05,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:05,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:26:05,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378867004] [2024-06-20 18:26:05,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:05,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:26:05,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:05,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:26:05,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:26:05,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:26:05,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 230 transitions, 2372 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:05,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:05,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:26:05,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:06,081 INFO L124 PetriNetUnfolderBase]: 667/1144 cut-off events. [2024-06-20 18:26:06,081 INFO L125 PetriNetUnfolderBase]: For 117147/117147 co-relation queries the response was YES. [2024-06-20 18:26:06,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8967 conditions, 1144 events. 667/1144 cut-off events. For 117147/117147 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5617 event pairs, 92 based on Foata normal form. 2/1144 useless extension candidates. Maximal degree in co-relation 8862. Up to 1110 conditions per place. [2024-06-20 18:26:06,096 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 225 selfloop transitions, 14 changer transitions 0/241 dead transitions. [2024-06-20 18:26:06,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 241 transitions, 2882 flow [2024-06-20 18:26:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:26:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:26:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-20 18:26:06,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637 [2024-06-20 18:26:06,099 INFO L175 Difference]: Start difference. First operand has 233 places, 230 transitions, 2372 flow. Second operand 9 states and 96 transitions. [2024-06-20 18:26:06,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 241 transitions, 2882 flow [2024-06-20 18:26:06,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 241 transitions, 2813 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-20 18:26:06,444 INFO L231 Difference]: Finished difference. Result has 235 places, 231 transitions, 2347 flow [2024-06-20 18:26:06,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2303, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2347, PETRI_PLACES=235, PETRI_TRANSITIONS=231} [2024-06-20 18:26:06,445 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 205 predicate places. [2024-06-20 18:26:06,445 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 231 transitions, 2347 flow [2024-06-20 18:26:06,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:06,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:06,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:06,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-20 18:26:06,446 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-20 18:26:06,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:06,446 INFO L85 PathProgramCache]: Analyzing trace with hash 460182823, now seen corresponding path program 16 times [2024-06-20 18:26:06,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:06,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367730216] [2024-06-20 18:26:06,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:06,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:26:14,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:14,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367730216] [2024-06-20 18:26:14,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367730216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:14,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:14,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:26:14,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973001046] [2024-06-20 18:26:14,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:14,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:26:14,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:14,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:26:14,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:26:15,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:26:15,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 231 transitions, 2347 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:15,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:15,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:26:15,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:15,652 INFO L124 PetriNetUnfolderBase]: 663/1138 cut-off events. [2024-06-20 18:26:15,653 INFO L125 PetriNetUnfolderBase]: For 116887/116887 co-relation queries the response was YES. [2024-06-20 18:26:15,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8763 conditions, 1138 events. 663/1138 cut-off events. For 116887/116887 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5596 event pairs, 81 based on Foata normal form. 2/1138 useless extension candidates. Maximal degree in co-relation 8657. Up to 1041 conditions per place. [2024-06-20 18:26:15,668 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 216 selfloop transitions, 28 changer transitions 0/246 dead transitions. [2024-06-20 18:26:15,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 246 transitions, 3021 flow [2024-06-20 18:26:15,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:26:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:26:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-20 18:26:15,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-20 18:26:15,671 INFO L175 Difference]: Start difference. First operand has 235 places, 231 transitions, 2347 flow. Second operand 10 states and 126 transitions. [2024-06-20 18:26:15,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 246 transitions, 3021 flow [2024-06-20 18:26:16,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 246 transitions, 2967 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-20 18:26:16,032 INFO L231 Difference]: Finished difference. Result has 238 places, 231 transitions, 2354 flow [2024-06-20 18:26:16,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2293, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2354, PETRI_PLACES=238, PETRI_TRANSITIONS=231} [2024-06-20 18:26:16,033 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2024-06-20 18:26:16,034 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 231 transitions, 2354 flow [2024-06-20 18:26:16,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:16,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:16,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:16,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-20 18:26:16,034 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-20 18:26:16,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:16,035 INFO L85 PathProgramCache]: Analyzing trace with hash -590753819, now seen corresponding path program 3 times [2024-06-20 18:26:16,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:16,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650765789] [2024-06-20 18:26:16,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:16,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:22,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-20 18:26:22,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650765789] [2024-06-20 18:26:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650765789] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:22,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:22,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:26:22,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767937025] [2024-06-20 18:26:22,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:22,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:26:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:22,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:26:22,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:26:22,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:26:22,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 231 transitions, 2354 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:22,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:22,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:26:22,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:23,068 INFO L124 PetriNetUnfolderBase]: 667/1146 cut-off events. [2024-06-20 18:26:23,068 INFO L125 PetriNetUnfolderBase]: For 120178/120178 co-relation queries the response was YES. [2024-06-20 18:26:23,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8851 conditions, 1146 events. 667/1146 cut-off events. For 120178/120178 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5647 event pairs, 87 based on Foata normal form. 2/1146 useless extension candidates. Maximal degree in co-relation 8744. Up to 1105 conditions per place. [2024-06-20 18:26:23,083 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 226 selfloop transitions, 17 changer transitions 0/245 dead transitions. [2024-06-20 18:26:23,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 245 transitions, 2899 flow [2024-06-20 18:26:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:26:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:26:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-20 18:26:23,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-20 18:26:23,085 INFO L175 Difference]: Start difference. First operand has 238 places, 231 transitions, 2354 flow. Second operand 9 states and 110 transitions. [2024-06-20 18:26:23,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 245 transitions, 2899 flow [2024-06-20 18:26:23,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 245 transitions, 2848 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-20 18:26:23,425 INFO L231 Difference]: Finished difference. Result has 241 places, 234 transitions, 2379 flow [2024-06-20 18:26:23,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2303, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2379, PETRI_PLACES=241, PETRI_TRANSITIONS=234} [2024-06-20 18:26:23,426 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2024-06-20 18:26:23,426 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 234 transitions, 2379 flow [2024-06-20 18:26:23,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:23,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:23,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:23,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-20 18:26:23,427 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-20 18:26:23,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:23,427 INFO L85 PathProgramCache]: Analyzing trace with hash -933953401, now seen corresponding path program 4 times [2024-06-20 18:26:23,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:23,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258400186] [2024-06-20 18:26:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:23,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:26:29,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:29,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258400186] [2024-06-20 18:26:29,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258400186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:29,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:29,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:26:29,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670169032] [2024-06-20 18:26:29,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:29,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:26:29,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:29,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:26:29,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:26:29,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-20 18:26:29,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 234 transitions, 2379 flow. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:29,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:29,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-20 18:26:29,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:30,417 INFO L124 PetriNetUnfolderBase]: 671/1154 cut-off events. [2024-06-20 18:26:30,417 INFO L125 PetriNetUnfolderBase]: For 123953/123953 co-relation queries the response was YES. [2024-06-20 18:26:30,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8918 conditions, 1154 events. 671/1154 cut-off events. For 123953/123953 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5722 event pairs, 91 based on Foata normal form. 2/1154 useless extension candidates. Maximal degree in co-relation 8809. Up to 1117 conditions per place. [2024-06-20 18:26:30,430 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 226 selfloop transitions, 17 changer transitions 0/245 dead transitions. [2024-06-20 18:26:30,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 245 transitions, 2903 flow [2024-06-20 18:26:30,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:26:30,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:26:30,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2024-06-20 18:26:30,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31899641577060933 [2024-06-20 18:26:30,432 INFO L175 Difference]: Start difference. First operand has 241 places, 234 transitions, 2379 flow. Second operand 9 states and 89 transitions. [2024-06-20 18:26:30,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 245 transitions, 2903 flow [2024-06-20 18:26:30,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 245 transitions, 2859 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 18:26:30,699 INFO L231 Difference]: Finished difference. Result has 244 places, 235 transitions, 2390 flow [2024-06-20 18:26:30,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2335, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2390, PETRI_PLACES=244, PETRI_TRANSITIONS=235} [2024-06-20 18:26:30,700 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2024-06-20 18:26:30,700 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 235 transitions, 2390 flow [2024-06-20 18:26:30,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:30,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:30,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:30,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-20 18:26:30,700 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-20 18:26:30,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:30,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1229172601, now seen corresponding path program 5 times [2024-06-20 18:26:30,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:30,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752933642] [2024-06-20 18:26:30,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:30,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:26:36,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:36,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752933642] [2024-06-20 18:26:36,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752933642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:36,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:36,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:26:36,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745180884] [2024-06-20 18:26:36,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:36,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:26:36,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:36,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:26:36,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:26:36,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:26:36,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 235 transitions, 2390 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:36,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:36,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:26:36,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:37,341 INFO L124 PetriNetUnfolderBase]: 668/1149 cut-off events. [2024-06-20 18:26:37,341 INFO L125 PetriNetUnfolderBase]: For 121768/121768 co-relation queries the response was YES. [2024-06-20 18:26:37,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8777 conditions, 1149 events. 668/1149 cut-off events. For 121768/121768 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5681 event pairs, 96 based on Foata normal form. 2/1149 useless extension candidates. Maximal degree in co-relation 8667. Up to 1120 conditions per place. [2024-06-20 18:26:37,357 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 230 selfloop transitions, 14 changer transitions 0/246 dead transitions. [2024-06-20 18:26:37,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 246 transitions, 2918 flow [2024-06-20 18:26:37,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 18:26:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 18:26:37,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-20 18:26:37,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-20 18:26:37,359 INFO L175 Difference]: Start difference. First operand has 244 places, 235 transitions, 2390 flow. Second operand 9 states and 106 transitions. [2024-06-20 18:26:37,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 246 transitions, 2918 flow [2024-06-20 18:26:37,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 246 transitions, 2875 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-20 18:26:37,733 INFO L231 Difference]: Finished difference. Result has 246 places, 236 transitions, 2395 flow [2024-06-20 18:26:37,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2347, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2395, PETRI_PLACES=246, PETRI_TRANSITIONS=236} [2024-06-20 18:26:37,734 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2024-06-20 18:26:37,734 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 236 transitions, 2395 flow [2024-06-20 18:26:37,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:37,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:37,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:37,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-20 18:26:37,735 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-20 18:26:37,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:37,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1820776827, now seen corresponding path program 17 times [2024-06-20 18:26:37,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:37,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579665241] [2024-06-20 18:26:37,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:37,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:26:47,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:47,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579665241] [2024-06-20 18:26:47,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579665241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:47,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:47,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:26:47,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795735787] [2024-06-20 18:26:47,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:47,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:26:47,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:47,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:26:47,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:26:47,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:26:47,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 236 transitions, 2395 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:47,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:47,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:26:47,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:48,290 INFO L124 PetriNetUnfolderBase]: 664/1143 cut-off events. [2024-06-20 18:26:48,291 INFO L125 PetriNetUnfolderBase]: For 119268/119268 co-relation queries the response was YES. [2024-06-20 18:26:48,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8603 conditions, 1143 events. 664/1143 cut-off events. For 119268/119268 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5639 event pairs, 88 based on Foata normal form. 2/1143 useless extension candidates. Maximal degree in co-relation 8492. Up to 1096 conditions per place. [2024-06-20 18:26:48,306 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 228 selfloop transitions, 20 changer transitions 0/250 dead transitions. [2024-06-20 18:26:48,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 250 transitions, 2967 flow [2024-06-20 18:26:48,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:26:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:26:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-20 18:26:48,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-20 18:26:48,308 INFO L175 Difference]: Start difference. First operand has 246 places, 236 transitions, 2395 flow. Second operand 10 states and 109 transitions. [2024-06-20 18:26:48,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 250 transitions, 2967 flow [2024-06-20 18:26:48,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 250 transitions, 2878 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-20 18:26:48,702 INFO L231 Difference]: Finished difference. Result has 246 places, 238 transitions, 2399 flow [2024-06-20 18:26:48,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2306, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2399, PETRI_PLACES=246, PETRI_TRANSITIONS=238} [2024-06-20 18:26:48,703 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2024-06-20 18:26:48,703 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 238 transitions, 2399 flow [2024-06-20 18:26:48,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:48,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:48,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:48,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-20 18:26:48,704 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-20 18:26:48,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:48,704 INFO L85 PathProgramCache]: Analyzing trace with hash -200609356, now seen corresponding path program 1 times [2024-06-20 18:26:48,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:48,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435468017] [2024-06-20 18:26:48,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:48,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:26:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:26:57,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:26:57,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435468017] [2024-06-20 18:26:57,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435468017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:26:57,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:26:57,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 18:26:57,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2653942] [2024-06-20 18:26:57,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:26:57,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 18:26:57,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:26:57,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 18:26:57,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-20 18:26:57,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:26:57,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 238 transitions, 2399 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:57,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:26:57,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:26:57,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:26:58,679 INFO L124 PetriNetUnfolderBase]: 675/1164 cut-off events. [2024-06-20 18:26:58,680 INFO L125 PetriNetUnfolderBase]: For 127809/127809 co-relation queries the response was YES. [2024-06-20 18:26:58,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8847 conditions, 1164 events. 675/1164 cut-off events. For 127809/127809 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5808 event pairs, 78 based on Foata normal form. 2/1164 useless extension candidates. Maximal degree in co-relation 8737. Up to 1032 conditions per place. [2024-06-20 18:26:58,698 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 238 selfloop transitions, 27 changer transitions 0/267 dead transitions. [2024-06-20 18:26:58,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 267 transitions, 3173 flow [2024-06-20 18:26:58,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 18:26:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 18:26:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2024-06-20 18:26:58,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-20 18:26:58,700 INFO L175 Difference]: Start difference. First operand has 246 places, 238 transitions, 2399 flow. Second operand 12 states and 140 transitions. [2024-06-20 18:26:58,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 267 transitions, 3173 flow [2024-06-20 18:26:59,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 267 transitions, 3080 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-20 18:26:59,186 INFO L231 Difference]: Finished difference. Result has 249 places, 240 transitions, 2386 flow [2024-06-20 18:26:59,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2306, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2386, PETRI_PLACES=249, PETRI_TRANSITIONS=240} [2024-06-20 18:26:59,187 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 219 predicate places. [2024-06-20 18:26:59,187 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 240 transitions, 2386 flow [2024-06-20 18:26:59,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:26:59,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:26:59,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:26:59,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-20 18:26:59,188 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-20 18:26:59,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:26:59,188 INFO L85 PathProgramCache]: Analyzing trace with hash -198731686, now seen corresponding path program 2 times [2024-06-20 18:26:59,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:26:59,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589837862] [2024-06-20 18:26:59,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:26:59,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:26:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:27:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:27:07,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:27:07,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589837862] [2024-06-20 18:27:07,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589837862] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:27:07,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:27:07,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 18:27:07,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99747410] [2024-06-20 18:27:07,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:27:07,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 18:27:07,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:27:07,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 18:27:07,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 18:27:07,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:27:07,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 240 transitions, 2386 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:07,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:27:07,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:27:07,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:27:08,344 INFO L124 PetriNetUnfolderBase]: 679/1172 cut-off events. [2024-06-20 18:27:08,345 INFO L125 PetriNetUnfolderBase]: For 131742/131742 co-relation queries the response was YES. [2024-06-20 18:27:08,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8861 conditions, 1172 events. 679/1172 cut-off events. For 131742/131742 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5857 event pairs, 89 based on Foata normal form. 2/1172 useless extension candidates. Maximal degree in co-relation 8751. Up to 1097 conditions per place. [2024-06-20 18:27:08,360 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 236 selfloop transitions, 28 changer transitions 0/266 dead transitions. [2024-06-20 18:27:08,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 266 transitions, 2994 flow [2024-06-20 18:27:08,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-20 18:27:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-20 18:27:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2024-06-20 18:27:08,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3573200992555831 [2024-06-20 18:27:08,362 INFO L175 Difference]: Start difference. First operand has 249 places, 240 transitions, 2386 flow. Second operand 13 states and 144 transitions. [2024-06-20 18:27:08,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 266 transitions, 2994 flow [2024-06-20 18:27:08,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 266 transitions, 2944 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-20 18:27:08,835 INFO L231 Difference]: Finished difference. Result has 254 places, 241 transitions, 2412 flow [2024-06-20 18:27:08,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2340, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2412, PETRI_PLACES=254, PETRI_TRANSITIONS=241} [2024-06-20 18:27:08,836 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 224 predicate places. [2024-06-20 18:27:08,836 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 241 transitions, 2412 flow [2024-06-20 18:27:08,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:08,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:27:08,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:27:08,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-20 18:27:08,837 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-20 18:27:08,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:27:08,837 INFO L85 PathProgramCache]: Analyzing trace with hash 829027815, now seen corresponding path program 1 times [2024-06-20 18:27:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:27:08,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382549164] [2024-06-20 18:27:08,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:27:08,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:27:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:27:16,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-20 18:27:16,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:27:16,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382549164] [2024-06-20 18:27:16,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382549164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:27:16,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:27:16,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:27:16,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670500198] [2024-06-20 18:27:16,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:27:16,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:27:16,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:27:16,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:27:16,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:27:17,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:27:17,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 241 transitions, 2412 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-20 18:27:17,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:27:17,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:27:17,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:27:17,845 INFO L124 PetriNetUnfolderBase]: 685/1182 cut-off events. [2024-06-20 18:27:17,845 INFO L125 PetriNetUnfolderBase]: For 135464/135464 co-relation queries the response was YES. [2024-06-20 18:27:17,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8972 conditions, 1182 events. 685/1182 cut-off events. For 135464/135464 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5925 event pairs, 85 based on Foata normal form. 2/1182 useless extension candidates. Maximal degree in co-relation 8860. Up to 1083 conditions per place. [2024-06-20 18:27:17,861 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 238 selfloop transitions, 30 changer transitions 0/270 dead transitions. [2024-06-20 18:27:17,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 270 transitions, 3212 flow [2024-06-20 18:27:17,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 18:27:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 18:27:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 156 transitions. [2024-06-20 18:27:17,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-20 18:27:17,862 INFO L175 Difference]: Start difference. First operand has 254 places, 241 transitions, 2412 flow. Second operand 12 states and 156 transitions. [2024-06-20 18:27:17,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 270 transitions, 3212 flow [2024-06-20 18:27:18,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 270 transitions, 3155 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-20 18:27:18,326 INFO L231 Difference]: Finished difference. Result has 255 places, 243 transitions, 2450 flow [2024-06-20 18:27:18,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2355, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2450, PETRI_PLACES=255, PETRI_TRANSITIONS=243} [2024-06-20 18:27:18,326 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places. [2024-06-20 18:27:18,327 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 243 transitions, 2450 flow [2024-06-20 18:27:18,327 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-20 18:27:18,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:27:18,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:27:18,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-20 18:27:18,327 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-20 18:27:18,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:27:18,330 INFO L85 PathProgramCache]: Analyzing trace with hash 829023940, now seen corresponding path program 3 times [2024-06-20 18:27:18,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:27:18,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020151873] [2024-06-20 18:27:18,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:27:18,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:27:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:27:27,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-20 18:27:27,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:27:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020151873] [2024-06-20 18:27:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020151873] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:27:27,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:27:27,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 18:27:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222269133] [2024-06-20 18:27:27,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:27:27,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 18:27:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:27:27,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 18:27:27,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-20 18:27:27,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:27:27,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 243 transitions, 2450 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:27,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:27:27,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:27:27,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:27:28,219 INFO L124 PetriNetUnfolderBase]: 693/1198 cut-off events. [2024-06-20 18:27:28,219 INFO L125 PetriNetUnfolderBase]: For 138871/138871 co-relation queries the response was YES. [2024-06-20 18:27:28,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9091 conditions, 1198 events. 693/1198 cut-off events. For 138871/138871 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6029 event pairs, 88 based on Foata normal form. 2/1198 useless extension candidates. Maximal degree in co-relation 8978. Up to 1113 conditions per place. [2024-06-20 18:27:28,236 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 241 selfloop transitions, 27 changer transitions 0/270 dead transitions. [2024-06-20 18:27:28,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 270 transitions, 3070 flow [2024-06-20 18:27:28,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 18:27:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 18:27:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2024-06-20 18:27:28,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-20 18:27:28,239 INFO L175 Difference]: Start difference. First operand has 255 places, 243 transitions, 2450 flow. Second operand 12 states and 140 transitions. [2024-06-20 18:27:28,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 270 transitions, 3070 flow [2024-06-20 18:27:28,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 270 transitions, 3006 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-20 18:27:28,742 INFO L231 Difference]: Finished difference. Result has 259 places, 245 transitions, 2468 flow [2024-06-20 18:27:28,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2386, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2468, PETRI_PLACES=259, PETRI_TRANSITIONS=245} [2024-06-20 18:27:28,743 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places. [2024-06-20 18:27:28,743 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 245 transitions, 2468 flow [2024-06-20 18:27:28,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:28,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:27:28,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:27:28,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-20 18:27:28,744 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-20 18:27:28,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:27:28,745 INFO L85 PathProgramCache]: Analyzing trace with hash 56394599, now seen corresponding path program 2 times [2024-06-20 18:27:28,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:27:28,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234024679] [2024-06-20 18:27:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:27:28,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:27:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:27:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:27:36,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:27:36,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234024679] [2024-06-20 18:27:36,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234024679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:27:36,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:27:36,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 18:27:36,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609357418] [2024-06-20 18:27:36,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:27:36,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 18:27:36,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:27:36,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 18:27:36,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-20 18:27:37,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:27:37,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 245 transitions, 2468 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:37,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:27:37,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:27:37,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:27:37,820 INFO L124 PetriNetUnfolderBase]: 699/1208 cut-off events. [2024-06-20 18:27:37,820 INFO L125 PetriNetUnfolderBase]: For 142796/142796 co-relation queries the response was YES. [2024-06-20 18:27:37,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9184 conditions, 1208 events. 699/1208 cut-off events. For 142796/142796 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6111 event pairs, 87 based on Foata normal form. 2/1208 useless extension candidates. Maximal degree in co-relation 9069. Up to 1141 conditions per place. [2024-06-20 18:27:37,833 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 246 selfloop transitions, 22 changer transitions 0/270 dead transitions. [2024-06-20 18:27:37,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 270 transitions, 3260 flow [2024-06-20 18:27:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:27:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:27:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-20 18:27:37,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-20 18:27:37,834 INFO L175 Difference]: Start difference. First operand has 259 places, 245 transitions, 2468 flow. Second operand 11 states and 129 transitions. [2024-06-20 18:27:37,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 270 transitions, 3260 flow [2024-06-20 18:27:38,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 270 transitions, 3206 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-20 18:27:38,200 INFO L231 Difference]: Finished difference. Result has 261 places, 247 transitions, 2497 flow [2024-06-20 18:27:38,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2414, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2497, PETRI_PLACES=261, PETRI_TRANSITIONS=247} [2024-06-20 18:27:38,201 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 231 predicate places. [2024-06-20 18:27:38,201 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 247 transitions, 2497 flow [2024-06-20 18:27:38,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:38,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:27:38,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:27:38,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-20 18:27:38,201 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-20 18:27:38,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:27:38,202 INFO L85 PathProgramCache]: Analyzing trace with hash 915719625, now seen corresponding path program 3 times [2024-06-20 18:27:38,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:27:38,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646387059] [2024-06-20 18:27:38,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:27:38,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:27:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:27:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:27:44,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:27:44,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646387059] [2024-06-20 18:27:44,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646387059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:27:44,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:27:44,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:27:44,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093214525] [2024-06-20 18:27:44,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:27:44,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:27:44,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:27:44,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:27:44,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:27:45,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:27:45,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 247 transitions, 2497 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-20 18:27:45,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:27:45,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:27:45,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:27:45,856 INFO L124 PetriNetUnfolderBase]: 695/1202 cut-off events. [2024-06-20 18:27:45,857 INFO L125 PetriNetUnfolderBase]: For 139783/139783 co-relation queries the response was YES. [2024-06-20 18:27:45,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9034 conditions, 1202 events. 695/1202 cut-off events. For 139783/139783 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6046 event pairs, 86 based on Foata normal form. 2/1202 useless extension candidates. Maximal degree in co-relation 8918. Up to 1123 conditions per place. [2024-06-20 18:27:45,869 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 242 selfloop transitions, 26 changer transitions 0/270 dead transitions. [2024-06-20 18:27:45,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 270 transitions, 3261 flow [2024-06-20 18:27:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:27:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:27:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-20 18:27:45,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41642228739002934 [2024-06-20 18:27:45,870 INFO L175 Difference]: Start difference. First operand has 261 places, 247 transitions, 2497 flow. Second operand 11 states and 142 transitions. [2024-06-20 18:27:45,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 270 transitions, 3261 flow [2024-06-20 18:27:46,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 270 transitions, 3200 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-20 18:27:46,234 INFO L231 Difference]: Finished difference. Result has 264 places, 247 transitions, 2493 flow [2024-06-20 18:27:46,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2436, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2493, PETRI_PLACES=264, PETRI_TRANSITIONS=247} [2024-06-20 18:27:46,235 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 234 predicate places. [2024-06-20 18:27:46,235 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 247 transitions, 2493 flow [2024-06-20 18:27:46,235 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-20 18:27:46,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:27:46,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:27:46,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-20 18:27:46,236 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-20 18:27:46,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:27:46,236 INFO L85 PathProgramCache]: Analyzing trace with hash 528779136, now seen corresponding path program 4 times [2024-06-20 18:27:46,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:27:46,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532824698] [2024-06-20 18:27:46,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:27:46,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:27:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:27:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:27:53,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:27:53,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532824698] [2024-06-20 18:27:53,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532824698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:27:53,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:27:53,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 18:27:53,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939503868] [2024-06-20 18:27:53,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:27:53,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 18:27:53,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:27:53,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 18:27:53,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-20 18:27:54,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:27:54,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 247 transitions, 2493 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:54,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:27:54,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:27:54,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:27:54,818 INFO L124 PetriNetUnfolderBase]: 692/1197 cut-off events. [2024-06-20 18:27:54,818 INFO L125 PetriNetUnfolderBase]: For 136302/136302 co-relation queries the response was YES. [2024-06-20 18:27:54,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8877 conditions, 1197 events. 692/1197 cut-off events. For 136302/136302 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6031 event pairs, 86 based on Foata normal form. 2/1197 useless extension candidates. Maximal degree in co-relation 8760. Up to 1125 conditions per place. [2024-06-20 18:27:54,834 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 244 selfloop transitions, 22 changer transitions 0/268 dead transitions. [2024-06-20 18:27:54,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 268 transitions, 3081 flow [2024-06-20 18:27:54,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:27:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:27:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-20 18:27:54,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36950146627565983 [2024-06-20 18:27:54,836 INFO L175 Difference]: Start difference. First operand has 264 places, 247 transitions, 2493 flow. Second operand 11 states and 126 transitions. [2024-06-20 18:27:54,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 268 transitions, 3081 flow [2024-06-20 18:27:55,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 268 transitions, 2912 flow, removed 7 selfloop flow, removed 15 redundant places. [2024-06-20 18:27:55,337 INFO L231 Difference]: Finished difference. Result has 260 places, 247 transitions, 2372 flow [2024-06-20 18:27:55,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2324, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2372, PETRI_PLACES=260, PETRI_TRANSITIONS=247} [2024-06-20 18:27:55,337 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 230 predicate places. [2024-06-20 18:27:55,337 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 247 transitions, 2372 flow [2024-06-20 18:27:55,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:27:55,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:27:55,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:27:55,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-20 18:27:55,338 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-20 18:27:55,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:27:55,339 INFO L85 PathProgramCache]: Analyzing trace with hash 915869355, now seen corresponding path program 4 times [2024-06-20 18:27:55,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:27:55,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109386524] [2024-06-20 18:27:55,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:27:55,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:27:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:28:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:28:07,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:28:07,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109386524] [2024-06-20 18:28:07,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109386524] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:28:07,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:28:07,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:28:07,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638442104] [2024-06-20 18:28:07,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:28:07,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:28:07,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:28:07,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:28:07,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:28:07,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:28:07,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 247 transitions, 2372 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-20 18:28:07,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:28:07,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:28:07,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:28:08,072 INFO L124 PetriNetUnfolderBase]: 688/1191 cut-off events. [2024-06-20 18:28:08,073 INFO L125 PetriNetUnfolderBase]: For 132195/132195 co-relation queries the response was YES. [2024-06-20 18:28:08,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8628 conditions, 1191 events. 688/1191 cut-off events. For 132195/132195 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6002 event pairs, 85 based on Foata normal form. 2/1191 useless extension candidates. Maximal degree in co-relation 8511. Up to 1094 conditions per place. [2024-06-20 18:28:08,090 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 232 selfloop transitions, 34 changer transitions 0/268 dead transitions. [2024-06-20 18:28:08,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 268 transitions, 2964 flow [2024-06-20 18:28:08,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:28:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:28:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-20 18:28:08,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41055718475073316 [2024-06-20 18:28:08,092 INFO L175 Difference]: Start difference. First operand has 260 places, 247 transitions, 2372 flow. Second operand 11 states and 140 transitions. [2024-06-20 18:28:08,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 268 transitions, 2964 flow [2024-06-20 18:28:08,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 268 transitions, 2892 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-20 18:28:08,644 INFO L231 Difference]: Finished difference. Result has 261 places, 247 transitions, 2373 flow [2024-06-20 18:28:08,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2373, PETRI_PLACES=261, PETRI_TRANSITIONS=247} [2024-06-20 18:28:08,644 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 231 predicate places. [2024-06-20 18:28:08,644 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 247 transitions, 2373 flow [2024-06-20 18:28:08,645 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-20 18:28:08,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:28:08,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:28:08,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-20 18:28:08,645 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-20 18:28:08,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:28:08,646 INFO L85 PathProgramCache]: Analyzing trace with hash 194778444, now seen corresponding path program 5 times [2024-06-20 18:28:08,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:28:08,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364665080] [2024-06-20 18:28:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:28:08,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:28:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:28:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:28:16,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:28:16,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364665080] [2024-06-20 18:28:16,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364665080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:28:16,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:28:16,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 18:28:16,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186809892] [2024-06-20 18:28:16,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:28:16,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 18:28:16,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:28:16,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 18:28:16,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 18:28:16,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:28:16,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 247 transitions, 2373 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:16,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:28:16,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:28:16,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:28:17,513 INFO L124 PetriNetUnfolderBase]: 695/1204 cut-off events. [2024-06-20 18:28:17,514 INFO L125 PetriNetUnfolderBase]: For 135376/135376 co-relation queries the response was YES. [2024-06-20 18:28:17,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8713 conditions, 1204 events. 695/1204 cut-off events. For 135376/135376 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6121 event pairs, 73 based on Foata normal form. 2/1204 useless extension candidates. Maximal degree in co-relation 8596. Up to 995 conditions per place. [2024-06-20 18:28:17,530 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 198 selfloop transitions, 69 changer transitions 0/269 dead transitions. [2024-06-20 18:28:17,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 269 transitions, 2991 flow [2024-06-20 18:28:17,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:28:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:28:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-20 18:28:17,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265 [2024-06-20 18:28:17,532 INFO L175 Difference]: Start difference. First operand has 261 places, 247 transitions, 2373 flow. Second operand 11 states and 135 transitions. [2024-06-20 18:28:17,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 269 transitions, 2991 flow [2024-06-20 18:28:17,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 269 transitions, 2918 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-20 18:28:17,938 INFO L231 Difference]: Finished difference. Result has 262 places, 250 transitions, 2476 flow [2024-06-20 18:28:17,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2476, PETRI_PLACES=262, PETRI_TRANSITIONS=250} [2024-06-20 18:28:17,939 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 232 predicate places. [2024-06-20 18:28:17,939 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 250 transitions, 2476 flow [2024-06-20 18:28:17,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:17,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:28:17,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:28:17,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-20 18:28:17,939 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-20 18:28:17,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:28:17,940 INFO L85 PathProgramCache]: Analyzing trace with hash 194774724, now seen corresponding path program 6 times [2024-06-20 18:28:17,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:28:17,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651733925] [2024-06-20 18:28:17,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:28:17,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:28:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:28:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:28:26,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:28:26,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651733925] [2024-06-20 18:28:26,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651733925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:28:26,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:28:26,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:28:26,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990417940] [2024-06-20 18:28:26,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:28:26,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:28:26,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:28:26,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:28:26,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:28:26,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:28:26,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 250 transitions, 2476 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:26,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:28:26,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:28:26,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:28:27,022 INFO L124 PetriNetUnfolderBase]: 706/1225 cut-off events. [2024-06-20 18:28:27,022 INFO L125 PetriNetUnfolderBase]: For 146099/146099 co-relation queries the response was YES. [2024-06-20 18:28:27,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9103 conditions, 1225 events. 706/1225 cut-off events. For 146099/146099 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6246 event pairs, 74 based on Foata normal form. 2/1225 useless extension candidates. Maximal degree in co-relation 8985. Up to 912 conditions per place. [2024-06-20 18:28:27,039 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 185 selfloop transitions, 85 changer transitions 0/272 dead transitions. [2024-06-20 18:28:27,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 272 transitions, 3268 flow [2024-06-20 18:28:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:28:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:28:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-20 18:28:27,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-20 18:28:27,041 INFO L175 Difference]: Start difference. First operand has 262 places, 250 transitions, 2476 flow. Second operand 10 states and 130 transitions. [2024-06-20 18:28:27,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 272 transitions, 3268 flow [2024-06-20 18:28:27,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 272 transitions, 3119 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-20 18:28:27,677 INFO L231 Difference]: Finished difference. Result has 263 places, 252 transitions, 2531 flow [2024-06-20 18:28:27,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2327, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2531, PETRI_PLACES=263, PETRI_TRANSITIONS=252} [2024-06-20 18:28:27,677 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 233 predicate places. [2024-06-20 18:28:27,678 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 252 transitions, 2531 flow [2024-06-20 18:28:27,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:27,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:28:27,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:28:27,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-20 18:28:27,678 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-20 18:28:27,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:28:27,679 INFO L85 PathProgramCache]: Analyzing trace with hash -832836752, now seen corresponding path program 7 times [2024-06-20 18:28:27,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:28:27,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044593496] [2024-06-20 18:28:27,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:28:27,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:28:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:28:34,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-20 18:28:34,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:28:34,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044593496] [2024-06-20 18:28:34,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044593496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:28:34,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:28:34,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:28:34,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61959104] [2024-06-20 18:28:34,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:28:34,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:28:34,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:28:34,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:28:34,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:28:34,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:28:34,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 252 transitions, 2531 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:34,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:28:34,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:28:34,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:28:35,077 INFO L124 PetriNetUnfolderBase]: 710/1233 cut-off events. [2024-06-20 18:28:35,077 INFO L125 PetriNetUnfolderBase]: For 149878/149878 co-relation queries the response was YES. [2024-06-20 18:28:35,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9206 conditions, 1233 events. 710/1233 cut-off events. For 149878/149878 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6301 event pairs, 74 based on Foata normal form. 2/1233 useless extension candidates. Maximal degree in co-relation 9089. Up to 939 conditions per place. [2024-06-20 18:28:35,090 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 184 selfloop transitions, 85 changer transitions 0/271 dead transitions. [2024-06-20 18:28:35,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 271 transitions, 3135 flow [2024-06-20 18:28:35,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:28:35,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:28:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-20 18:28:35,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-20 18:28:35,092 INFO L175 Difference]: Start difference. First operand has 263 places, 252 transitions, 2531 flow. Second operand 10 states and 129 transitions. [2024-06-20 18:28:35,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 271 transitions, 3135 flow [2024-06-20 18:28:35,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 271 transitions, 3011 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-20 18:28:35,570 INFO L231 Difference]: Finished difference. Result has 267 places, 253 transitions, 2601 flow [2024-06-20 18:28:35,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2413, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2601, PETRI_PLACES=267, PETRI_TRANSITIONS=253} [2024-06-20 18:28:35,573 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 237 predicate places. [2024-06-20 18:28:35,573 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 253 transitions, 2601 flow [2024-06-20 18:28:35,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:35,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:28:35,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:28:35,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-20 18:28:35,573 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-20 18:28:35,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:28:35,574 INFO L85 PathProgramCache]: Analyzing trace with hash -827258891, now seen corresponding path program 1 times [2024-06-20 18:28:35,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:28:35,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851121970] [2024-06-20 18:28:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:28:35,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:28:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:28:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:28:43,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:28:43,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851121970] [2024-06-20 18:28:43,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851121970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:28:43,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:28:43,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:28:43,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730564431] [2024-06-20 18:28:43,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:28:43,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:28:43,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:28:43,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:28:43,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:28:43,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:28:43,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 253 transitions, 2601 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:43,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:28:43,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:28:43,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:28:43,694 INFO L124 PetriNetUnfolderBase]: 714/1241 cut-off events. [2024-06-20 18:28:43,694 INFO L125 PetriNetUnfolderBase]: For 153284/153284 co-relation queries the response was YES. [2024-06-20 18:28:43,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9379 conditions, 1241 events. 714/1241 cut-off events. For 153284/153284 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6395 event pairs, 62 based on Foata normal form. 2/1241 useless extension candidates. Maximal degree in co-relation 9260. Up to 1083 conditions per place. [2024-06-20 18:28:43,709 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 223 selfloop transitions, 48 changer transitions 0/273 dead transitions. [2024-06-20 18:28:43,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 273 transitions, 3203 flow [2024-06-20 18:28:43,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:28:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:28:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-20 18:28:43,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2024-06-20 18:28:43,711 INFO L175 Difference]: Start difference. First operand has 267 places, 253 transitions, 2601 flow. Second operand 10 states and 132 transitions. [2024-06-20 18:28:43,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 273 transitions, 3203 flow [2024-06-20 18:28:44,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 273 transitions, 3033 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-20 18:28:44,169 INFO L231 Difference]: Finished difference. Result has 269 places, 254 transitions, 2539 flow [2024-06-20 18:28:44,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2431, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2539, PETRI_PLACES=269, PETRI_TRANSITIONS=254} [2024-06-20 18:28:44,170 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 239 predicate places. [2024-06-20 18:28:44,170 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 254 transitions, 2539 flow [2024-06-20 18:28:44,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:44,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:28:44,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:28:44,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-20 18:28:44,171 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-20 18:28:44,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:28:44,172 INFO L85 PathProgramCache]: Analyzing trace with hash -832831017, now seen corresponding path program 5 times [2024-06-20 18:28:44,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:28:44,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970002818] [2024-06-20 18:28:44,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:28:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:28:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:28:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:28:53,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:28:53,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970002818] [2024-06-20 18:28:53,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970002818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:28:53,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:28:53,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 18:28:53,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849232973] [2024-06-20 18:28:53,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:28:53,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 18:28:53,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:28:53,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 18:28:53,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 18:28:53,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:28:53,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 254 transitions, 2539 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:53,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:28:53,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:28:53,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:28:53,952 INFO L124 PetriNetUnfolderBase]: 710/1235 cut-off events. [2024-06-20 18:28:53,952 INFO L125 PetriNetUnfolderBase]: For 148633/148633 co-relation queries the response was YES. [2024-06-20 18:28:53,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9156 conditions, 1235 events. 710/1235 cut-off events. For 148633/148633 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6345 event pairs, 71 based on Foata normal form. 2/1235 useless extension candidates. Maximal degree in co-relation 9036. Up to 619 conditions per place. [2024-06-20 18:28:53,964 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 161 selfloop transitions, 115 changer transitions 0/278 dead transitions. [2024-06-20 18:28:53,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 278 transitions, 3513 flow [2024-06-20 18:28:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:28:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:28:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-20 18:28:53,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4310850439882698 [2024-06-20 18:28:53,967 INFO L175 Difference]: Start difference. First operand has 269 places, 254 transitions, 2539 flow. Second operand 11 states and 147 transitions. [2024-06-20 18:28:53,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 278 transitions, 3513 flow [2024-06-20 18:28:54,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 278 transitions, 3401 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-20 18:28:54,372 INFO L231 Difference]: Finished difference. Result has 272 places, 254 transitions, 2662 flow [2024-06-20 18:28:54,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2427, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2662, PETRI_PLACES=272, PETRI_TRANSITIONS=254} [2024-06-20 18:28:54,373 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 242 predicate places. [2024-06-20 18:28:54,373 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 254 transitions, 2662 flow [2024-06-20 18:28:54,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:28:54,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:28:54,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:28:54,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-20 18:28:54,374 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-20 18:28:54,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:28:54,374 INFO L85 PathProgramCache]: Analyzing trace with hash 200284974, now seen corresponding path program 8 times [2024-06-20 18:28:54,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:28:54,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288638005] [2024-06-20 18:28:54,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:28:54,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:28:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:29:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:29:00,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:29:00,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288638005] [2024-06-20 18:29:00,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288638005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:29:00,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:29:00,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 18:29:00,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826093586] [2024-06-20 18:29:00,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:29:00,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 18:29:00,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:29:00,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 18:29:00,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 18:29:00,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:29:00,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 254 transitions, 2662 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:00,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:29:00,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:29:00,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:29:01,220 INFO L124 PetriNetUnfolderBase]: 707/1230 cut-off events. [2024-06-20 18:29:01,220 INFO L125 PetriNetUnfolderBase]: For 144783/144783 co-relation queries the response was YES. [2024-06-20 18:29:01,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9169 conditions, 1230 events. 707/1230 cut-off events. For 144783/144783 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6317 event pairs, 72 based on Foata normal form. 2/1230 useless extension candidates. Maximal degree in co-relation 9048. Up to 1030 conditions per place. [2024-06-20 18:29:01,234 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 206 selfloop transitions, 65 changer transitions 0/273 dead transitions. [2024-06-20 18:29:01,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 273 transitions, 3256 flow [2024-06-20 18:29:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:29:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:29:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-20 18:29:01,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39002932551319647 [2024-06-20 18:29:01,236 INFO L175 Difference]: Start difference. First operand has 272 places, 254 transitions, 2662 flow. Second operand 11 states and 133 transitions. [2024-06-20 18:29:01,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 273 transitions, 3256 flow [2024-06-20 18:29:01,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 273 transitions, 3013 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-20 18:29:01,657 INFO L231 Difference]: Finished difference. Result has 273 places, 254 transitions, 2553 flow [2024-06-20 18:29:01,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2419, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2553, PETRI_PLACES=273, PETRI_TRANSITIONS=254} [2024-06-20 18:29:01,657 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 243 predicate places. [2024-06-20 18:29:01,657 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 254 transitions, 2553 flow [2024-06-20 18:29:01,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:01,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:29:01,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:29:01,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-20 18:29:01,658 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-20 18:29:01,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:29:01,659 INFO L85 PathProgramCache]: Analyzing trace with hash -827468637, now seen corresponding path program 6 times [2024-06-20 18:29:01,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:29:01,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494839812] [2024-06-20 18:29:01,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:29:01,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:29:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:29:10,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-20 18:29:10,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:29:10,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494839812] [2024-06-20 18:29:10,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494839812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:29:10,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:29:10,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 18:29:10,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847857468] [2024-06-20 18:29:10,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:29:10,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 18:29:10,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:29:10,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 18:29:10,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 18:29:10,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:29:10,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 254 transitions, 2553 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:10,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:29:10,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:29:10,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:29:10,946 INFO L124 PetriNetUnfolderBase]: 713/1240 cut-off events. [2024-06-20 18:29:10,947 INFO L125 PetriNetUnfolderBase]: For 147347/147347 co-relation queries the response was YES. [2024-06-20 18:29:10,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9072 conditions, 1240 events. 713/1240 cut-off events. For 147347/147347 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6382 event pairs, 67 based on Foata normal form. 2/1240 useless extension candidates. Maximal degree in co-relation 8950. Up to 620 conditions per place. [2024-06-20 18:29:10,962 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 159 selfloop transitions, 119 changer transitions 0/280 dead transitions. [2024-06-20 18:29:10,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 280 transitions, 3565 flow [2024-06-20 18:29:10,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:29:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:29:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-20 18:29:10,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281524926686217 [2024-06-20 18:29:10,963 INFO L175 Difference]: Start difference. First operand has 273 places, 254 transitions, 2553 flow. Second operand 11 states and 146 transitions. [2024-06-20 18:29:10,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 280 transitions, 3565 flow [2024-06-20 18:29:11,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 280 transitions, 3403 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-20 18:29:11,371 INFO L231 Difference]: Finished difference. Result has 273 places, 256 transitions, 2660 flow [2024-06-20 18:29:11,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2391, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2660, PETRI_PLACES=273, PETRI_TRANSITIONS=256} [2024-06-20 18:29:11,372 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 243 predicate places. [2024-06-20 18:29:11,372 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 256 transitions, 2660 flow [2024-06-20 18:29:11,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:11,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:29:11,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:29:11,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-20 18:29:11,373 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-20 18:29:11,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:29:11,373 INFO L85 PathProgramCache]: Analyzing trace with hash 200492519, now seen corresponding path program 7 times [2024-06-20 18:29:11,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:29:11,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528277421] [2024-06-20 18:29:11,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:29:11,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:29:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:29:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:29:19,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:29:19,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528277421] [2024-06-20 18:29:19,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528277421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:29:19,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:29:19,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 18:29:19,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568166077] [2024-06-20 18:29:19,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:29:19,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 18:29:19,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:29:19,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 18:29:19,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 18:29:19,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:29:19,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 256 transitions, 2660 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:19,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:29:19,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:29:19,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:29:20,310 INFO L124 PetriNetUnfolderBase]: 709/1234 cut-off events. [2024-06-20 18:29:20,310 INFO L125 PetriNetUnfolderBase]: For 143636/143636 co-relation queries the response was YES. [2024-06-20 18:29:20,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9030 conditions, 1234 events. 709/1234 cut-off events. For 143636/143636 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6391 event pairs, 53 based on Foata normal form. 2/1234 useless extension candidates. Maximal degree in co-relation 8908. Up to 891 conditions per place. [2024-06-20 18:29:20,323 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 189 selfloop transitions, 90 changer transitions 0/281 dead transitions. [2024-06-20 18:29:20,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 281 transitions, 3313 flow [2024-06-20 18:29:20,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:29:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:29:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-20 18:29:20,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40175953079178883 [2024-06-20 18:29:20,344 INFO L175 Difference]: Start difference. First operand has 273 places, 256 transitions, 2660 flow. Second operand 11 states and 137 transitions. [2024-06-20 18:29:20,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 281 transitions, 3313 flow [2024-06-20 18:29:20,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 281 transitions, 3037 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-20 18:29:20,755 INFO L231 Difference]: Finished difference. Result has 277 places, 260 transitions, 2678 flow [2024-06-20 18:29:20,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2392, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2678, PETRI_PLACES=277, PETRI_TRANSITIONS=260} [2024-06-20 18:29:20,755 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 247 predicate places. [2024-06-20 18:29:20,756 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 260 transitions, 2678 flow [2024-06-20 18:29:20,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:20,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:29:20,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:29:20,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-20 18:29:20,756 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-20 18:29:20,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:29:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash 213935687, now seen corresponding path program 2 times [2024-06-20 18:29:20,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:29:20,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373500644] [2024-06-20 18:29:20,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:29:20,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:29:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:29:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:29:28,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:29:28,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373500644] [2024-06-20 18:29:28,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373500644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:29:28,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:29:28,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 18:29:28,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040991297] [2024-06-20 18:29:28,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:29:28,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 18:29:28,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:29:28,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 18:29:28,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 18:29:28,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:29:28,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 260 transitions, 2678 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:28,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:29:28,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:29:28,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:29:29,061 INFO L124 PetriNetUnfolderBase]: 713/1242 cut-off events. [2024-06-20 18:29:29,062 INFO L125 PetriNetUnfolderBase]: For 145549/145549 co-relation queries the response was YES. [2024-06-20 18:29:29,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9125 conditions, 1242 events. 713/1242 cut-off events. For 145549/145549 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6406 event pairs, 78 based on Foata normal form. 2/1242 useless extension candidates. Maximal degree in co-relation 9000. Up to 1163 conditions per place. [2024-06-20 18:29:29,079 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 248 selfloop transitions, 28 changer transitions 0/278 dead transitions. [2024-06-20 18:29:29,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 278 transitions, 3291 flow [2024-06-20 18:29:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:29:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:29:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-20 18:29:29,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-20 18:29:29,081 INFO L175 Difference]: Start difference. First operand has 277 places, 260 transitions, 2678 flow. Second operand 10 states and 117 transitions. [2024-06-20 18:29:29,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 278 transitions, 3291 flow [2024-06-20 18:29:29,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 278 transitions, 3138 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-20 18:29:29,760 INFO L231 Difference]: Finished difference. Result has 279 places, 262 transitions, 2609 flow [2024-06-20 18:29:29,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2525, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2609, PETRI_PLACES=279, PETRI_TRANSITIONS=262} [2024-06-20 18:29:29,761 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 249 predicate places. [2024-06-20 18:29:29,761 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 262 transitions, 2609 flow [2024-06-20 18:29:29,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:29,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:29:29,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:29:29,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-20 18:29:29,762 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-20 18:29:29,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:29:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1732670921, now seen corresponding path program 3 times [2024-06-20 18:29:29,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:29:29,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522349547] [2024-06-20 18:29:29,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:29:29,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:29:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:29:39,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-20 18:29:39,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:29:39,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522349547] [2024-06-20 18:29:39,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522349547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:29:39,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:29:39,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 18:29:39,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175556285] [2024-06-20 18:29:39,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:29:39,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 18:29:39,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:29:39,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 18:29:39,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 18:29:39,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:29:39,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 262 transitions, 2609 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:39,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:29:39,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:29:39,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:29:40,613 INFO L124 PetriNetUnfolderBase]: 717/1250 cut-off events. [2024-06-20 18:29:40,613 INFO L125 PetriNetUnfolderBase]: For 148682/148682 co-relation queries the response was YES. [2024-06-20 18:29:40,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9041 conditions, 1250 events. 717/1250 cut-off events. For 148682/148682 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6487 event pairs, 76 based on Foata normal form. 2/1250 useless extension candidates. Maximal degree in co-relation 8914. Up to 1171 conditions per place. [2024-06-20 18:29:40,635 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 250 selfloop transitions, 27 changer transitions 0/279 dead transitions. [2024-06-20 18:29:40,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 279 transitions, 3215 flow [2024-06-20 18:29:40,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:29:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:29:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-20 18:29:40,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-20 18:29:40,637 INFO L175 Difference]: Start difference. First operand has 279 places, 262 transitions, 2609 flow. Second operand 10 states and 116 transitions. [2024-06-20 18:29:40,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 279 transitions, 3215 flow [2024-06-20 18:29:41,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 279 transitions, 3158 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-20 18:29:41,267 INFO L231 Difference]: Finished difference. Result has 282 places, 263 transitions, 2622 flow [2024-06-20 18:29:41,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2552, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2622, PETRI_PLACES=282, PETRI_TRANSITIONS=263} [2024-06-20 18:29:41,268 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 252 predicate places. [2024-06-20 18:29:41,268 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 263 transitions, 2622 flow [2024-06-20 18:29:41,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:29:41,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:29:41,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:29:41,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-20 18:29:41,269 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-20 18:29:41,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:29:41,269 INFO L85 PathProgramCache]: Analyzing trace with hash 206526377, now seen corresponding path program 4 times [2024-06-20 18:29:41,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:29:41,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595918769] [2024-06-20 18:29:41,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:29:41,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:29:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:29:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:29:51,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:29:51,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595918769] [2024-06-20 18:29:51,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595918769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:29:51,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:29:51,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:29:51,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796474535] [2024-06-20 18:29:51,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:29:51,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:29:51,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:29:51,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:29:51,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:29:51,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:29:51,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 263 transitions, 2622 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-20 18:29:51,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:29:51,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:29:51,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:29:52,550 INFO L124 PetriNetUnfolderBase]: 721/1258 cut-off events. [2024-06-20 18:29:52,551 INFO L125 PetriNetUnfolderBase]: For 152001/152001 co-relation queries the response was YES. [2024-06-20 18:29:52,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9112 conditions, 1258 events. 721/1258 cut-off events. For 152001/152001 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6538 event pairs, 82 based on Foata normal form. 2/1258 useless extension candidates. Maximal degree in co-relation 8984. Up to 1179 conditions per place. [2024-06-20 18:29:52,569 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 251 selfloop transitions, 28 changer transitions 0/281 dead transitions. [2024-06-20 18:29:52,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 281 transitions, 3240 flow [2024-06-20 18:29:52,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:29:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:29:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-20 18:29:52,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-20 18:29:52,571 INFO L175 Difference]: Start difference. First operand has 282 places, 263 transitions, 2622 flow. Second operand 10 states and 129 transitions. [2024-06-20 18:29:52,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 281 transitions, 3240 flow [2024-06-20 18:29:53,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 281 transitions, 3180 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 18:29:53,305 INFO L231 Difference]: Finished difference. Result has 284 places, 264 transitions, 2636 flow [2024-06-20 18:29:53,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2562, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2636, PETRI_PLACES=284, PETRI_TRANSITIONS=264} [2024-06-20 18:29:53,305 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 254 predicate places. [2024-06-20 18:29:53,306 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 264 transitions, 2636 flow [2024-06-20 18:29:53,306 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-20 18:29:53,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:29:53,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:29:53,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-20 18:29:53,306 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-20 18:29:53,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:29:53,307 INFO L85 PathProgramCache]: Analyzing trace with hash 206518441, now seen corresponding path program 8 times [2024-06-20 18:29:53,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:29:53,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967278024] [2024-06-20 18:29:53,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:29:53,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:29:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:30:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:30:04,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:30:04,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967278024] [2024-06-20 18:30:04,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967278024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:30:04,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:30:04,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 18:30:04,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49796335] [2024-06-20 18:30:04,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:30:04,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 18:30:04,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:30:04,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 18:30:04,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 18:30:04,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-20 18:30:04,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 264 transitions, 2636 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:04,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:30:04,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-20 18:30:04,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:30:05,362 INFO L124 PetriNetUnfolderBase]: 727/1268 cut-off events. [2024-06-20 18:30:05,363 INFO L125 PetriNetUnfolderBase]: For 155333/155333 co-relation queries the response was YES. [2024-06-20 18:30:05,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9201 conditions, 1268 events. 727/1268 cut-off events. For 155333/155333 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6615 event pairs, 73 based on Foata normal form. 2/1268 useless extension candidates. Maximal degree in co-relation 9072. Up to 1162 conditions per place. [2024-06-20 18:30:05,378 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 249 selfloop transitions, 34 changer transitions 0/285 dead transitions. [2024-06-20 18:30:05,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 285 transitions, 3288 flow [2024-06-20 18:30:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:30:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:30:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-20 18:30:05,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-20 18:30:05,380 INFO L175 Difference]: Start difference. First operand has 284 places, 264 transitions, 2636 flow. Second operand 11 states and 132 transitions. [2024-06-20 18:30:05,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 285 transitions, 3288 flow [2024-06-20 18:30:05,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 285 transitions, 3224 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-20 18:30:05,850 INFO L231 Difference]: Finished difference. Result has 287 places, 266 transitions, 2679 flow [2024-06-20 18:30:05,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2572, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2679, PETRI_PLACES=287, PETRI_TRANSITIONS=266} [2024-06-20 18:30:05,851 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 257 predicate places. [2024-06-20 18:30:05,851 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 266 transitions, 2679 flow [2024-06-20 18:30:05,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:05,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:30:05,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:30:05,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-20 18:30:05,852 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-20 18:30:05,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:30:05,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1725042565, now seen corresponding path program 9 times [2024-06-20 18:30:05,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:30:05,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022639432] [2024-06-20 18:30:05,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:30:05,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:30:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:30:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:30:16,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:30:16,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022639432] [2024-06-20 18:30:16,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022639432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:30:16,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:30:16,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 18:30:16,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750604124] [2024-06-20 18:30:16,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:30:16,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 18:30:16,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:30:16,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 18:30:16,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 18:30:16,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:30:16,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 266 transitions, 2679 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-20 18:30:16,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:30:16,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:30:16,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:30:17,058 INFO L124 PetriNetUnfolderBase]: 733/1278 cut-off events. [2024-06-20 18:30:17,059 INFO L125 PetriNetUnfolderBase]: For 158785/158785 co-relation queries the response was YES. [2024-06-20 18:30:17,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9311 conditions, 1278 events. 733/1278 cut-off events. For 158785/158785 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6676 event pairs, 74 based on Foata normal form. 2/1278 useless extension candidates. Maximal degree in co-relation 9181. Up to 1163 conditions per place. [2024-06-20 18:30:17,078 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 247 selfloop transitions, 38 changer transitions 0/287 dead transitions. [2024-06-20 18:30:17,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 287 transitions, 3339 flow [2024-06-20 18:30:17,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 18:30:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 18:30:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-20 18:30:17,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-20 18:30:17,080 INFO L175 Difference]: Start difference. First operand has 287 places, 266 transitions, 2679 flow. Second operand 11 states and 143 transitions. [2024-06-20 18:30:17,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 287 transitions, 3339 flow [2024-06-20 18:30:17,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 287 transitions, 3254 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-20 18:30:17,764 INFO L231 Difference]: Finished difference. Result has 289 places, 268 transitions, 2713 flow [2024-06-20 18:30:17,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2594, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2713, PETRI_PLACES=289, PETRI_TRANSITIONS=268} [2024-06-20 18:30:17,765 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 259 predicate places. [2024-06-20 18:30:17,765 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 268 transitions, 2713 flow [2024-06-20 18:30:17,765 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-20 18:30:17,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:30:17,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:30:17,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-20 18:30:17,766 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-20 18:30:17,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:30:17,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1234070397, now seen corresponding path program 10 times [2024-06-20 18:30:17,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:30:17,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082714219] [2024-06-20 18:30:17,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:30:17,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:30:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:30:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:30:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:30:27,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082714219] [2024-06-20 18:30:27,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082714219] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:30:27,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:30:27,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 18:30:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674463587] [2024-06-20 18:30:27,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:30:27,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 18:30:27,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:30:27,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 18:30:27,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 18:30:27,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-20 18:30:27,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 268 transitions, 2713 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:27,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:30:27,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-20 18:30:27,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:30:27,856 INFO L124 PetriNetUnfolderBase]: 729/1272 cut-off events. [2024-06-20 18:30:27,857 INFO L125 PetriNetUnfolderBase]: For 152670/152670 co-relation queries the response was YES. [2024-06-20 18:30:27,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9117 conditions, 1272 events. 729/1272 cut-off events. For 152670/152670 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6659 event pairs, 80 based on Foata normal form. 2/1272 useless extension candidates. Maximal degree in co-relation 8986. Up to 1141 conditions per place. [2024-06-20 18:30:27,872 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 243 selfloop transitions, 40 changer transitions 0/285 dead transitions. [2024-06-20 18:30:27,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 285 transitions, 3329 flow [2024-06-20 18:30:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 18:30:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 18:30:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-20 18:30:27,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290322580645161 [2024-06-20 18:30:27,873 INFO L175 Difference]: Start difference. First operand has 289 places, 268 transitions, 2713 flow. Second operand 10 states and 133 transitions. [2024-06-20 18:30:27,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 285 transitions, 3329 flow [2024-06-20 18:30:28,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 285 transitions, 3218 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-06-20 18:30:28,536 INFO L231 Difference]: Finished difference. Result has 290 places, 268 transitions, 2690 flow [2024-06-20 18:30:28,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2602, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2690, PETRI_PLACES=290, PETRI_TRANSITIONS=268} [2024-06-20 18:30:28,537 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 260 predicate places. [2024-06-20 18:30:28,537 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 268 transitions, 2690 flow [2024-06-20 18:30:28,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:30:28,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:30:28,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:30:28,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-20 18:30:28,538 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-20 18:30:28,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:30:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1234070242, now seen corresponding path program 9 times [2024-06-20 18:30:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:30:28,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025448488] [2024-06-20 18:30:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:30:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:30:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15