./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi010.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/rfi010.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/rfi010.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi010.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-bcb38a6-m [2024-06-04 17:52:18,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:52:18,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:52:18,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:52:18,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:52:18,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:52:18,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:52:18,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:52:18,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:52:18,858 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:52:18,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:52:18,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:52:18,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:52:18,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:52:18,859 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:52:18,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:52:18,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:52:18,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:52:18,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:52:18,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:52:18,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:52:18,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:52:18,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:52:18,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:52:18,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:52:18,869 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:52:18,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:52:18,869 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:52:18,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:52:18,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:52:18,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:52:18,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:52:18,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:52:18,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:52:18,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:52:18,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:52:18,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:52:18,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:52:18,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:52:18,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:52:18,872 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:52:18,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:52:18,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:52:18,873 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-04 17:52:19,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:52:19,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:52:19,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:52:19,059 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:52:19,059 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:52:19,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010.i [2024-06-04 17:52:20,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:52:20,278 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:52:20,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010.i [2024-06-04 17:52:20,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4791c15b6/c3f4d40a776e44d5b31d594662d3433e/FLAG67ce3e123 [2024-06-04 17:52:20,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4791c15b6/c3f4d40a776e44d5b31d594662d3433e [2024-06-04 17:52:20,311 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:52:20,311 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:52:20,312 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/rfi010.yml/witness.yml [2024-06-04 17:52:20,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:52:20,455 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:52:20,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:52:20,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:52:20,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:52:20,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:52:20" (1/2) ... [2024-06-04 17:52:20,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ac8251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:52:20, skipping insertion in model container [2024-06-04 17:52:20,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:52:20" (1/2) ... [2024-06-04 17:52:20,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@64c15c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:52:20, skipping insertion in model container [2024-06-04 17:52:20,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:52:20" (2/2) ... [2024-06-04 17:52:20,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ac8251 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:52:20, skipping insertion in model container [2024-06-04 17:52:20,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:52:20" (2/2) ... [2024-06-04 17:52:20,463 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:52:20,515 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:52:20,517 INFO L97 edCorrectnessWitness]: Location invariant before [L827-L827] ((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 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_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (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 )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 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 )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 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$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 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_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_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 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_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_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 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_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (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_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 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 )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 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_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (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_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 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_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 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_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_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 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_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) [2024-06-04 17:52:20,517 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 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_thd1 >= 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_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 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_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (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 )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 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 )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 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$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )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_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 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_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_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 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_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_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 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_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (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_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 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 )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 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_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (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_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 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_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 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_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_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 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_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) [2024-06-04 17:52:20,518 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:52:20,518 INFO L106 edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1; [2024-06-04 17:52:20,554 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:52:20,824 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:52:20,841 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:52:21,148 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:52:21,198 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:52:21,199 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:52:21 WrapperNode [2024-06-04 17:52:21,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:52:21,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:52:21,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:52:21,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:52:21,219 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 04.06 05:52:21" (1/1) ... [2024-06-04 17:52:21,261 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 04.06 05:52:21" (1/1) ... [2024-06-04 17:52:21,315 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2024-06-04 17:52:21,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:52:21,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:52:21,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:52:21,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:52:21,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:52:21" (1/1) ... [2024-06-04 17:52:21,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:52:21" (1/1) ... [2024-06-04 17:52:21,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:52:21" (1/1) ... [2024-06-04 17:52:21,375 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-04 17:52:21,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:52:21" (1/1) ... [2024-06-04 17:52:21,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:52:21" (1/1) ... [2024-06-04 17:52:21,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:52:21" (1/1) ... [2024-06-04 17:52:21,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:52:21" (1/1) ... [2024-06-04 17:52:21,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:52:21" (1/1) ... [2024-06-04 17:52:21,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:52:21" (1/1) ... [2024-06-04 17:52:21,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:52:21,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:52:21,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:52:21,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:52:21,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:52:21" (1/1) ... [2024-06-04 17:52:21,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:52:21,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:52:21,460 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-04 17:52:21,466 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-04 17:52:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:52:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:52:21,489 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:52:21,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:52:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:52:21,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:52:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:52:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:52:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:52:21,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:52:21,491 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 17:52:21,582 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:52:21,584 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:52:22,308 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:52:22,309 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:52:22,493 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:52:22,494 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:52:22,495 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:52:22 BoogieIcfgContainer [2024-06-04 17:52:22,495 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:52:22,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:52:22,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:52:22,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:52:22,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:52:20" (1/4) ... [2024-06-04 17:52:22,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5a0bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:52:22, skipping insertion in model container [2024-06-04 17:52:22,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:52:20" (2/4) ... [2024-06-04 17:52:22,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5a0bc1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:52:22, skipping insertion in model container [2024-06-04 17:52:22,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:52:21" (3/4) ... [2024-06-04 17:52:22,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5a0bc1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:52:22, skipping insertion in model container [2024-06-04 17:52:22,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:52:22" (4/4) ... [2024-06-04 17:52:22,507 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010.i [2024-06-04 17:52:22,521 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:52:22,522 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 17:52:22,522 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:52:22,597 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:52:22,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-04 17:52:22,658 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-04 17:52:22,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:52:22,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 17:52:22,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-04 17:52:22,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-04 17:52:22,707 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:52:22,729 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;@5abeeeec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:52:22,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 17:52:22,744 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:52:22,745 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 17:52:22,745 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:52:22,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:22,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:52:22,746 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-04 17:52:22,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:22,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1790250860, now seen corresponding path program 1 times [2024-06-04 17:52:22,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:22,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380111703] [2024-06-04 17:52:22,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:22,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:26,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:26,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380111703] [2024-06-04 17:52:26,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380111703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:26,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:26,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:52:26,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753339100] [2024-06-04 17:52:26,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:26,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:52:26,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:26,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:52:26,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:52:26,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-04 17:52:26,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:26,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:26,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-04 17:52:26,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:26,574 INFO L124 PetriNetUnfolderBase]: 131/262 cut-off events. [2024-06-04 17:52:26,575 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-04 17:52:26,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 262 events. 131/262 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1035 event pairs, 75 based on Foata normal form. 1/251 useless extension candidates. Maximal degree in co-relation 506. Up to 235 conditions per place. [2024-06-04 17:52:26,579 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 22 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-04 17:52:26,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 119 flow [2024-06-04 17:52:26,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:52:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:52:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-06-04 17:52:26,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-06-04 17:52:26,589 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 57 transitions. [2024-06-04 17:52:26,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 119 flow [2024-06-04 17:52:26,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 17:52:26,592 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-04 17:52:26,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-04 17:52:26,596 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-04 17:52:26,596 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-04 17:52:26,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:26,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:26,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:26,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:52:26,597 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-04 17:52:26,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:26,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1850839667, now seen corresponding path program 1 times [2024-06-04 17:52:26,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:26,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025662815] [2024-06-04 17:52:26,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:26,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:28,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:28,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025662815] [2024-06-04 17:52:28,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025662815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:28,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:28,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:52:28,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324465377] [2024-06-04 17:52:28,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:28,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:52:28,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:28,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:52:28,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:52:28,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 17:52:28,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:28,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:28,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 17:52:28,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:29,195 INFO L124 PetriNetUnfolderBase]: 150/286 cut-off events. [2024-06-04 17:52:29,195 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-04 17:52:29,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 286 events. 150/286 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1098 event pairs, 68 based on Foata normal form. 2/287 useless extension candidates. Maximal degree in co-relation 641. Up to 258 conditions per place. [2024-06-04 17:52:29,197 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 27 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-04 17:52:29,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 163 flow [2024-06-04 17:52:29,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:52:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:52:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2024-06-04 17:52:29,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-06-04 17:52:29,199 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 70 transitions. [2024-06-04 17:52:29,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 163 flow [2024-06-04 17:52:29,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:52:29,201 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-04 17:52:29,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-04 17:52:29,201 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-04 17:52:29,202 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-04 17:52:29,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:29,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:29,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:29,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:52:29,202 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-04 17:52:29,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:29,203 INFO L85 PathProgramCache]: Analyzing trace with hash 540491858, now seen corresponding path program 1 times [2024-06-04 17:52:29,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:29,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416802182] [2024-06-04 17:52:29,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:29,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:33,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:33,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416802182] [2024-06-04 17:52:33,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416802182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:33,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:33,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:52:33,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004901727] [2024-06-04 17:52:33,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:33,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:52:33,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:33,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:52:33,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:52:33,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 17:52:33,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:33,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:33,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 17:52:33,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:33,574 INFO L124 PetriNetUnfolderBase]: 147/281 cut-off events. [2024-06-04 17:52:33,575 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2024-06-04 17:52:33,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 281 events. 147/281 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1054 event pairs, 47 based on Foata normal form. 2/282 useless extension candidates. Maximal degree in co-relation 702. Up to 244 conditions per place. [2024-06-04 17:52:33,578 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 31 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-04 17:52:33,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 211 flow [2024-06-04 17:52:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:52:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:52:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-06-04 17:52:33,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-06-04 17:52:33,582 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 85 transitions. [2024-06-04 17:52:33,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 211 flow [2024-06-04 17:52:33,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 17:52:33,585 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-04 17:52:33,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-04 17:52:33,587 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-04 17:52:33,587 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-04 17:52:33,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:33,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:33,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:33,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:52:33,588 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-04 17:52:33,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:33,588 INFO L85 PathProgramCache]: Analyzing trace with hash -956028385, now seen corresponding path program 1 times [2024-06-04 17:52:33,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:33,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115035579] [2024-06-04 17:52:33,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:37,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:37,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115035579] [2024-06-04 17:52:37,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115035579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:37,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:37,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:52:37,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058443779] [2024-06-04 17:52:37,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:37,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:52:37,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:37,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:52:37,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:52:38,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 17:52:38,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:38,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:38,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 17:52:38,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:38,186 INFO L124 PetriNetUnfolderBase]: 123/253 cut-off events. [2024-06-04 17:52:38,187 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2024-06-04 17:52:38,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 253 events. 123/253 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 964 event pairs, 38 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 681. Up to 219 conditions per place. [2024-06-04 17:52:38,189 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 26 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2024-06-04 17:52:38,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 203 flow [2024-06-04 17:52:38,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:52:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:52:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-06-04 17:52:38,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-06-04 17:52:38,192 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 5 states and 74 transitions. [2024-06-04 17:52:38,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 203 flow [2024-06-04 17:52:38,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 188 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 17:52:38,195 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 133 flow [2024-06-04 17:52:38,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-06-04 17:52:38,196 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-04 17:52:38,196 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 133 flow [2024-06-04 17:52:38,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:38,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:38,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:38,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:52:38,197 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-04 17:52:38,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:38,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2044248265, now seen corresponding path program 1 times [2024-06-04 17:52:38,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:38,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098902046] [2024-06-04 17:52:38,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:38,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:40,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:40,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098902046] [2024-06-04 17:52:40,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098902046] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:40,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:40,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:52:40,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97118821] [2024-06-04 17:52:40,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:40,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:52:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:40,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:52:40,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:52:40,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 17:52:40,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:40,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:40,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 17:52:40,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:41,196 INFO L124 PetriNetUnfolderBase]: 141/270 cut-off events. [2024-06-04 17:52:41,198 INFO L125 PetriNetUnfolderBase]: For 410/410 co-relation queries the response was YES. [2024-06-04 17:52:41,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 270 events. 141/270 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 997 event pairs, 24 based on Foata normal form. 4/273 useless extension candidates. Maximal degree in co-relation 784. Up to 215 conditions per place. [2024-06-04 17:52:41,201 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 33 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2024-06-04 17:52:41,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 241 flow [2024-06-04 17:52:41,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:52:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:52:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-04 17:52:41,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-06-04 17:52:41,203 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 133 flow. Second operand 6 states and 95 transitions. [2024-06-04 17:52:41,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 241 flow [2024-06-04 17:52:41,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 230 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 17:52:41,207 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 134 flow [2024-06-04 17:52:41,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2024-06-04 17:52:41,209 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2024-06-04 17:52:41,211 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 134 flow [2024-06-04 17:52:41,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:52:41,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:41,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:41,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:52:41,216 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-04 17:52:41,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:41,216 INFO L85 PathProgramCache]: Analyzing trace with hash 427891856, now seen corresponding path program 1 times [2024-06-04 17:52:41,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:41,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868566696] [2024-06-04 17:52:41,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:41,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:46,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:46,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868566696] [2024-06-04 17:52:46,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868566696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:46,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:46,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:52:46,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100029101] [2024-06-04 17:52:46,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:46,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:52:46,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:46,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:52:46,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:52:46,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 17:52:46,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 134 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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-04 17:52:46,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:46,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 17:52:46,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:46,539 INFO L124 PetriNetUnfolderBase]: 115/237 cut-off events. [2024-06-04 17:52:46,539 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2024-06-04 17:52:46,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 237 events. 115/237 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 880 event pairs, 32 based on Foata normal form. 2/238 useless extension candidates. Maximal degree in co-relation 704. Up to 199 conditions per place. [2024-06-04 17:52:46,541 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 27 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2024-06-04 17:52:46,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 228 flow [2024-06-04 17:52:46,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:52:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:52:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2024-06-04 17:52:46,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2024-06-04 17:52:46,542 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 134 flow. Second operand 6 states and 86 transitions. [2024-06-04 17:52:46,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 228 flow [2024-06-04 17:52:46,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 208 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 17:52:46,544 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 147 flow [2024-06-04 17:52:46,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2024-06-04 17:52:46,544 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-04 17:52:46,545 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 147 flow [2024-06-04 17:52:46,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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-04 17:52:46,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:46,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:46,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:52:46,545 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-04 17:52:46,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:46,546 INFO L85 PathProgramCache]: Analyzing trace with hash 841772222, now seen corresponding path program 1 times [2024-06-04 17:52:46,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:46,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732700180] [2024-06-04 17:52:46,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:46,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:50,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:50,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732700180] [2024-06-04 17:52:50,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732700180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:50,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:50,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:52:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784985239] [2024-06-04 17:52:50,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:50,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:52:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:50,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:52:50,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:52:50,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:52:50,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 147 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-04 17:52:50,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:50,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:52:50,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:51,116 INFO L124 PetriNetUnfolderBase]: 141/275 cut-off events. [2024-06-04 17:52:51,116 INFO L125 PetriNetUnfolderBase]: For 652/652 co-relation queries the response was YES. [2024-06-04 17:52:51,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 275 events. 141/275 cut-off events. For 652/652 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1034 event pairs, 38 based on Foata normal form. 2/276 useless extension candidates. Maximal degree in co-relation 863. Up to 237 conditions per place. [2024-06-04 17:52:51,119 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 33 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2024-06-04 17:52:51,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 263 flow [2024-06-04 17:52:51,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:52:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:52:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-04 17:52:51,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-04 17:52:51,125 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 147 flow. Second operand 6 states and 84 transitions. [2024-06-04 17:52:51,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 263 flow [2024-06-04 17:52:51,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 246 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:52:51,127 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 163 flow [2024-06-04 17:52:51,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-06-04 17:52:51,128 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-04 17:52:51,128 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 163 flow [2024-06-04 17:52:51,128 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-04 17:52:51,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:51,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:51,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:52:51,129 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-04 17:52:51,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:51,129 INFO L85 PathProgramCache]: Analyzing trace with hash 379737470, now seen corresponding path program 2 times [2024-06-04 17:52:51,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:51,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610195993] [2024-06-04 17:52:51,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:51,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:52:55,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:52:55,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:52:55,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610195993] [2024-06-04 17:52:55,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610195993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:52:55,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:52:55,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:52:55,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256251990] [2024-06-04 17:52:55,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:52:55,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:52:55,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:52:55,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:52:55,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:52:55,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:52:55,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 163 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-04 17:52:55,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:52:55,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:52:55,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:52:55,715 INFO L124 PetriNetUnfolderBase]: 142/276 cut-off events. [2024-06-04 17:52:55,716 INFO L125 PetriNetUnfolderBase]: For 843/843 co-relation queries the response was YES. [2024-06-04 17:52:55,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 276 events. 142/276 cut-off events. For 843/843 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1048 event pairs, 42 based on Foata normal form. 2/275 useless extension candidates. Maximal degree in co-relation 917. Up to 230 conditions per place. [2024-06-04 17:52:55,718 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 30 selfloop transitions, 11 changer transitions 0/45 dead transitions. [2024-06-04 17:52:55,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 279 flow [2024-06-04 17:52:55,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:52:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:52:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-06-04 17:52:55,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-04 17:52:55,719 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 163 flow. Second operand 6 states and 84 transitions. [2024-06-04 17:52:55,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 279 flow [2024-06-04 17:52:55,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 262 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:52:55,721 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 189 flow [2024-06-04 17:52:55,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=189, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-06-04 17:52:55,722 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-04 17:52:55,722 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 189 flow [2024-06-04 17:52:55,722 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-04 17:52:55,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:52:55,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:52:55,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:52:55,722 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-04 17:52:55,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:52:55,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1014541167, now seen corresponding path program 1 times [2024-06-04 17:52:55,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:52:55,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362659822] [2024-06-04 17:52:55,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:52:55,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:52:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:01,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:01,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362659822] [2024-06-04 17:53:01,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362659822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:01,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:01,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:53:01,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782160381] [2024-06-04 17:53:01,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:01,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:53:01,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:01,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:53:01,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:53:01,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:53:01,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 189 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:01,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:01,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:53:01,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:01,923 INFO L124 PetriNetUnfolderBase]: 158/309 cut-off events. [2024-06-04 17:53:01,924 INFO L125 PetriNetUnfolderBase]: For 1119/1119 co-relation queries the response was YES. [2024-06-04 17:53:01,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1099 conditions, 309 events. 158/309 cut-off events. For 1119/1119 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1238 event pairs, 38 based on Foata normal form. 2/310 useless extension candidates. Maximal degree in co-relation 1075. Up to 258 conditions per place. [2024-06-04 17:53:01,926 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 39 selfloop transitions, 14 changer transitions 0/57 dead transitions. [2024-06-04 17:53:01,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 371 flow [2024-06-04 17:53:01,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:53:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:53:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-04 17:53:01,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-04 17:53:01,943 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 189 flow. Second operand 8 states and 108 transitions. [2024-06-04 17:53:01,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 371 flow [2024-06-04 17:53:01,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 336 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 17:53:01,946 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 251 flow [2024-06-04 17:53:01,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=251, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-06-04 17:53:01,946 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2024-06-04 17:53:01,946 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 251 flow [2024-06-04 17:53:01,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:01,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:01,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:01,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:53:01,947 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-04 17:53:01,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:01,948 INFO L85 PathProgramCache]: Analyzing trace with hash 325135825, now seen corresponding path program 2 times [2024-06-04 17:53:01,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:01,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976005194] [2024-06-04 17:53:01,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:01,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:06,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:06,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976005194] [2024-06-04 17:53:06,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976005194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:06,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:06,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:53:06,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172351576] [2024-06-04 17:53:06,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:06,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:53:06,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:06,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:53:06,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:53:07,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:53:07,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 251 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:07,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:07,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:53:07,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:07,285 INFO L124 PetriNetUnfolderBase]: 164/321 cut-off events. [2024-06-04 17:53:07,286 INFO L125 PetriNetUnfolderBase]: For 1408/1408 co-relation queries the response was YES. [2024-06-04 17:53:07,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 321 events. 164/321 cut-off events. For 1408/1408 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1281 event pairs, 37 based on Foata normal form. 2/322 useless extension candidates. Maximal degree in co-relation 1211. Up to 256 conditions per place. [2024-06-04 17:53:07,288 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 36 selfloop transitions, 18 changer transitions 0/58 dead transitions. [2024-06-04 17:53:07,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 409 flow [2024-06-04 17:53:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:53:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:53:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-04 17:53:07,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 17:53:07,290 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 251 flow. Second operand 7 states and 96 transitions. [2024-06-04 17:53:07,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 409 flow [2024-06-04 17:53:07,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 382 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 17:53:07,292 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 296 flow [2024-06-04 17:53:07,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-06-04 17:53:07,293 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2024-06-04 17:53:07,293 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 296 flow [2024-06-04 17:53:07,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:07,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:07,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:07,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:53:07,293 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-04 17:53:07,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:07,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1112772689, now seen corresponding path program 3 times [2024-06-04 17:53:07,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:07,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982327236] [2024-06-04 17:53:07,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:07,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:12,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:12,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982327236] [2024-06-04 17:53:12,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982327236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:12,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:12,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:53:12,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906692064] [2024-06-04 17:53:12,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:12,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:53:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:12,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:53:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:53:13,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:53:13,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 296 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:13,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:13,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:53:13,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:13,226 INFO L124 PetriNetUnfolderBase]: 172/332 cut-off events. [2024-06-04 17:53:13,226 INFO L125 PetriNetUnfolderBase]: For 1809/1809 co-relation queries the response was YES. [2024-06-04 17:53:13,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1410 conditions, 332 events. 172/332 cut-off events. For 1809/1809 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1325 event pairs, 40 based on Foata normal form. 1/329 useless extension candidates. Maximal degree in co-relation 1382. Up to 246 conditions per place. [2024-06-04 17:53:13,228 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 33 selfloop transitions, 26 changer transitions 0/63 dead transitions. [2024-06-04 17:53:13,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 506 flow [2024-06-04 17:53:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:53:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:53:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-04 17:53:13,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4330357142857143 [2024-06-04 17:53:13,230 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 296 flow. Second operand 7 states and 97 transitions. [2024-06-04 17:53:13,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 506 flow [2024-06-04 17:53:13,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 448 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-04 17:53:13,232 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 367 flow [2024-06-04 17:53:13,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=367, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2024-06-04 17:53:13,233 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 29 predicate places. [2024-06-04 17:53:13,233 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 367 flow [2024-06-04 17:53:13,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:13,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:13,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:13,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:53:13,234 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-04 17:53:13,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:13,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1113039599, now seen corresponding path program 4 times [2024-06-04 17:53:13,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:13,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418776105] [2024-06-04 17:53:13,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:13,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:18,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:18,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418776105] [2024-06-04 17:53:18,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418776105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:18,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:18,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:53:18,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645945389] [2024-06-04 17:53:18,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:18,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:53:18,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:18,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:53:18,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:53:18,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:53:18,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 367 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:18,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:18,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:53:18,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:18,617 INFO L124 PetriNetUnfolderBase]: 168/326 cut-off events. [2024-06-04 17:53:18,617 INFO L125 PetriNetUnfolderBase]: For 1856/1856 co-relation queries the response was YES. [2024-06-04 17:53:18,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 326 events. 168/326 cut-off events. For 1856/1856 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1318 event pairs, 40 based on Foata normal form. 2/324 useless extension candidates. Maximal degree in co-relation 1397. Up to 260 conditions per place. [2024-06-04 17:53:18,620 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 42 selfloop transitions, 18 changer transitions 0/64 dead transitions. [2024-06-04 17:53:18,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 532 flow [2024-06-04 17:53:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:53:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:53:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-04 17:53:18,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 17:53:18,622 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 367 flow. Second operand 7 states and 96 transitions. [2024-06-04 17:53:18,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 532 flow [2024-06-04 17:53:18,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 500 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-04 17:53:18,627 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 386 flow [2024-06-04 17:53:18,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=386, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-06-04 17:53:18,628 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 33 predicate places. [2024-06-04 17:53:18,628 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 386 flow [2024-06-04 17:53:18,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:18,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:18,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:18,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:53:18,629 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-04 17:53:18,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1395542115, now seen corresponding path program 1 times [2024-06-04 17:53:18,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:18,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106567385] [2024-06-04 17:53:18,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:18,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:23,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:23,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106567385] [2024-06-04 17:53:23,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106567385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:23,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:23,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:53:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512999548] [2024-06-04 17:53:23,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:23,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:53:23,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:23,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:53:23,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:53:23,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:53:23,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 386 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:23,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:23,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:53:23,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:24,252 INFO L124 PetriNetUnfolderBase]: 166/325 cut-off events. [2024-06-04 17:53:24,252 INFO L125 PetriNetUnfolderBase]: For 1961/1961 co-relation queries the response was YES. [2024-06-04 17:53:24,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 325 events. 166/325 cut-off events. For 1961/1961 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1313 event pairs, 36 based on Foata normal form. 1/325 useless extension candidates. Maximal degree in co-relation 1432. Up to 269 conditions per place. [2024-06-04 17:53:24,255 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 53 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-06-04 17:53:24,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 570 flow [2024-06-04 17:53:24,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:53:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:53:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-04 17:53:24,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4330357142857143 [2024-06-04 17:53:24,257 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 386 flow. Second operand 7 states and 97 transitions. [2024-06-04 17:53:24,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 570 flow [2024-06-04 17:53:24,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 532 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 17:53:24,262 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 401 flow [2024-06-04 17:53:24,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-06-04 17:53:24,263 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-04 17:53:24,263 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 401 flow [2024-06-04 17:53:24,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:24,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:24,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:24,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:53:24,264 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-04 17:53:24,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:24,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1489276733, now seen corresponding path program 1 times [2024-06-04 17:53:24,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:24,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410105445] [2024-06-04 17:53:24,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:24,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:29,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:29,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410105445] [2024-06-04 17:53:29,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410105445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:29,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:29,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:53:29,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826388276] [2024-06-04 17:53:29,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:29,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:53:29,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:29,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:53:29,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:53:29,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:53:29,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 401 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:29,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:29,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:53:29,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:30,037 INFO L124 PetriNetUnfolderBase]: 178/345 cut-off events. [2024-06-04 17:53:30,037 INFO L125 PetriNetUnfolderBase]: For 2561/2561 co-relation queries the response was YES. [2024-06-04 17:53:30,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 345 events. 178/345 cut-off events. For 2561/2561 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1403 event pairs, 35 based on Foata normal form. 4/348 useless extension candidates. Maximal degree in co-relation 1546. Up to 264 conditions per place. [2024-06-04 17:53:30,041 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 47 selfloop transitions, 21 changer transitions 0/72 dead transitions. [2024-06-04 17:53:30,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 72 transitions, 603 flow [2024-06-04 17:53:30,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:53:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:53:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-04 17:53:30,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42578125 [2024-06-04 17:53:30,042 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 401 flow. Second operand 8 states and 109 transitions. [2024-06-04 17:53:30,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 72 transitions, 603 flow [2024-06-04 17:53:30,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 72 transitions, 566 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-04 17:53:30,046 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 447 flow [2024-06-04 17:53:30,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=447, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2024-06-04 17:53:30,047 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2024-06-04 17:53:30,047 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 447 flow [2024-06-04 17:53:30,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:30,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:30,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:30,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:53:30,048 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-04 17:53:30,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:30,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2083057265, now seen corresponding path program 2 times [2024-06-04 17:53:30,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:30,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686154216] [2024-06-04 17:53:30,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:30,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:35,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:35,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686154216] [2024-06-04 17:53:35,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686154216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:35,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:35,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:53:35,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545115069] [2024-06-04 17:53:35,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:35,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:53:35,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:35,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:53:35,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:53:35,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:53:35,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 447 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:35,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:35,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:53:35,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:35,491 INFO L124 PetriNetUnfolderBase]: 191/366 cut-off events. [2024-06-04 17:53:35,504 INFO L125 PetriNetUnfolderBase]: For 3058/3058 co-relation queries the response was YES. [2024-06-04 17:53:35,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 366 events. 191/366 cut-off events. For 3058/3058 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1500 event pairs, 37 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 1755. Up to 252 conditions per place. [2024-06-04 17:53:35,507 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 44 selfloop transitions, 33 changer transitions 0/81 dead transitions. [2024-06-04 17:53:35,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 81 transitions, 783 flow [2024-06-04 17:53:35,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:53:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:53:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-06-04 17:53:35,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43359375 [2024-06-04 17:53:35,509 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 447 flow. Second operand 8 states and 111 transitions. [2024-06-04 17:53:35,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 81 transitions, 783 flow [2024-06-04 17:53:35,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 81 transitions, 702 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-04 17:53:35,517 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 574 flow [2024-06-04 17:53:35,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=574, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-06-04 17:53:35,518 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2024-06-04 17:53:35,518 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 574 flow [2024-06-04 17:53:35,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:35,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:35,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:35,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:53:35,519 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-04 17:53:35,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:35,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1662005633, now seen corresponding path program 3 times [2024-06-04 17:53:35,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:35,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590559179] [2024-06-04 17:53:35,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:35,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:42,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:42,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590559179] [2024-06-04 17:53:42,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590559179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:42,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:42,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:53:42,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365041909] [2024-06-04 17:53:42,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:42,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:53:42,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:42,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:53:42,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:53:42,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:53:42,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 574 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:42,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:42,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:53:42,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:42,784 INFO L124 PetriNetUnfolderBase]: 192/370 cut-off events. [2024-06-04 17:53:42,784 INFO L125 PetriNetUnfolderBase]: For 3573/3573 co-relation queries the response was YES. [2024-06-04 17:53:42,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 370 events. 192/370 cut-off events. For 3573/3573 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1524 event pairs, 38 based on Foata normal form. 2/371 useless extension candidates. Maximal degree in co-relation 1859. Up to 318 conditions per place. [2024-06-04 17:53:42,787 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 64 selfloop transitions, 14 changer transitions 0/82 dead transitions. [2024-06-04 17:53:42,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 82 transitions, 775 flow [2024-06-04 17:53:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:53:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:53:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-04 17:53:42,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 17:53:42,789 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 574 flow. Second operand 8 states and 104 transitions. [2024-06-04 17:53:42,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 82 transitions, 775 flow [2024-06-04 17:53:42,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 82 transitions, 739 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-04 17:53:42,793 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 597 flow [2024-06-04 17:53:42,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=597, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2024-06-04 17:53:42,794 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 47 predicate places. [2024-06-04 17:53:42,794 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 597 flow [2024-06-04 17:53:42,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:42,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:42,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:42,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:53:42,795 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-04 17:53:42,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:42,795 INFO L85 PathProgramCache]: Analyzing trace with hash -144488451, now seen corresponding path program 4 times [2024-06-04 17:53:42,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:42,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108536203] [2024-06-04 17:53:42,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:42,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:49,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:49,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108536203] [2024-06-04 17:53:49,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108536203] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:49,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:49,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:53:49,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387405620] [2024-06-04 17:53:49,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:49,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:53:49,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:49,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:53:49,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:53:49,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:53:49,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 597 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:49,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:49,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:53:49,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:49,690 INFO L124 PetriNetUnfolderBase]: 188/364 cut-off events. [2024-06-04 17:53:49,690 INFO L125 PetriNetUnfolderBase]: For 3661/3661 co-relation queries the response was YES. [2024-06-04 17:53:49,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1865 conditions, 364 events. 188/364 cut-off events. For 3661/3661 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1489 event pairs, 37 based on Foata normal form. 2/362 useless extension candidates. Maximal degree in co-relation 1827. Up to 288 conditions per place. [2024-06-04 17:53:49,693 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 58 selfloop transitions, 21 changer transitions 0/83 dead transitions. [2024-06-04 17:53:49,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 83 transitions, 784 flow [2024-06-04 17:53:49,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:53:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:53:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-04 17:53:49,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-04 17:53:49,694 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 597 flow. Second operand 8 states and 108 transitions. [2024-06-04 17:53:49,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 83 transitions, 784 flow [2024-06-04 17:53:49,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 83 transitions, 712 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-04 17:53:49,699 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 580 flow [2024-06-04 17:53:49,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=580, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2024-06-04 17:53:49,700 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-06-04 17:53:49,700 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 580 flow [2024-06-04 17:53:49,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:49,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:49,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:49,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:53:49,701 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-04 17:53:49,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash -135906659, now seen corresponding path program 1 times [2024-06-04 17:53:49,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:49,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382243620] [2024-06-04 17:53:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:49,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:53:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:53:55,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:53:55,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382243620] [2024-06-04 17:53:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382243620] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:53:55,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:53:55,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:53:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164739072] [2024-06-04 17:53:55,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:53:55,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:53:55,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:53:55,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:53:55,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:53:55,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:53:55,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 580 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:55,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:53:55,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:53:55,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:53:55,677 INFO L124 PetriNetUnfolderBase]: 185/359 cut-off events. [2024-06-04 17:53:55,678 INFO L125 PetriNetUnfolderBase]: For 3746/3746 co-relation queries the response was YES. [2024-06-04 17:53:55,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 359 events. 185/359 cut-off events. For 3746/3746 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1466 event pairs, 37 based on Foata normal form. 2/360 useless extension candidates. Maximal degree in co-relation 1796. Up to 309 conditions per place. [2024-06-04 17:53:55,680 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 68 selfloop transitions, 12 changer transitions 0/84 dead transitions. [2024-06-04 17:53:55,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 84 transitions, 769 flow [2024-06-04 17:53:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:53:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:53:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-04 17:53:55,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-04 17:53:55,682 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 580 flow. Second operand 8 states and 102 transitions. [2024-06-04 17:53:55,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 84 transitions, 769 flow [2024-06-04 17:53:55,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 84 transitions, 719 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 17:53:55,687 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 558 flow [2024-06-04 17:53:55,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2024-06-04 17:53:55,688 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2024-06-04 17:53:55,688 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 558 flow [2024-06-04 17:53:55,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:53:55,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:53:55,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:53:55,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:53:55,689 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-04 17:53:55,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:53:55,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1357459054, now seen corresponding path program 1 times [2024-06-04 17:53:55,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:53:55,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956775352] [2024-06-04 17:53:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:53:55,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:53:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:00,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:00,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956775352] [2024-06-04 17:54:00,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956775352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:00,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:00,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:54:00,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964526575] [2024-06-04 17:54:00,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:00,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:54:00,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:00,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:54:00,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:54:00,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:54:00,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 558 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:00,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:00,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:54:00,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:01,242 INFO L124 PetriNetUnfolderBase]: 188/366 cut-off events. [2024-06-04 17:54:01,243 INFO L125 PetriNetUnfolderBase]: For 3785/3785 co-relation queries the response was YES. [2024-06-04 17:54:01,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1857 conditions, 366 events. 188/366 cut-off events. For 3785/3785 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1493 event pairs, 32 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 1817. Up to 303 conditions per place. [2024-06-04 17:54:01,246 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 71 selfloop transitions, 14 changer transitions 0/89 dead transitions. [2024-06-04 17:54:01,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 788 flow [2024-06-04 17:54:01,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:54:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:54:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-04 17:54:01,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-04 17:54:01,247 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 558 flow. Second operand 8 states and 108 transitions. [2024-06-04 17:54:01,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 788 flow [2024-06-04 17:54:01,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 760 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 17:54:01,253 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 591 flow [2024-06-04 17:54:01,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=591, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2024-06-04 17:54:01,254 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2024-06-04 17:54:01,254 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 591 flow [2024-06-04 17:54:01,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:01,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:01,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:01,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:54:01,254 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-04 17:54:01,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:01,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1209642064, now seen corresponding path program 2 times [2024-06-04 17:54:01,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:01,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106554603] [2024-06-04 17:54:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:01,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:09,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:09,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106554603] [2024-06-04 17:54:09,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106554603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:09,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:09,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:54:09,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482775485] [2024-06-04 17:54:09,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:09,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:54:09,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:09,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:54:09,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:54:09,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:54:09,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 591 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:09,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:09,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:54:09,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:09,614 INFO L124 PetriNetUnfolderBase]: 191/373 cut-off events. [2024-06-04 17:54:09,615 INFO L125 PetriNetUnfolderBase]: For 4274/4274 co-relation queries the response was YES. [2024-06-04 17:54:09,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 373 events. 191/373 cut-off events. For 4274/4274 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1542 event pairs, 32 based on Foata normal form. 1/373 useless extension candidates. Maximal degree in co-relation 1900. Up to 297 conditions per place. [2024-06-04 17:54:09,633 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 65 selfloop transitions, 20 changer transitions 0/89 dead transitions. [2024-06-04 17:54:09,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 89 transitions, 819 flow [2024-06-04 17:54:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:54:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:54:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-04 17:54:09,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2024-06-04 17:54:09,637 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 591 flow. Second operand 8 states and 107 transitions. [2024-06-04 17:54:09,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 89 transitions, 819 flow [2024-06-04 17:54:09,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 89 transitions, 774 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 17:54:09,660 INFO L231 Difference]: Finished difference. Result has 86 places, 78 transitions, 624 flow [2024-06-04 17:54:09,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=624, PETRI_PLACES=86, PETRI_TRANSITIONS=78} [2024-06-04 17:54:09,661 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 55 predicate places. [2024-06-04 17:54:09,661 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 78 transitions, 624 flow [2024-06-04 17:54:09,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:09,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:09,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:09,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:54:09,662 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-04 17:54:09,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash -17699554, now seen corresponding path program 3 times [2024-06-04 17:54:09,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:09,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897163717] [2024-06-04 17:54:09,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:09,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:16,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:16,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897163717] [2024-06-04 17:54:16,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897163717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:16,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:16,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:54:16,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393410613] [2024-06-04 17:54:16,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:16,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:54:16,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:16,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:54:16,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:54:16,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:54:16,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 78 transitions, 624 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:16,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:16,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:54:16,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:16,438 INFO L124 PetriNetUnfolderBase]: 194/378 cut-off events. [2024-06-04 17:54:16,439 INFO L125 PetriNetUnfolderBase]: For 4889/4889 co-relation queries the response was YES. [2024-06-04 17:54:16,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 378 events. 194/378 cut-off events. For 4889/4889 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1579 event pairs, 35 based on Foata normal form. 1/375 useless extension candidates. Maximal degree in co-relation 1985. Up to 274 conditions per place. [2024-06-04 17:54:16,441 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 57 selfloop transitions, 30 changer transitions 0/91 dead transitions. [2024-06-04 17:54:16,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 922 flow [2024-06-04 17:54:16,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:54:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:54:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-04 17:54:16,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-04 17:54:16,443 INFO L175 Difference]: Start difference. First operand has 86 places, 78 transitions, 624 flow. Second operand 8 states and 108 transitions. [2024-06-04 17:54:16,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 922 flow [2024-06-04 17:54:16,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 91 transitions, 862 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-04 17:54:16,450 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 697 flow [2024-06-04 17:54:16,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=697, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2024-06-04 17:54:16,450 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 57 predicate places. [2024-06-04 17:54:16,451 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 697 flow [2024-06-04 17:54:16,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:16,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:16,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:16,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:54:16,451 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-04 17:54:16,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:16,452 INFO L85 PathProgramCache]: Analyzing trace with hash -24849394, now seen corresponding path program 4 times [2024-06-04 17:54:16,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:16,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211335429] [2024-06-04 17:54:16,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:16,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:23,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:23,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211335429] [2024-06-04 17:54:23,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211335429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:23,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:23,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:54:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647905817] [2024-06-04 17:54:23,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:23,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:54:23,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:23,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:54:23,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:54:23,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:54:23,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 697 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:23,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:23,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:54:23,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:23,501 INFO L124 PetriNetUnfolderBase]: 192/375 cut-off events. [2024-06-04 17:54:23,502 INFO L125 PetriNetUnfolderBase]: For 5170/5170 co-relation queries the response was YES. [2024-06-04 17:54:23,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 375 events. 192/375 cut-off events. For 5170/5170 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1571 event pairs, 35 based on Foata normal form. 1/372 useless extension candidates. Maximal degree in co-relation 1988. Up to 298 conditions per place. [2024-06-04 17:54:23,505 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 67 selfloop transitions, 20 changer transitions 0/91 dead transitions. [2024-06-04 17:54:23,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 895 flow [2024-06-04 17:54:23,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:54:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:54:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-04 17:54:23,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2024-06-04 17:54:23,509 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 697 flow. Second operand 8 states and 107 transitions. [2024-06-04 17:54:23,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 895 flow [2024-06-04 17:54:23,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 91 transitions, 830 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-04 17:54:23,517 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 677 flow [2024-06-04 17:54:23,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=677, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2024-06-04 17:54:23,517 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 61 predicate places. [2024-06-04 17:54:23,518 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 677 flow [2024-06-04 17:54:23,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:23,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:23,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:23,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:54:23,518 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-04 17:54:23,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:23,519 INFO L85 PathProgramCache]: Analyzing trace with hash 72326606, now seen corresponding path program 1 times [2024-06-04 17:54:23,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:23,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518901453] [2024-06-04 17:54:23,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:23,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:29,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:29,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518901453] [2024-06-04 17:54:29,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518901453] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:29,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:29,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:54:29,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603871988] [2024-06-04 17:54:29,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:29,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:54:29,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:29,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:54:29,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:54:29,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:54:29,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 677 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-04 17:54:29,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:29,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:54:29,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:29,796 INFO L124 PetriNetUnfolderBase]: 195/380 cut-off events. [2024-06-04 17:54:29,796 INFO L125 PetriNetUnfolderBase]: For 5333/5333 co-relation queries the response was YES. [2024-06-04 17:54:29,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 380 events. 195/380 cut-off events. For 5333/5333 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1592 event pairs, 35 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 2033. Up to 260 conditions per place. [2024-06-04 17:54:29,799 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 53 selfloop transitions, 36 changer transitions 0/93 dead transitions. [2024-06-04 17:54:29,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 93 transitions, 901 flow [2024-06-04 17:54:29,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:54:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:54:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 17:54:29,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-04 17:54:29,808 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 677 flow. Second operand 9 states and 111 transitions. [2024-06-04 17:54:29,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 93 transitions, 901 flow [2024-06-04 17:54:29,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 816 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 17:54:29,815 INFO L231 Difference]: Finished difference. Result has 93 places, 84 transitions, 697 flow [2024-06-04 17:54:29,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=697, PETRI_PLACES=93, PETRI_TRANSITIONS=84} [2024-06-04 17:54:29,815 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 62 predicate places. [2024-06-04 17:54:29,815 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 84 transitions, 697 flow [2024-06-04 17:54:29,815 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-04 17:54:29,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:29,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:29,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:54:29,816 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-04 17:54:29,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:29,816 INFO L85 PathProgramCache]: Analyzing trace with hash -184173904, now seen corresponding path program 2 times [2024-06-04 17:54:29,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:29,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940096692] [2024-06-04 17:54:29,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:29,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:35,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940096692] [2024-06-04 17:54:35,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940096692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:35,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:35,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:54:35,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957059002] [2024-06-04 17:54:35,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:35,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:54:35,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:35,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:54:35,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:54:35,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:54:35,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 84 transitions, 697 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:35,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:35,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:54:35,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:35,755 INFO L124 PetriNetUnfolderBase]: 196/382 cut-off events. [2024-06-04 17:54:35,755 INFO L125 PetriNetUnfolderBase]: For 5993/5993 co-relation queries the response was YES. [2024-06-04 17:54:35,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2088 conditions, 382 events. 196/382 cut-off events. For 5993/5993 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1599 event pairs, 35 based on Foata normal form. 2/380 useless extension candidates. Maximal degree in co-relation 2043. Up to 296 conditions per place. [2024-06-04 17:54:35,758 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 69 selfloop transitions, 24 changer transitions 0/97 dead transitions. [2024-06-04 17:54:35,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 97 transitions, 961 flow [2024-06-04 17:54:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:54:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:54:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-04 17:54:35,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-04 17:54:35,760 INFO L175 Difference]: Start difference. First operand has 93 places, 84 transitions, 697 flow. Second operand 9 states and 120 transitions. [2024-06-04 17:54:35,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 97 transitions, 961 flow [2024-06-04 17:54:35,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 97 transitions, 872 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-04 17:54:35,770 INFO L231 Difference]: Finished difference. Result has 95 places, 87 transitions, 720 flow [2024-06-04 17:54:35,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=720, PETRI_PLACES=95, PETRI_TRANSITIONS=87} [2024-06-04 17:54:35,770 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-04 17:54:35,771 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 87 transitions, 720 flow [2024-06-04 17:54:35,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:35,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:35,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:35,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:54:35,771 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-04 17:54:35,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:35,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1089015044, now seen corresponding path program 1 times [2024-06-04 17:54:35,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:35,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544578221] [2024-06-04 17:54:35,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:35,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:40,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:40,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544578221] [2024-06-04 17:54:40,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544578221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:40,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:40,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:54:40,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014713698] [2024-06-04 17:54:40,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:40,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:54:40,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:40,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:54:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:54:40,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:54:40,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 720 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:40,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:40,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:54:40,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:40,688 INFO L124 PetriNetUnfolderBase]: 200/392 cut-off events. [2024-06-04 17:54:40,688 INFO L125 PetriNetUnfolderBase]: For 6455/6455 co-relation queries the response was YES. [2024-06-04 17:54:40,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2134 conditions, 392 events. 200/392 cut-off events. For 6455/6455 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1656 event pairs, 13 based on Foata normal form. 2/393 useless extension candidates. Maximal degree in co-relation 2088. Up to 305 conditions per place. [2024-06-04 17:54:40,691 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 87 selfloop transitions, 12 changer transitions 0/103 dead transitions. [2024-06-04 17:54:40,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 103 transitions, 968 flow [2024-06-04 17:54:40,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:54:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:54:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-04 17:54:40,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2024-06-04 17:54:40,693 INFO L175 Difference]: Start difference. First operand has 95 places, 87 transitions, 720 flow. Second operand 8 states and 107 transitions. [2024-06-04 17:54:40,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 103 transitions, 968 flow [2024-06-04 17:54:40,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 103 transitions, 878 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-04 17:54:40,701 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 670 flow [2024-06-04 17:54:40,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=670, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2024-06-04 17:54:40,702 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 65 predicate places. [2024-06-04 17:54:40,702 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 670 flow [2024-06-04 17:54:40,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:40,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:40,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:40,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:54:40,703 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-04 17:54:40,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash 865641566, now seen corresponding path program 2 times [2024-06-04 17:54:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:40,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309719596] [2024-06-04 17:54:40,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:40,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:45,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:45,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309719596] [2024-06-04 17:54:45,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309719596] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:45,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:45,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:54:45,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152280272] [2024-06-04 17:54:45,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:45,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:54:45,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:45,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:54:45,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:54:45,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:54:45,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 670 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:45,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:45,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:54:45,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:45,530 INFO L124 PetriNetUnfolderBase]: 204/400 cut-off events. [2024-06-04 17:54:45,531 INFO L125 PetriNetUnfolderBase]: For 6747/6747 co-relation queries the response was YES. [2024-06-04 17:54:45,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 400 events. 204/400 cut-off events. For 6747/6747 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1708 event pairs, 30 based on Foata normal form. 2/401 useless extension candidates. Maximal degree in co-relation 2076. Up to 330 conditions per place. [2024-06-04 17:54:45,534 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 86 selfloop transitions, 13 changer transitions 0/103 dead transitions. [2024-06-04 17:54:45,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 103 transitions, 918 flow [2024-06-04 17:54:45,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:54:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:54:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-04 17:54:45,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-04 17:54:45,535 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 670 flow. Second operand 8 states and 108 transitions. [2024-06-04 17:54:45,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 103 transitions, 918 flow [2024-06-04 17:54:45,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 103 transitions, 888 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 17:54:45,544 INFO L231 Difference]: Finished difference. Result has 98 places, 89 transitions, 684 flow [2024-06-04 17:54:45,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=684, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2024-06-04 17:54:45,544 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-04 17:54:45,544 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 684 flow [2024-06-04 17:54:45,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:45,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:45,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:45,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:54:45,545 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-04 17:54:45,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:45,545 INFO L85 PathProgramCache]: Analyzing trace with hash 868443036, now seen corresponding path program 1 times [2024-06-04 17:54:45,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:45,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71907104] [2024-06-04 17:54:45,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:45,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:50,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:50,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71907104] [2024-06-04 17:54:50,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71907104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:50,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:50,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:54:50,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912718832] [2024-06-04 17:54:50,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:50,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:54:50,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:50,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:54:50,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:54:50,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:54:50,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 684 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:50,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:50,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:54:50,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:50,893 INFO L124 PetriNetUnfolderBase]: 210/412 cut-off events. [2024-06-04 17:54:50,893 INFO L125 PetriNetUnfolderBase]: For 7520/7520 co-relation queries the response was YES. [2024-06-04 17:54:50,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 412 events. 210/412 cut-off events. For 7520/7520 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1761 event pairs, 28 based on Foata normal form. 2/413 useless extension candidates. Maximal degree in co-relation 2174. Up to 337 conditions per place. [2024-06-04 17:54:50,896 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 86 selfloop transitions, 16 changer transitions 0/106 dead transitions. [2024-06-04 17:54:50,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 106 transitions, 968 flow [2024-06-04 17:54:50,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:54:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:54:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-04 17:54:50,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-04 17:54:50,901 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 684 flow. Second operand 9 states and 120 transitions. [2024-06-04 17:54:50,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 106 transitions, 968 flow [2024-06-04 17:54:50,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 106 transitions, 934 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 17:54:50,914 INFO L231 Difference]: Finished difference. Result has 101 places, 91 transitions, 729 flow [2024-06-04 17:54:50,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=729, PETRI_PLACES=101, PETRI_TRANSITIONS=91} [2024-06-04 17:54:50,920 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 70 predicate places. [2024-06-04 17:54:50,920 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 91 transitions, 729 flow [2024-06-04 17:54:50,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:50,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:50,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:50,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:54:50,921 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-04 17:54:50,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:50,922 INFO L85 PathProgramCache]: Analyzing trace with hash 964175740, now seen corresponding path program 3 times [2024-06-04 17:54:50,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:50,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821160061] [2024-06-04 17:54:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:50,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:54:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:54:56,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:54:56,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821160061] [2024-06-04 17:54:56,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821160061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:54:56,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:54:56,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:54:56,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039696046] [2024-06-04 17:54:56,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:54:56,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:54:56,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:54:56,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:54:56,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:54:56,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:54:56,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 91 transitions, 729 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:56,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:54:56,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:54:56,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:54:56,641 INFO L124 PetriNetUnfolderBase]: 214/420 cut-off events. [2024-06-04 17:54:56,642 INFO L125 PetriNetUnfolderBase]: For 8101/8101 co-relation queries the response was YES. [2024-06-04 17:54:56,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 420 events. 214/420 cut-off events. For 8101/8101 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1816 event pairs, 28 based on Foata normal form. 2/421 useless extension candidates. Maximal degree in co-relation 2247. Up to 349 conditions per place. [2024-06-04 17:54:56,646 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 86 selfloop transitions, 16 changer transitions 0/106 dead transitions. [2024-06-04 17:54:56,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 106 transitions, 1005 flow [2024-06-04 17:54:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:54:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:54:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-04 17:54:56,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-04 17:54:56,647 INFO L175 Difference]: Start difference. First operand has 101 places, 91 transitions, 729 flow. Second operand 8 states and 105 transitions. [2024-06-04 17:54:56,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 106 transitions, 1005 flow [2024-06-04 17:54:56,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 106 transitions, 942 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-04 17:54:56,657 INFO L231 Difference]: Finished difference. Result has 103 places, 95 transitions, 756 flow [2024-06-04 17:54:56,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=756, PETRI_PLACES=103, PETRI_TRANSITIONS=95} [2024-06-04 17:54:56,662 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-04 17:54:56,662 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 95 transitions, 756 flow [2024-06-04 17:54:56,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:54:56,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:54:56,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:54:56,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:54:56,663 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-04 17:54:56,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:54:56,663 INFO L85 PathProgramCache]: Analyzing trace with hash 970609790, now seen corresponding path program 2 times [2024-06-04 17:54:56,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:54:56,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290445259] [2024-06-04 17:54:56,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:54:56,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:54:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:02,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:02,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290445259] [2024-06-04 17:55:02,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290445259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:02,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:02,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:55:02,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984230364] [2024-06-04 17:55:02,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:02,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:55:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:02,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:55:02,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:55:03,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:55:03,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 95 transitions, 756 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:03,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:03,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:55:03,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:03,320 INFO L124 PetriNetUnfolderBase]: 232/455 cut-off events. [2024-06-04 17:55:03,321 INFO L125 PetriNetUnfolderBase]: For 10022/10022 co-relation queries the response was YES. [2024-06-04 17:55:03,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2608 conditions, 455 events. 232/455 cut-off events. For 10022/10022 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2032 event pairs, 28 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 2557. Up to 335 conditions per place. [2024-06-04 17:55:03,324 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 80 selfloop transitions, 32 changer transitions 0/116 dead transitions. [2024-06-04 17:55:03,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 116 transitions, 1247 flow [2024-06-04 17:55:03,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:55:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:55:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-06-04 17:55:03,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-04 17:55:03,326 INFO L175 Difference]: Start difference. First operand has 103 places, 95 transitions, 756 flow. Second operand 9 states and 124 transitions. [2024-06-04 17:55:03,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 116 transitions, 1247 flow [2024-06-04 17:55:03,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 116 transitions, 1206 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-04 17:55:03,337 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 910 flow [2024-06-04 17:55:03,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=910, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2024-06-04 17:55:03,337 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 76 predicate places. [2024-06-04 17:55:03,338 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 910 flow [2024-06-04 17:55:03,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:03,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:03,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-04 17:55:03,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:55:03,338 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-04 17:55:03,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:03,339 INFO L85 PathProgramCache]: Analyzing trace with hash 970846940, now seen corresponding path program 3 times [2024-06-04 17:55:03,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:03,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317575918] [2024-06-04 17:55:03,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:03,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:11,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317575918] [2024-06-04 17:55:11,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317575918] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:11,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:11,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:55:11,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676463134] [2024-06-04 17:55:11,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:11,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:55:11,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:11,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:55:11,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:55:11,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:55:11,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 910 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:11,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:11,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:55:11,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:11,747 INFO L124 PetriNetUnfolderBase]: 228/449 cut-off events. [2024-06-04 17:55:11,747 INFO L125 PetriNetUnfolderBase]: For 10403/10403 co-relation queries the response was YES. [2024-06-04 17:55:11,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2579 conditions, 449 events. 228/449 cut-off events. For 10403/10403 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2011 event pairs, 28 based on Foata normal form. 2/450 useless extension candidates. Maximal degree in co-relation 2527. Up to 332 conditions per place. [2024-06-04 17:55:11,751 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 80 selfloop transitions, 31 changer transitions 0/115 dead transitions. [2024-06-04 17:55:11,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 115 transitions, 1225 flow [2024-06-04 17:55:11,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:55:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:55:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-04 17:55:11,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2024-06-04 17:55:11,758 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 910 flow. Second operand 9 states and 122 transitions. [2024-06-04 17:55:11,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 115 transitions, 1225 flow [2024-06-04 17:55:11,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 115 transitions, 1143 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-06-04 17:55:11,769 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 897 flow [2024-06-04 17:55:11,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=897, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2024-06-04 17:55:11,770 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 81 predicate places. [2024-06-04 17:55:11,770 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 897 flow [2024-06-04 17:55:11,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:11,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:11,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:11,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:55:11,770 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-04 17:55:11,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:11,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1156048508, now seen corresponding path program 1 times [2024-06-04 17:55:11,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:11,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072677968] [2024-06-04 17:55:11,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:11,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:18,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072677968] [2024-06-04 17:55:18,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072677968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:18,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:18,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:55:18,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105260067] [2024-06-04 17:55:18,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:18,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:55:18,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:18,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:55:18,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:55:18,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:55:18,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 897 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:18,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:18,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:55:18,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:19,014 INFO L124 PetriNetUnfolderBase]: 244/485 cut-off events. [2024-06-04 17:55:19,015 INFO L125 PetriNetUnfolderBase]: For 14040/14040 co-relation queries the response was YES. [2024-06-04 17:55:19,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2780 conditions, 485 events. 244/485 cut-off events. For 14040/14040 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2214 event pairs, 32 based on Foata normal form. 10/494 useless extension candidates. Maximal degree in co-relation 2726. Up to 350 conditions per place. [2024-06-04 17:55:19,018 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 86 selfloop transitions, 26 changer transitions 4/120 dead transitions. [2024-06-04 17:55:19,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 1236 flow [2024-06-04 17:55:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:55:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:55:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-04 17:55:19,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-04 17:55:19,020 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 897 flow. Second operand 10 states and 134 transitions. [2024-06-04 17:55:19,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 120 transitions, 1236 flow [2024-06-04 17:55:19,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 120 transitions, 1174 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 17:55:19,033 INFO L231 Difference]: Finished difference. Result has 116 places, 103 transitions, 918 flow [2024-06-04 17:55:19,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=918, PETRI_PLACES=116, PETRI_TRANSITIONS=103} [2024-06-04 17:55:19,033 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2024-06-04 17:55:19,034 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 103 transitions, 918 flow [2024-06-04 17:55:19,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:19,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:19,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:19,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:55:19,034 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-04 17:55:19,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:19,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1421103044, now seen corresponding path program 4 times [2024-06-04 17:55:19,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:19,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386243108] [2024-06-04 17:55:19,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:19,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:24,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:24,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386243108] [2024-06-04 17:55:24,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386243108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:24,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:24,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:55:24,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197714729] [2024-06-04 17:55:24,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:24,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:55:24,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:24,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:55:24,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:55:24,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:55:24,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 103 transitions, 918 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:24,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:24,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:55:24,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:24,467 INFO L124 PetriNetUnfolderBase]: 235/468 cut-off events. [2024-06-04 17:55:24,468 INFO L125 PetriNetUnfolderBase]: For 10704/10704 co-relation queries the response was YES. [2024-06-04 17:55:24,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2665 conditions, 468 events. 235/468 cut-off events. For 10704/10704 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2142 event pairs, 34 based on Foata normal form. 2/466 useless extension candidates. Maximal degree in co-relation 2609. Up to 386 conditions per place. [2024-06-04 17:55:24,471 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 89 selfloop transitions, 20 changer transitions 0/113 dead transitions. [2024-06-04 17:55:24,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 113 transitions, 1168 flow [2024-06-04 17:55:24,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:55:24,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:55:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-04 17:55:24,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2024-06-04 17:55:24,473 INFO L175 Difference]: Start difference. First operand has 116 places, 103 transitions, 918 flow. Second operand 8 states and 105 transitions. [2024-06-04 17:55:24,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 113 transitions, 1168 flow [2024-06-04 17:55:24,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 113 transitions, 1106 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:55:24,487 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 910 flow [2024-06-04 17:55:24,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=910, PETRI_PLACES=117, PETRI_TRANSITIONS=104} [2024-06-04 17:55:24,488 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 86 predicate places. [2024-06-04 17:55:24,488 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 910 flow [2024-06-04 17:55:24,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:24,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:24,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:24,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:55:24,488 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-04 17:55:24,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2044807056, now seen corresponding path program 4 times [2024-06-04 17:55:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:24,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275475394] [2024-06-04 17:55:24,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:24,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:30,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-04 17:55:30,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:30,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275475394] [2024-06-04 17:55:30,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275475394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:30,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:30,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:55:30,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403896687] [2024-06-04 17:55:30,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:30,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:55:30,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:30,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:55:30,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:55:30,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:55:30,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 104 transitions, 910 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:30,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:30,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:55:30,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:31,219 INFO L124 PetriNetUnfolderBase]: 246/492 cut-off events. [2024-06-04 17:55:31,219 INFO L125 PetriNetUnfolderBase]: For 12295/12295 co-relation queries the response was YES. [2024-06-04 17:55:31,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2856 conditions, 492 events. 246/492 cut-off events. For 12295/12295 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2278 event pairs, 35 based on Foata normal form. 2/493 useless extension candidates. Maximal degree in co-relation 2799. Up to 412 conditions per place. [2024-06-04 17:55:31,222 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 96 selfloop transitions, 19 changer transitions 0/119 dead transitions. [2024-06-04 17:55:31,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 119 transitions, 1324 flow [2024-06-04 17:55:31,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:55:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:55:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 17:55:31,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-04 17:55:31,224 INFO L175 Difference]: Start difference. First operand has 117 places, 104 transitions, 910 flow. Second operand 9 states and 118 transitions. [2024-06-04 17:55:31,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 119 transitions, 1324 flow [2024-06-04 17:55:31,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 119 transitions, 1235 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:55:31,239 INFO L231 Difference]: Finished difference. Result has 118 places, 109 transitions, 970 flow [2024-06-04 17:55:31,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=970, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2024-06-04 17:55:31,239 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 87 predicate places. [2024-06-04 17:55:31,239 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 970 flow [2024-06-04 17:55:31,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:31,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:31,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:31,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:55:31,240 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-04 17:55:31,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:31,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1414431844, now seen corresponding path program 5 times [2024-06-04 17:55:31,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:31,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204365732] [2024-06-04 17:55:31,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:31,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:39,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:39,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204365732] [2024-06-04 17:55:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204365732] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:39,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:39,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:55:39,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296503911] [2024-06-04 17:55:39,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:39,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:55:39,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:39,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:55:39,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:55:39,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:55:39,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 970 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:39,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:39,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:55:39,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:39,493 INFO L124 PetriNetUnfolderBase]: 262/520 cut-off events. [2024-06-04 17:55:39,493 INFO L125 PetriNetUnfolderBase]: For 14876/14876 co-relation queries the response was YES. [2024-06-04 17:55:39,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3186 conditions, 520 events. 262/520 cut-off events. For 14876/14876 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2447 event pairs, 34 based on Foata normal form. 2/518 useless extension candidates. Maximal degree in co-relation 3129. Up to 398 conditions per place. [2024-06-04 17:55:39,496 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 89 selfloop transitions, 32 changer transitions 0/125 dead transitions. [2024-06-04 17:55:39,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 125 transitions, 1416 flow [2024-06-04 17:55:39,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:55:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:55:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-04 17:55:39,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2024-06-04 17:55:39,497 INFO L175 Difference]: Start difference. First operand has 118 places, 109 transitions, 970 flow. Second operand 9 states and 122 transitions. [2024-06-04 17:55:39,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 125 transitions, 1416 flow [2024-06-04 17:55:39,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 125 transitions, 1345 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-04 17:55:39,513 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 1084 flow [2024-06-04 17:55:39,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1084, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2024-06-04 17:55:39,513 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 91 predicate places. [2024-06-04 17:55:39,514 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 1084 flow [2024-06-04 17:55:39,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:39,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:39,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:39,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:55:39,514 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-04 17:55:39,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:39,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1420925104, now seen corresponding path program 6 times [2024-06-04 17:55:39,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:39,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188607271] [2024-06-04 17:55:39,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:39,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:45,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188607271] [2024-06-04 17:55:45,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188607271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:45,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:45,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:55:45,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676318762] [2024-06-04 17:55:45,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:45,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:55:45,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:45,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:55:45,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:55:45,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:55:45,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 1084 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:45,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:45,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:55:45,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:46,026 INFO L124 PetriNetUnfolderBase]: 260/517 cut-off events. [2024-06-04 17:55:46,026 INFO L125 PetriNetUnfolderBase]: For 14230/14230 co-relation queries the response was YES. [2024-06-04 17:55:46,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3176 conditions, 517 events. 260/517 cut-off events. For 14230/14230 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2443 event pairs, 34 based on Foata normal form. 1/514 useless extension candidates. Maximal degree in co-relation 3117. Up to 397 conditions per place. [2024-06-04 17:55:46,030 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 88 selfloop transitions, 34 changer transitions 0/126 dead transitions. [2024-06-04 17:55:46,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 126 transitions, 1462 flow [2024-06-04 17:55:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:55:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:55:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-04 17:55:46,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-06-04 17:55:46,032 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 1084 flow. Second operand 9 states and 123 transitions. [2024-06-04 17:55:46,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 126 transitions, 1462 flow [2024-06-04 17:55:46,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 126 transitions, 1367 flow, removed 33 selfloop flow, removed 5 redundant places. [2024-06-04 17:55:46,049 INFO L231 Difference]: Finished difference. Result has 126 places, 116 transitions, 1108 flow [2024-06-04 17:55:46,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1108, PETRI_PLACES=126, PETRI_TRANSITIONS=116} [2024-06-04 17:55:46,049 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 95 predicate places. [2024-06-04 17:55:46,049 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 116 transitions, 1108 flow [2024-06-04 17:55:46,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:46,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:46,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:46,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:55:46,050 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-04 17:55:46,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:46,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2052850626, now seen corresponding path program 7 times [2024-06-04 17:55:46,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:46,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491657671] [2024-06-04 17:55:46,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:46,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:55:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:55:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:55:53,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491657671] [2024-06-04 17:55:53,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491657671] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:55:53,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:55:53,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:55:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255709585] [2024-06-04 17:55:53,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:55:53,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:55:53,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:55:53,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:55:53,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:55:53,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:55:53,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 116 transitions, 1108 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:53,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:55:53,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:55:53,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:55:53,603 INFO L124 PetriNetUnfolderBase]: 266/527 cut-off events. [2024-06-04 17:55:53,603 INFO L125 PetriNetUnfolderBase]: For 15241/15241 co-relation queries the response was YES. [2024-06-04 17:55:53,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3286 conditions, 527 events. 266/527 cut-off events. For 15241/15241 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2489 event pairs, 34 based on Foata normal form. 2/525 useless extension candidates. Maximal degree in co-relation 3225. Up to 303 conditions per place. [2024-06-04 17:55:53,609 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 73 selfloop transitions, 57 changer transitions 0/134 dead transitions. [2024-06-04 17:55:53,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 134 transitions, 1732 flow [2024-06-04 17:55:53,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:55:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:55:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2024-06-04 17:55:53,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2024-06-04 17:55:53,610 INFO L175 Difference]: Start difference. First operand has 126 places, 116 transitions, 1108 flow. Second operand 9 states and 129 transitions. [2024-06-04 17:55:53,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 134 transitions, 1732 flow [2024-06-04 17:55:53,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 134 transitions, 1644 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-04 17:55:53,629 INFO L231 Difference]: Finished difference. Result has 129 places, 121 transitions, 1267 flow [2024-06-04 17:55:53,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1267, PETRI_PLACES=129, PETRI_TRANSITIONS=121} [2024-06-04 17:55:53,629 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 98 predicate places. [2024-06-04 17:55:53,629 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 121 transitions, 1267 flow [2024-06-04 17:55:53,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:55:53,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:55:53,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:55:53,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:55:53,630 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-04 17:55:53,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:55:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2053087776, now seen corresponding path program 8 times [2024-06-04 17:55:53,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:55:53,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140060431] [2024-06-04 17:55:53,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:55:53,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:55:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:00,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:00,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:00,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140060431] [2024-06-04 17:56:00,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140060431] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:00,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:00,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:56:00,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908793913] [2024-06-04 17:56:00,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:00,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:56:00,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:00,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:56:00,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:56:00,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:56:00,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 1267 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-04 17:56:00,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:00,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:56:00,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:00,495 INFO L124 PetriNetUnfolderBase]: 264/524 cut-off events. [2024-06-04 17:56:00,495 INFO L125 PetriNetUnfolderBase]: For 14923/14923 co-relation queries the response was YES. [2024-06-04 17:56:00,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 524 events. 264/524 cut-off events. For 14923/14923 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2481 event pairs, 34 based on Foata normal form. 1/521 useless extension candidates. Maximal degree in co-relation 3250. Up to 302 conditions per place. [2024-06-04 17:56:00,499 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 68 selfloop transitions, 62 changer transitions 0/134 dead transitions. [2024-06-04 17:56:00,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 134 transitions, 1743 flow [2024-06-04 17:56:00,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:56:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:56:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 17:56:00,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-04 17:56:00,500 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 1267 flow. Second operand 9 states and 118 transitions. [2024-06-04 17:56:00,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 134 transitions, 1743 flow [2024-06-04 17:56:00,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 134 transitions, 1555 flow, removed 47 selfloop flow, removed 7 redundant places. [2024-06-04 17:56:00,522 INFO L231 Difference]: Finished difference. Result has 131 places, 123 transitions, 1260 flow [2024-06-04 17:56:00,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1260, PETRI_PLACES=131, PETRI_TRANSITIONS=123} [2024-06-04 17:56:00,523 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 100 predicate places. [2024-06-04 17:56:00,523 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 123 transitions, 1260 flow [2024-06-04 17:56:00,523 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-04 17:56:00,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:00,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:00,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:56:00,524 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-04 17:56:00,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:00,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2052841698, now seen corresponding path program 2 times [2024-06-04 17:56:00,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:00,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119881514] [2024-06-04 17:56:00,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:00,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:07,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:07,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119881514] [2024-06-04 17:56:07,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119881514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:07,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:07,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:56:07,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939582192] [2024-06-04 17:56:07,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:07,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:56:07,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:07,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:56:07,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:56:07,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:56:07,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 123 transitions, 1260 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:07,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:07,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:56:07,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:07,653 INFO L124 PetriNetUnfolderBase]: 268/532 cut-off events. [2024-06-04 17:56:07,653 INFO L125 PetriNetUnfolderBase]: For 15093/15093 co-relation queries the response was YES. [2024-06-04 17:56:07,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3276 conditions, 532 events. 268/532 cut-off events. For 15093/15093 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2529 event pairs, 34 based on Foata normal form. 2/530 useless extension candidates. Maximal degree in co-relation 3214. Up to 370 conditions per place. [2024-06-04 17:56:07,657 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 85 selfloop transitions, 45 changer transitions 0/134 dead transitions. [2024-06-04 17:56:07,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 134 transitions, 1566 flow [2024-06-04 17:56:07,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:56:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:56:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-04 17:56:07,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-06-04 17:56:07,659 INFO L175 Difference]: Start difference. First operand has 131 places, 123 transitions, 1260 flow. Second operand 9 states and 123 transitions. [2024-06-04 17:56:07,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 134 transitions, 1566 flow [2024-06-04 17:56:07,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 134 transitions, 1424 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-04 17:56:07,681 INFO L231 Difference]: Finished difference. Result has 134 places, 124 transitions, 1236 flow [2024-06-04 17:56:07,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1236, PETRI_PLACES=134, PETRI_TRANSITIONS=124} [2024-06-04 17:56:07,682 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2024-06-04 17:56:07,682 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 124 transitions, 1236 flow [2024-06-04 17:56:07,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:07,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:07,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:07,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:56:07,683 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-04 17:56:07,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1767741828, now seen corresponding path program 3 times [2024-06-04 17:56:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610996826] [2024-06-04 17:56:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:07,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:14,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-04 17:56:14,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:14,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610996826] [2024-06-04 17:56:14,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610996826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:14,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:14,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:56:14,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066089575] [2024-06-04 17:56:14,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:14,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:56:14,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:14,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:56:14,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:56:14,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:56:14,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 124 transitions, 1236 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:14,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:14,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:56:14,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:14,527 INFO L124 PetriNetUnfolderBase]: 272/546 cut-off events. [2024-06-04 17:56:14,527 INFO L125 PetriNetUnfolderBase]: For 15881/15881 co-relation queries the response was YES. [2024-06-04 17:56:14,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 546 events. 272/546 cut-off events. For 15881/15881 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2623 event pairs, 37 based on Foata normal form. 2/547 useless extension candidates. Maximal degree in co-relation 3234. Up to 462 conditions per place. [2024-06-04 17:56:14,531 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 116 selfloop transitions, 15 changer transitions 0/135 dead transitions. [2024-06-04 17:56:14,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 135 transitions, 1546 flow [2024-06-04 17:56:14,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:56:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:56:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-04 17:56:14,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3993055555555556 [2024-06-04 17:56:14,533 INFO L175 Difference]: Start difference. First operand has 134 places, 124 transitions, 1236 flow. Second operand 9 states and 115 transitions. [2024-06-04 17:56:14,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 135 transitions, 1546 flow [2024-06-04 17:56:14,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 1438 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-04 17:56:14,557 INFO L231 Difference]: Finished difference. Result has 136 places, 125 transitions, 1188 flow [2024-06-04 17:56:14,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1188, PETRI_PLACES=136, PETRI_TRANSITIONS=125} [2024-06-04 17:56:14,558 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 105 predicate places. [2024-06-04 17:56:14,558 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 125 transitions, 1188 flow [2024-06-04 17:56:14,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:14,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:14,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:14,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:56:14,559 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-04 17:56:14,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1757266308, now seen corresponding path program 4 times [2024-06-04 17:56:14,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:14,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115376491] [2024-06-04 17:56:14,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:14,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:20,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:20,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115376491] [2024-06-04 17:56:20,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115376491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:20,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:20,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:56:20,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081408941] [2024-06-04 17:56:20,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:20,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:56:20,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:20,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:56:20,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:56:20,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:56:20,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 1188 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:20,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:20,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:56:20,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:20,922 INFO L124 PetriNetUnfolderBase]: 276/554 cut-off events. [2024-06-04 17:56:20,922 INFO L125 PetriNetUnfolderBase]: For 16541/16541 co-relation queries the response was YES. [2024-06-04 17:56:20,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3287 conditions, 554 events. 276/554 cut-off events. For 16541/16541 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2685 event pairs, 35 based on Foata normal form. 2/555 useless extension candidates. Maximal degree in co-relation 3223. Up to 456 conditions per place. [2024-06-04 17:56:20,926 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 117 selfloop transitions, 18 changer transitions 0/139 dead transitions. [2024-06-04 17:56:20,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 139 transitions, 1514 flow [2024-06-04 17:56:20,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:56:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:56:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 17:56:20,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-04 17:56:20,928 INFO L175 Difference]: Start difference. First operand has 136 places, 125 transitions, 1188 flow. Second operand 11 states and 136 transitions. [2024-06-04 17:56:20,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 139 transitions, 1514 flow [2024-06-04 17:56:20,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 139 transitions, 1464 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:56:20,951 INFO L231 Difference]: Finished difference. Result has 140 places, 126 transitions, 1206 flow [2024-06-04 17:56:20,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=129, 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=11, PETRI_FLOW=1206, PETRI_PLACES=140, PETRI_TRANSITIONS=126} [2024-06-04 17:56:20,952 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 109 predicate places. [2024-06-04 17:56:20,952 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 126 transitions, 1206 flow [2024-06-04 17:56:20,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:20,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:20,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:20,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:56:20,953 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-04 17:56:20,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:20,953 INFO L85 PathProgramCache]: Analyzing trace with hash -770084386, now seen corresponding path program 5 times [2024-06-04 17:56:20,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:20,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881118827] [2024-06-04 17:56:20,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:20,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:27,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:27,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881118827] [2024-06-04 17:56:27,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881118827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:27,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:27,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:56:27,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805870487] [2024-06-04 17:56:27,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:27,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:56:27,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:27,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:56:27,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:56:27,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 17:56:27,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 126 transitions, 1206 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:27,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:27,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 17:56:27,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:27,992 INFO L124 PetriNetUnfolderBase]: 285/575 cut-off events. [2024-06-04 17:56:27,993 INFO L125 PetriNetUnfolderBase]: For 21567/21567 co-relation queries the response was YES. [2024-06-04 17:56:27,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 575 events. 285/575 cut-off events. For 21567/21567 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2793 event pairs, 39 based on Foata normal form. 10/581 useless extension candidates. Maximal degree in co-relation 3247. Up to 431 conditions per place. [2024-06-04 17:56:27,997 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 105 selfloop transitions, 27 changer transitions 4/140 dead transitions. [2024-06-04 17:56:27,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 140 transitions, 1554 flow [2024-06-04 17:56:28,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:56:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:56:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2024-06-04 17:56:28,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-04 17:56:28,013 INFO L175 Difference]: Start difference. First operand has 140 places, 126 transitions, 1206 flow. Second operand 10 states and 144 transitions. [2024-06-04 17:56:28,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 140 transitions, 1554 flow [2024-06-04 17:56:28,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 140 transitions, 1468 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-04 17:56:28,039 INFO L231 Difference]: Finished difference. Result has 141 places, 125 transitions, 1171 flow [2024-06-04 17:56:28,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1171, PETRI_PLACES=141, PETRI_TRANSITIONS=125} [2024-06-04 17:56:28,040 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 110 predicate places. [2024-06-04 17:56:28,040 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 125 transitions, 1171 flow [2024-06-04 17:56:28,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:28,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:28,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:28,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:56:28,041 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-04 17:56:28,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:28,041 INFO L85 PathProgramCache]: Analyzing trace with hash 600272723, now seen corresponding path program 1 times [2024-06-04 17:56:28,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:28,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894761927] [2024-06-04 17:56:28,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:28,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:33,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:33,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894761927] [2024-06-04 17:56:33,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894761927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:33,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:33,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:56:33,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767803994] [2024-06-04 17:56:33,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:33,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:56:33,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:33,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:56:33,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:56:33,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:56:33,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 125 transitions, 1171 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:33,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:33,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:56:33,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:34,294 INFO L124 PetriNetUnfolderBase]: 283/575 cut-off events. [2024-06-04 17:56:34,295 INFO L125 PetriNetUnfolderBase]: For 16341/16341 co-relation queries the response was YES. [2024-06-04 17:56:34,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 575 events. 283/575 cut-off events. For 16341/16341 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2818 event pairs, 20 based on Foata normal form. 2/576 useless extension candidates. Maximal degree in co-relation 3198. Up to 460 conditions per place. [2024-06-04 17:56:34,298 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 126 selfloop transitions, 13 changer transitions 0/143 dead transitions. [2024-06-04 17:56:34,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 143 transitions, 1503 flow [2024-06-04 17:56:34,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:56:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:56:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 17:56:34,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-04 17:56:34,299 INFO L175 Difference]: Start difference. First operand has 141 places, 125 transitions, 1171 flow. Second operand 9 states and 118 transitions. [2024-06-04 17:56:34,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 143 transitions, 1503 flow [2024-06-04 17:56:34,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 143 transitions, 1433 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:56:34,323 INFO L231 Difference]: Finished difference. Result has 142 places, 126 transitions, 1143 flow [2024-06-04 17:56:34,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1143, PETRI_PLACES=142, PETRI_TRANSITIONS=126} [2024-06-04 17:56:34,324 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2024-06-04 17:56:34,324 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 126 transitions, 1143 flow [2024-06-04 17:56:34,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:34,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:34,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:34,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:56:34,325 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-04 17:56:34,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash -294227245, now seen corresponding path program 2 times [2024-06-04 17:56:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:34,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343718924] [2024-06-04 17:56:34,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:34,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:41,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:41,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343718924] [2024-06-04 17:56:41,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343718924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:41,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:41,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:56:41,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379243129] [2024-06-04 17:56:41,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:41,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:56:41,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:41,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:56:41,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:56:41,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:56:41,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 126 transitions, 1143 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:41,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:41,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:56:41,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:41,540 INFO L124 PetriNetUnfolderBase]: 287/583 cut-off events. [2024-06-04 17:56:41,541 INFO L125 PetriNetUnfolderBase]: For 16739/16739 co-relation queries the response was YES. [2024-06-04 17:56:41,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3270 conditions, 583 events. 287/583 cut-off events. For 16739/16739 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2872 event pairs, 34 based on Foata normal form. 2/584 useless extension candidates. Maximal degree in co-relation 3204. Up to 485 conditions per place. [2024-06-04 17:56:41,564 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 125 selfloop transitions, 14 changer transitions 0/143 dead transitions. [2024-06-04 17:56:41,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 143 transitions, 1475 flow [2024-06-04 17:56:41,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:56:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:56:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-04 17:56:41,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2024-06-04 17:56:41,566 INFO L175 Difference]: Start difference. First operand has 142 places, 126 transitions, 1143 flow. Second operand 9 states and 119 transitions. [2024-06-04 17:56:41,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 143 transitions, 1475 flow [2024-06-04 17:56:41,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 143 transitions, 1443 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 17:56:41,594 INFO L231 Difference]: Finished difference. Result has 144 places, 127 transitions, 1157 flow [2024-06-04 17:56:41,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1157, PETRI_PLACES=144, PETRI_TRANSITIONS=127} [2024-06-04 17:56:41,595 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-04 17:56:41,596 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 127 transitions, 1157 flow [2024-06-04 17:56:41,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:41,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:41,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:41,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:56:41,596 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-04 17:56:41,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash -294079375, now seen corresponding path program 3 times [2024-06-04 17:56:41,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:41,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205861438] [2024-06-04 17:56:41,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:41,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:56:49,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:49,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205861438] [2024-06-04 17:56:49,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205861438] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:49,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:49,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:56:49,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499390406] [2024-06-04 17:56:49,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:49,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:56:49,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:49,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:56:49,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:56:49,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:56:49,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 127 transitions, 1157 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:49,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:49,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:56:49,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:49,803 INFO L124 PetriNetUnfolderBase]: 291/591 cut-off events. [2024-06-04 17:56:49,803 INFO L125 PetriNetUnfolderBase]: For 17799/17799 co-relation queries the response was YES. [2024-06-04 17:56:49,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3325 conditions, 591 events. 291/591 cut-off events. For 17799/17799 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2944 event pairs, 36 based on Foata normal form. 2/592 useless extension candidates. Maximal degree in co-relation 3258. Up to 498 conditions per place. [2024-06-04 17:56:49,808 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 124 selfloop transitions, 15 changer transitions 0/143 dead transitions. [2024-06-04 17:56:49,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 143 transitions, 1489 flow [2024-06-04 17:56:49,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:56:49,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:56:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-04 17:56:49,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2024-06-04 17:56:49,818 INFO L175 Difference]: Start difference. First operand has 144 places, 127 transitions, 1157 flow. Second operand 9 states and 119 transitions. [2024-06-04 17:56:49,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 143 transitions, 1489 flow [2024-06-04 17:56:49,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 143 transitions, 1453 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 17:56:49,847 INFO L231 Difference]: Finished difference. Result has 146 places, 128 transitions, 1171 flow [2024-06-04 17:56:49,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1171, PETRI_PLACES=146, PETRI_TRANSITIONS=128} [2024-06-04 17:56:49,847 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-04 17:56:49,847 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 128 transitions, 1171 flow [2024-06-04 17:56:49,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:49,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:49,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:49,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:56:49,849 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-04 17:56:49,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash 24127247, now seen corresponding path program 4 times [2024-06-04 17:56:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:49,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141459852] [2024-06-04 17:56:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:56:56,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-04 17:56:56,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:56:56,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141459852] [2024-06-04 17:56:56,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141459852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:56:56,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:56:56,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:56:56,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735718672] [2024-06-04 17:56:56,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:56:56,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:56:56,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:56:56,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:56:56,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:56:56,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:56:56,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 128 transitions, 1171 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:56,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:56:56,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:56:56,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:56:56,597 INFO L124 PetriNetUnfolderBase]: 295/599 cut-off events. [2024-06-04 17:56:56,597 INFO L125 PetriNetUnfolderBase]: For 18624/18624 co-relation queries the response was YES. [2024-06-04 17:56:56,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3380 conditions, 599 events. 295/599 cut-off events. For 18624/18624 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2989 event pairs, 36 based on Foata normal form. 2/600 useless extension candidates. Maximal degree in co-relation 3312. Up to 495 conditions per place. [2024-06-04 17:56:56,602 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 114 selfloop transitions, 23 changer transitions 0/141 dead transitions. [2024-06-04 17:56:56,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 141 transitions, 1491 flow [2024-06-04 17:56:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:56:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:56:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 17:56:56,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-04 17:56:56,604 INFO L175 Difference]: Start difference. First operand has 146 places, 128 transitions, 1171 flow. Second operand 9 states and 118 transitions. [2024-06-04 17:56:56,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 141 transitions, 1491 flow [2024-06-04 17:56:56,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 141 transitions, 1451 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 17:56:56,630 INFO L231 Difference]: Finished difference. Result has 148 places, 129 transitions, 1199 flow [2024-06-04 17:56:56,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1199, PETRI_PLACES=148, PETRI_TRANSITIONS=129} [2024-06-04 17:56:56,631 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-04 17:56:56,631 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 129 transitions, 1199 flow [2024-06-04 17:56:56,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:56:56,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:56:56,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:56:56,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:56:56,632 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-04 17:56:56,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:56:56,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1015020401, now seen corresponding path program 5 times [2024-06-04 17:56:56,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:56:56,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394468830] [2024-06-04 17:56:56,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:56:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:56:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:02,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-04 17:57:02,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:02,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394468830] [2024-06-04 17:57:02,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394468830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:02,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:02,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:57:02,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246637153] [2024-06-04 17:57:02,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:02,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:57:02,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:02,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:57:02,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:57:02,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:57:02,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 129 transitions, 1199 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:02,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:02,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:57:02,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:03,276 INFO L124 PetriNetUnfolderBase]: 299/607 cut-off events. [2024-06-04 17:57:03,276 INFO L125 PetriNetUnfolderBase]: For 19406/19406 co-relation queries the response was YES. [2024-06-04 17:57:03,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3450 conditions, 607 events. 299/607 cut-off events. For 19406/19406 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3044 event pairs, 38 based on Foata normal form. 2/608 useless extension candidates. Maximal degree in co-relation 3381. Up to 512 conditions per place. [2024-06-04 17:57:03,281 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 120 selfloop transitions, 20 changer transitions 0/144 dead transitions. [2024-06-04 17:57:03,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 144 transitions, 1553 flow [2024-06-04 17:57:03,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:57:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:57:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-04 17:57:03,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-04 17:57:03,288 INFO L175 Difference]: Start difference. First operand has 148 places, 129 transitions, 1199 flow. Second operand 9 states and 116 transitions. [2024-06-04 17:57:03,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 144 transitions, 1553 flow [2024-06-04 17:57:03,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 1491 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:57:03,319 INFO L231 Difference]: Finished difference. Result has 151 places, 132 transitions, 1238 flow [2024-06-04 17:57:03,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1238, PETRI_PLACES=151, PETRI_TRANSITIONS=132} [2024-06-04 17:57:03,320 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-04 17:57:03,320 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 132 transitions, 1238 flow [2024-06-04 17:57:03,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:03,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:03,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:03,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:57:03,321 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-04 17:57:03,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:03,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1270682131, now seen corresponding path program 6 times [2024-06-04 17:57:03,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:03,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595588303] [2024-06-04 17:57:03,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:03,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:09,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:09,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595588303] [2024-06-04 17:57:09,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595588303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:09,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:09,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:57:09,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592623258] [2024-06-04 17:57:09,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:09,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:57:09,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:09,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:57:09,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:57:09,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:57:09,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 132 transitions, 1238 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:09,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:09,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:57:09,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:09,914 INFO L124 PetriNetUnfolderBase]: 303/615 cut-off events. [2024-06-04 17:57:09,914 INFO L125 PetriNetUnfolderBase]: For 20338/20338 co-relation queries the response was YES. [2024-06-04 17:57:09,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3508 conditions, 615 events. 303/615 cut-off events. For 20338/20338 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3110 event pairs, 36 based on Foata normal form. 2/616 useless extension candidates. Maximal degree in co-relation 3437. Up to 518 conditions per place. [2024-06-04 17:57:09,919 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 125 selfloop transitions, 17 changer transitions 0/146 dead transitions. [2024-06-04 17:57:09,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 146 transitions, 1574 flow [2024-06-04 17:57:09,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:57:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:57:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-04 17:57:09,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-04 17:57:09,921 INFO L175 Difference]: Start difference. First operand has 151 places, 132 transitions, 1238 flow. Second operand 9 states and 116 transitions. [2024-06-04 17:57:09,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 146 transitions, 1574 flow [2024-06-04 17:57:09,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 146 transitions, 1527 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 17:57:09,953 INFO L231 Difference]: Finished difference. Result has 154 places, 133 transitions, 1251 flow [2024-06-04 17:57:09,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1251, PETRI_PLACES=154, PETRI_TRANSITIONS=133} [2024-06-04 17:57:09,954 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 123 predicate places. [2024-06-04 17:57:09,954 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 133 transitions, 1251 flow [2024-06-04 17:57:09,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:09,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:09,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:09,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:57:09,954 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-04 17:57:09,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:09,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1470137743, now seen corresponding path program 1 times [2024-06-04 17:57:09,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:09,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657689624] [2024-06-04 17:57:09,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:09,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:17,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:17,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657689624] [2024-06-04 17:57:17,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657689624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:17,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:17,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:57:17,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817415322] [2024-06-04 17:57:17,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:17,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:57:17,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:17,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:57:17,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:57:17,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:57:17,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 133 transitions, 1251 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:17,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:17,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:57:17,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:17,808 INFO L124 PetriNetUnfolderBase]: 306/620 cut-off events. [2024-06-04 17:57:17,808 INFO L125 PetriNetUnfolderBase]: For 20175/20175 co-relation queries the response was YES. [2024-06-04 17:57:17,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3559 conditions, 620 events. 306/620 cut-off events. For 20175/20175 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3137 event pairs, 38 based on Foata normal form. 1/620 useless extension candidates. Maximal degree in co-relation 3487. Up to 503 conditions per place. [2024-06-04 17:57:17,813 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 115 selfloop transitions, 29 changer transitions 0/148 dead transitions. [2024-06-04 17:57:17,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 148 transitions, 1621 flow [2024-06-04 17:57:17,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:57:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:57:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-04 17:57:17,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-04 17:57:17,817 INFO L175 Difference]: Start difference. First operand has 154 places, 133 transitions, 1251 flow. Second operand 10 states and 131 transitions. [2024-06-04 17:57:17,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 148 transitions, 1621 flow [2024-06-04 17:57:17,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 148 transitions, 1571 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 17:57:17,853 INFO L231 Difference]: Finished difference. Result has 158 places, 136 transitions, 1329 flow [2024-06-04 17:57:17,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1329, PETRI_PLACES=158, PETRI_TRANSITIONS=136} [2024-06-04 17:57:17,854 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2024-06-04 17:57:17,854 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 136 transitions, 1329 flow [2024-06-04 17:57:17,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:17,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:17,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:17,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:57:17,855 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-04 17:57:17,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:17,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2068165211, now seen corresponding path program 2 times [2024-06-04 17:57:17,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:17,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465748229] [2024-06-04 17:57:17,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:25,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:25,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465748229] [2024-06-04 17:57:25,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465748229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:25,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:25,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:57:25,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144430951] [2024-06-04 17:57:25,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:25,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:57:25,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:25,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:57:25,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:57:25,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:57:25,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 136 transitions, 1329 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:25,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:25,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:57:25,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:25,850 INFO L124 PetriNetUnfolderBase]: 304/617 cut-off events. [2024-06-04 17:57:25,850 INFO L125 PetriNetUnfolderBase]: For 19805/19805 co-relation queries the response was YES. [2024-06-04 17:57:25,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3509 conditions, 617 events. 304/617 cut-off events. For 19805/19805 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3122 event pairs, 38 based on Foata normal form. 1/617 useless extension candidates. Maximal degree in co-relation 3435. Up to 500 conditions per place. [2024-06-04 17:57:25,854 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 113 selfloop transitions, 31 changer transitions 0/148 dead transitions. [2024-06-04 17:57:25,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 148 transitions, 1647 flow [2024-06-04 17:57:25,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:57:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:57:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-04 17:57:25,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 17:57:25,855 INFO L175 Difference]: Start difference. First operand has 158 places, 136 transitions, 1329 flow. Second operand 10 states and 130 transitions. [2024-06-04 17:57:25,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 148 transitions, 1647 flow [2024-06-04 17:57:25,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 148 transitions, 1537 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-06-04 17:57:25,896 INFO L231 Difference]: Finished difference. Result has 161 places, 136 transitions, 1286 flow [2024-06-04 17:57:25,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1286, PETRI_PLACES=161, PETRI_TRANSITIONS=136} [2024-06-04 17:57:25,896 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 130 predicate places. [2024-06-04 17:57:25,896 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 136 transitions, 1286 flow [2024-06-04 17:57:25,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:25,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:25,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:25,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:57:25,897 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-04 17:57:25,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:25,897 INFO L85 PathProgramCache]: Analyzing trace with hash 778783213, now seen corresponding path program 7 times [2024-06-04 17:57:25,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:25,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011190719] [2024-06-04 17:57:25,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:25,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:33,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:33,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011190719] [2024-06-04 17:57:33,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011190719] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:33,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:33,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:57:33,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959306421] [2024-06-04 17:57:33,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:33,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:57:33,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:33,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:57:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:57:33,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:57:33,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 136 transitions, 1286 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:33,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:33,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:57:33,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:34,193 INFO L124 PetriNetUnfolderBase]: 308/623 cut-off events. [2024-06-04 17:57:34,193 INFO L125 PetriNetUnfolderBase]: For 21557/21557 co-relation queries the response was YES. [2024-06-04 17:57:34,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3533 conditions, 623 events. 308/623 cut-off events. For 21557/21557 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3171 event pairs, 41 based on Foata normal form. 2/621 useless extension candidates. Maximal degree in co-relation 3458. Up to 494 conditions per place. [2024-06-04 17:57:34,197 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 107 selfloop transitions, 36 changer transitions 0/147 dead transitions. [2024-06-04 17:57:34,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 147 transitions, 1618 flow [2024-06-04 17:57:34,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:57:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:57:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 17:57:34,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-04 17:57:34,199 INFO L175 Difference]: Start difference. First operand has 161 places, 136 transitions, 1286 flow. Second operand 9 states and 118 transitions. [2024-06-04 17:57:34,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 147 transitions, 1618 flow [2024-06-04 17:57:34,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 147 transitions, 1512 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 17:57:34,239 INFO L231 Difference]: Finished difference. Result has 160 places, 137 transitions, 1280 flow [2024-06-04 17:57:34,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1280, PETRI_PLACES=160, PETRI_TRANSITIONS=137} [2024-06-04 17:57:34,240 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 129 predicate places. [2024-06-04 17:57:34,240 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 137 transitions, 1280 flow [2024-06-04 17:57:34,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:34,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:34,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:34,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:57:34,240 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-04 17:57:34,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:34,241 INFO L85 PathProgramCache]: Analyzing trace with hash -905071025, now seen corresponding path program 8 times [2024-06-04 17:57:34,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:34,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651506496] [2024-06-04 17:57:34,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:34,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:44,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:44,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651506496] [2024-06-04 17:57:44,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651506496] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:44,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:44,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:57:44,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666829526] [2024-06-04 17:57:44,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:44,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:57:44,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:44,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:57:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:57:44,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:57:44,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 137 transitions, 1280 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:44,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:44,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:57:44,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:45,076 INFO L124 PetriNetUnfolderBase]: 312/631 cut-off events. [2024-06-04 17:57:45,076 INFO L125 PetriNetUnfolderBase]: For 22667/22667 co-relation queries the response was YES. [2024-06-04 17:57:45,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3592 conditions, 631 events. 312/631 cut-off events. For 22667/22667 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3216 event pairs, 41 based on Foata normal form. 2/629 useless extension candidates. Maximal degree in co-relation 3516. Up to 528 conditions per place. [2024-06-04 17:57:45,081 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 120 selfloop transitions, 24 changer transitions 0/148 dead transitions. [2024-06-04 17:57:45,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 148 transitions, 1616 flow [2024-06-04 17:57:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:57:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:57:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 17:57:45,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-04 17:57:45,083 INFO L175 Difference]: Start difference. First operand has 160 places, 137 transitions, 1280 flow. Second operand 9 states and 118 transitions. [2024-06-04 17:57:45,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 148 transitions, 1616 flow [2024-06-04 17:57:45,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 148 transitions, 1526 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-04 17:57:45,131 INFO L231 Difference]: Finished difference. Result has 162 places, 138 transitions, 1268 flow [2024-06-04 17:57:45,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1268, PETRI_PLACES=162, PETRI_TRANSITIONS=138} [2024-06-04 17:57:45,131 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2024-06-04 17:57:45,131 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 138 transitions, 1268 flow [2024-06-04 17:57:45,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:45,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:45,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:45,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 17:57:45,132 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-04 17:57:45,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:45,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1104372815, now seen corresponding path program 9 times [2024-06-04 17:57:45,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:45,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965774359] [2024-06-04 17:57:45,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:45,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:52,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965774359] [2024-06-04 17:57:52,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965774359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:52,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:52,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:57:52,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511456037] [2024-06-04 17:57:52,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:52,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:57:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:52,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:57:52,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:57:52,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:57:52,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 138 transitions, 1268 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:52,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:52,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:57:52,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:52,516 INFO L124 PetriNetUnfolderBase]: 316/639 cut-off events. [2024-06-04 17:57:52,516 INFO L125 PetriNetUnfolderBase]: For 23523/23523 co-relation queries the response was YES. [2024-06-04 17:57:52,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 639 events. 316/639 cut-off events. For 23523/23523 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3252 event pairs, 43 based on Foata normal form. 2/637 useless extension candidates. Maximal degree in co-relation 3543. Up to 542 conditions per place. [2024-06-04 17:57:52,521 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 124 selfloop transitions, 22 changer transitions 0/150 dead transitions. [2024-06-04 17:57:52,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 150 transitions, 1621 flow [2024-06-04 17:57:52,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:57:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:57:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-04 17:57:52,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-04 17:57:52,523 INFO L175 Difference]: Start difference. First operand has 162 places, 138 transitions, 1268 flow. Second operand 9 states and 116 transitions. [2024-06-04 17:57:52,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 150 transitions, 1621 flow [2024-06-04 17:57:52,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 150 transitions, 1551 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:57:52,565 INFO L231 Difference]: Finished difference. Result has 165 places, 140 transitions, 1290 flow [2024-06-04 17:57:52,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1200, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1290, PETRI_PLACES=165, PETRI_TRANSITIONS=140} [2024-06-04 17:57:52,565 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 134 predicate places. [2024-06-04 17:57:52,566 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 140 transitions, 1290 flow [2024-06-04 17:57:52,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:52,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:52,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:52,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 17:57:52,566 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-04 17:57:52,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:52,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1104520685, now seen corresponding path program 10 times [2024-06-04 17:57:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:52,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298932951] [2024-06-04 17:57:52,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:52,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:57:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:57:58,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:57:58,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298932951] [2024-06-04 17:57:58,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298932951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:57:58,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:57:58,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:57:58,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703084742] [2024-06-04 17:57:58,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:57:58,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:57:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:57:58,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:57:58,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:57:58,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:57:58,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 140 transitions, 1290 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:58,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:57:58,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:57:58,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:57:59,275 INFO L124 PetriNetUnfolderBase]: 313/634 cut-off events. [2024-06-04 17:57:59,276 INFO L125 PetriNetUnfolderBase]: For 21568/21568 co-relation queries the response was YES. [2024-06-04 17:57:59,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3467 conditions, 634 events. 313/634 cut-off events. For 21568/21568 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3249 event pairs, 40 based on Foata normal form. 2/632 useless extension candidates. Maximal degree in co-relation 3388. Up to 532 conditions per place. [2024-06-04 17:57:59,280 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 126 selfloop transitions, 21 changer transitions 0/151 dead transitions. [2024-06-04 17:57:59,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 151 transitions, 1610 flow [2024-06-04 17:57:59,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:57:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:57:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-04 17:57:59,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-04 17:57:59,282 INFO L175 Difference]: Start difference. First operand has 165 places, 140 transitions, 1290 flow. Second operand 9 states and 116 transitions. [2024-06-04 17:57:59,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 151 transitions, 1610 flow [2024-06-04 17:57:59,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 151 transitions, 1547 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-04 17:57:59,324 INFO L231 Difference]: Finished difference. Result has 168 places, 140 transitions, 1273 flow [2024-06-04 17:57:59,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1273, PETRI_PLACES=168, PETRI_TRANSITIONS=140} [2024-06-04 17:57:59,325 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 137 predicate places. [2024-06-04 17:57:59,325 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 140 transitions, 1273 flow [2024-06-04 17:57:59,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:57:59,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:57:59,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:57:59,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 17:57:59,325 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-04 17:57:59,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:57:59,326 INFO L85 PathProgramCache]: Analyzing trace with hash 786140815, now seen corresponding path program 3 times [2024-06-04 17:57:59,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:57:59,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580095186] [2024-06-04 17:57:59,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:57:59,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:57:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:09,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-04 17:58:09,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:09,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580095186] [2024-06-04 17:58:09,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580095186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:09,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:09,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:58:09,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129557887] [2024-06-04 17:58:09,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:09,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:58:09,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:09,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:58:09,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:58:09,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:58:09,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 140 transitions, 1273 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:09,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:09,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:58:09,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:09,710 INFO L124 PetriNetUnfolderBase]: 316/639 cut-off events. [2024-06-04 17:58:09,711 INFO L125 PetriNetUnfolderBase]: For 20860/20860 co-relation queries the response was YES. [2024-06-04 17:58:09,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3487 conditions, 639 events. 316/639 cut-off events. For 20860/20860 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3283 event pairs, 42 based on Foata normal form. 1/636 useless extension candidates. Maximal degree in co-relation 3407. Up to 467 conditions per place. [2024-06-04 17:58:09,715 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 100 selfloop transitions, 51 changer transitions 0/155 dead transitions. [2024-06-04 17:58:09,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 155 transitions, 1656 flow [2024-06-04 17:58:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:58:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:58:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-04 17:58:09,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-04 17:58:09,717 INFO L175 Difference]: Start difference. First operand has 168 places, 140 transitions, 1273 flow. Second operand 10 states and 133 transitions. [2024-06-04 17:58:09,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 155 transitions, 1656 flow [2024-06-04 17:58:09,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 155 transitions, 1556 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-04 17:58:09,759 INFO L231 Difference]: Finished difference. Result has 173 places, 145 transitions, 1385 flow [2024-06-04 17:58:09,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1385, PETRI_PLACES=173, PETRI_TRANSITIONS=145} [2024-06-04 17:58:09,760 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 142 predicate places. [2024-06-04 17:58:09,760 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 145 transitions, 1385 flow [2024-06-04 17:58:09,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:09,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:09,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:09,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 17:58:09,760 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-04 17:58:09,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:09,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1616626365, now seen corresponding path program 4 times [2024-06-04 17:58:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:09,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524094061] [2024-06-04 17:58:09,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:09,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:18,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:18,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:18,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524094061] [2024-06-04 17:58:18,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524094061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:18,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:18,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:58:18,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167837964] [2024-06-04 17:58:18,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:18,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:58:18,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:18,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:58:18,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:58:19,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:58:19,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 145 transitions, 1385 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:19,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:19,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:58:19,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:19,345 INFO L124 PetriNetUnfolderBase]: 314/636 cut-off events. [2024-06-04 17:58:19,345 INFO L125 PetriNetUnfolderBase]: For 20027/20027 co-relation queries the response was YES. [2024-06-04 17:58:19,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3481 conditions, 636 events. 314/636 cut-off events. For 20027/20027 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3249 event pairs, 42 based on Foata normal form. 1/633 useless extension candidates. Maximal degree in co-relation 3397. Up to 464 conditions per place. [2024-06-04 17:58:19,349 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 99 selfloop transitions, 52 changer transitions 0/155 dead transitions. [2024-06-04 17:58:19,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 155 transitions, 1711 flow [2024-06-04 17:58:19,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:58:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:58:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-04 17:58:19,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-04 17:58:19,351 INFO L175 Difference]: Start difference. First operand has 173 places, 145 transitions, 1385 flow. Second operand 10 states and 132 transitions. [2024-06-04 17:58:19,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 155 transitions, 1711 flow [2024-06-04 17:58:19,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 155 transitions, 1563 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-04 17:58:19,391 INFO L231 Difference]: Finished difference. Result has 177 places, 145 transitions, 1346 flow [2024-06-04 17:58:19,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1346, PETRI_PLACES=177, PETRI_TRANSITIONS=145} [2024-06-04 17:58:19,391 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 146 predicate places. [2024-06-04 17:58:19,391 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 145 transitions, 1346 flow [2024-06-04 17:58:19,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:19,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:19,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:19,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 17:58:19,392 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-04 17:58:19,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:19,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1035491485, now seen corresponding path program 5 times [2024-06-04 17:58:19,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:19,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750677005] [2024-06-04 17:58:19,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:19,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:28,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:28,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750677005] [2024-06-04 17:58:28,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750677005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:28,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:28,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:58:28,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573669452] [2024-06-04 17:58:28,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:28,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:58:28,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:58:28,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:58:28,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:58:28,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 145 transitions, 1346 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:28,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:28,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:58:28,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:28,618 INFO L124 PetriNetUnfolderBase]: 312/633 cut-off events. [2024-06-04 17:58:28,618 INFO L125 PetriNetUnfolderBase]: For 18905/18905 co-relation queries the response was YES. [2024-06-04 17:58:28,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3319 conditions, 633 events. 312/633 cut-off events. For 18905/18905 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3232 event pairs, 43 based on Foata normal form. 1/633 useless extension candidates. Maximal degree in co-relation 3235. Up to 548 conditions per place. [2024-06-04 17:58:28,622 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 131 selfloop transitions, 20 changer transitions 0/155 dead transitions. [2024-06-04 17:58:28,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 155 transitions, 1672 flow [2024-06-04 17:58:28,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:58:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:58:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 17:58:28,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-04 17:58:28,624 INFO L175 Difference]: Start difference. First operand has 177 places, 145 transitions, 1346 flow. Second operand 10 states and 127 transitions. [2024-06-04 17:58:28,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 155 transitions, 1672 flow [2024-06-04 17:58:28,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 155 transitions, 1514 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-04 17:58:28,662 INFO L231 Difference]: Finished difference. Result has 178 places, 145 transitions, 1233 flow [2024-06-04 17:58:28,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1233, PETRI_PLACES=178, PETRI_TRANSITIONS=145} [2024-06-04 17:58:28,664 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 147 predicate places. [2024-06-04 17:58:28,664 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 145 transitions, 1233 flow [2024-06-04 17:58:28,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:28,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:28,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:28,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 17:58:28,664 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-04 17:58:28,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash -897713423, now seen corresponding path program 6 times [2024-06-04 17:58:28,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:28,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414696812] [2024-06-04 17:58:28,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:28,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:37,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:37,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414696812] [2024-06-04 17:58:37,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414696812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:37,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:37,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:58:37,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706006422] [2024-06-04 17:58:37,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:37,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:58:37,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:37,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:58:37,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:58:37,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:58:37,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 145 transitions, 1233 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-04 17:58:37,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:37,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:58:37,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:37,791 INFO L124 PetriNetUnfolderBase]: 315/636 cut-off events. [2024-06-04 17:58:37,792 INFO L125 PetriNetUnfolderBase]: For 19371/19371 co-relation queries the response was YES. [2024-06-04 17:58:37,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3266 conditions, 636 events. 315/636 cut-off events. For 19371/19371 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3234 event pairs, 42 based on Foata normal form. 1/633 useless extension candidates. Maximal degree in co-relation 3181. Up to 526 conditions per place. [2024-06-04 17:58:37,796 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 121 selfloop transitions, 32 changer transitions 0/157 dead transitions. [2024-06-04 17:58:37,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 157 transitions, 1607 flow [2024-06-04 17:58:37,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:58:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:58:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 17:58:37,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 17:58:37,797 INFO L175 Difference]: Start difference. First operand has 178 places, 145 transitions, 1233 flow. Second operand 10 states and 120 transitions. [2024-06-04 17:58:37,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 157 transitions, 1607 flow [2024-06-04 17:58:37,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 157 transitions, 1560 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-04 17:58:37,839 INFO L231 Difference]: Finished difference. Result has 179 places, 147 transitions, 1303 flow [2024-06-04 17:58:37,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1303, PETRI_PLACES=179, PETRI_TRANSITIONS=147} [2024-06-04 17:58:37,840 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 148 predicate places. [2024-06-04 17:58:37,840 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 147 transitions, 1303 flow [2024-06-04 17:58:37,840 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-04 17:58:37,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:37,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:37,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 17:58:37,840 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-04 17:58:37,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:37,841 INFO L85 PathProgramCache]: Analyzing trace with hash -959402579, now seen corresponding path program 7 times [2024-06-04 17:58:37,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:37,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43954000] [2024-06-04 17:58:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:37,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:47,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43954000] [2024-06-04 17:58:47,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43954000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:47,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:47,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:58:47,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87565135] [2024-06-04 17:58:47,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:47,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:58:47,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:47,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:58:47,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:58:47,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:58:47,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 147 transitions, 1303 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:47,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:47,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:58:47,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:47,883 INFO L124 PetriNetUnfolderBase]: 313/635 cut-off events. [2024-06-04 17:58:47,883 INFO L125 PetriNetUnfolderBase]: For 18547/18547 co-relation queries the response was YES. [2024-06-04 17:58:47,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3228 conditions, 635 events. 313/635 cut-off events. For 18547/18547 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3268 event pairs, 42 based on Foata normal form. 1/632 useless extension candidates. Maximal degree in co-relation 3142. Up to 523 conditions per place. [2024-06-04 17:58:47,888 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 122 selfloop transitions, 31 changer transitions 0/157 dead transitions. [2024-06-04 17:58:47,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 157 transitions, 1633 flow [2024-06-04 17:58:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:58:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:58:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-04 17:58:47,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-04 17:58:47,889 INFO L175 Difference]: Start difference. First operand has 179 places, 147 transitions, 1303 flow. Second operand 10 states and 131 transitions. [2024-06-04 17:58:47,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 157 transitions, 1633 flow [2024-06-04 17:58:47,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 157 transitions, 1486 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-04 17:58:47,941 INFO L231 Difference]: Finished difference. Result has 181 places, 147 transitions, 1223 flow [2024-06-04 17:58:47,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1223, PETRI_PLACES=181, PETRI_TRANSITIONS=147} [2024-06-04 17:58:47,942 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 150 predicate places. [2024-06-04 17:58:47,942 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 147 transitions, 1223 flow [2024-06-04 17:58:47,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:47,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:47,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:47,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 17:58:47,943 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-04 17:58:47,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:47,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1428585979, now seen corresponding path program 1 times [2024-06-04 17:58:47,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:47,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158376229] [2024-06-04 17:58:47,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:47,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:53,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:53,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158376229] [2024-06-04 17:58:53,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158376229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:53,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:53,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:58:53,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177738227] [2024-06-04 17:58:53,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:53,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:58:53,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:53,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:58:53,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:58:53,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:58:53,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 147 transitions, 1223 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:53,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:53,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:58:53,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:54,305 INFO L124 PetriNetUnfolderBase]: 325/665 cut-off events. [2024-06-04 17:58:54,305 INFO L125 PetriNetUnfolderBase]: For 29208/29208 co-relation queries the response was YES. [2024-06-04 17:58:54,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3287 conditions, 665 events. 325/665 cut-off events. For 29208/29208 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3429 event pairs, 35 based on Foata normal form. 8/672 useless extension candidates. Maximal degree in co-relation 3200. Up to 518 conditions per place. [2024-06-04 17:58:54,310 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 138 selfloop transitions, 9 changer transitions 18/169 dead transitions. [2024-06-04 17:58:54,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 169 transitions, 1637 flow [2024-06-04 17:58:54,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:58:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:58:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-04 17:58:54,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-04 17:58:54,311 INFO L175 Difference]: Start difference. First operand has 181 places, 147 transitions, 1223 flow. Second operand 10 states and 131 transitions. [2024-06-04 17:58:54,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 169 transitions, 1637 flow [2024-06-04 17:58:54,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 169 transitions, 1541 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 17:58:54,354 INFO L231 Difference]: Finished difference. Result has 181 places, 143 transitions, 1129 flow [2024-06-04 17:58:54,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1129, PETRI_PLACES=181, PETRI_TRANSITIONS=143} [2024-06-04 17:58:54,354 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 150 predicate places. [2024-06-04 17:58:54,355 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 143 transitions, 1129 flow [2024-06-04 17:58:54,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:54,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:54,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:54,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 17:58:54,355 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-04 17:58:54,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:54,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1342087459, now seen corresponding path program 2 times [2024-06-04 17:58:54,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:54,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594804424] [2024-06-04 17:58:54,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:54,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:00,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:00,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594804424] [2024-06-04 17:59:00,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594804424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:00,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:00,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:59:00,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578871278] [2024-06-04 17:59:00,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:00,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:59:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:59:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:59:01,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:59:01,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 143 transitions, 1129 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:01,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:01,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:59:01,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:01,416 INFO L124 PetriNetUnfolderBase]: 305/627 cut-off events. [2024-06-04 17:59:01,417 INFO L125 PetriNetUnfolderBase]: For 30055/30055 co-relation queries the response was YES. [2024-06-04 17:59:01,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 627 events. 305/627 cut-off events. For 30055/30055 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3227 event pairs, 33 based on Foata normal form. 8/634 useless extension candidates. Maximal degree in co-relation 3039. Up to 497 conditions per place. [2024-06-04 17:59:01,421 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 135 selfloop transitions, 10 changer transitions 12/161 dead transitions. [2024-06-04 17:59:01,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 161 transitions, 1515 flow [2024-06-04 17:59:01,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:59:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:59:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 17:59:01,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-04 17:59:01,422 INFO L175 Difference]: Start difference. First operand has 181 places, 143 transitions, 1129 flow. Second operand 10 states and 127 transitions. [2024-06-04 17:59:01,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 161 transitions, 1515 flow [2024-06-04 17:59:01,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 161 transitions, 1489 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 17:59:01,467 INFO L231 Difference]: Finished difference. Result has 175 places, 140 transitions, 1112 flow [2024-06-04 17:59:01,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1112, PETRI_PLACES=175, PETRI_TRANSITIONS=140} [2024-06-04 17:59:01,469 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 144 predicate places. [2024-06-04 17:59:01,469 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 140 transitions, 1112 flow [2024-06-04 17:59:01,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:01,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:01,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:01,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 17:59:01,469 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-04 17:59:01,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:01,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1349942621, now seen corresponding path program 3 times [2024-06-04 17:59:01,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:01,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119093886] [2024-06-04 17:59:01,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:01,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:07,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:07,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119093886] [2024-06-04 17:59:07,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119093886] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:07,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:07,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:59:07,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887044622] [2024-06-04 17:59:07,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:07,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:59:07,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:07,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:59:07,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:59:07,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:59:07,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 140 transitions, 1112 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:07,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:07,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:59:07,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:07,827 INFO L124 PetriNetUnfolderBase]: 324/672 cut-off events. [2024-06-04 17:59:07,827 INFO L125 PetriNetUnfolderBase]: For 42174/42174 co-relation queries the response was YES. [2024-06-04 17:59:07,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3888 conditions, 672 events. 324/672 cut-off events. For 42174/42174 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3505 event pairs, 42 based on Foata normal form. 8/679 useless extension candidates. Maximal degree in co-relation 3803. Up to 472 conditions per place. [2024-06-04 17:59:07,832 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 140 selfloop transitions, 12 changer transitions 7/163 dead transitions. [2024-06-04 17:59:07,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 163 transitions, 1692 flow [2024-06-04 17:59:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:59:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:59:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-04 17:59:07,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-04 17:59:07,833 INFO L175 Difference]: Start difference. First operand has 175 places, 140 transitions, 1112 flow. Second operand 10 states and 133 transitions. [2024-06-04 17:59:07,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 163 transitions, 1692 flow [2024-06-04 17:59:07,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 163 transitions, 1660 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-04 17:59:07,902 INFO L231 Difference]: Finished difference. Result has 171 places, 138 transitions, 1103 flow [2024-06-04 17:59:07,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1103, PETRI_PLACES=171, PETRI_TRANSITIONS=138} [2024-06-04 17:59:07,902 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 140 predicate places. [2024-06-04 17:59:07,902 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 138 transitions, 1103 flow [2024-06-04 17:59:07,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:07,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:07,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:07,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 17:59:07,903 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-04 17:59:07,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:07,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1341967489, now seen corresponding path program 4 times [2024-06-04 17:59:07,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:07,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730245386] [2024-06-04 17:59:07,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:07,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:13,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:13,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730245386] [2024-06-04 17:59:13,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730245386] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:13,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:13,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:59:13,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566511175] [2024-06-04 17:59:13,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:13,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:59:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:13,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:59:13,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:59:13,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:59:13,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 138 transitions, 1103 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:13,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:13,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:59:13,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:13,928 INFO L124 PetriNetUnfolderBase]: 293/611 cut-off events. [2024-06-04 17:59:13,928 INFO L125 PetriNetUnfolderBase]: For 28848/28848 co-relation queries the response was YES. [2024-06-04 17:59:13,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3076 conditions, 611 events. 293/611 cut-off events. For 28848/28848 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3112 event pairs, 33 based on Foata normal form. 10/620 useless extension candidates. Maximal degree in co-relation 2993. Up to 472 conditions per place. [2024-06-04 17:59:13,935 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 125 selfloop transitions, 6 changer transitions 21/156 dead transitions. [2024-06-04 17:59:13,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 156 transitions, 1519 flow [2024-06-04 17:59:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:59:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:59:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 17:59:13,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-04 17:59:13,939 INFO L175 Difference]: Start difference. First operand has 171 places, 138 transitions, 1103 flow. Second operand 10 states and 127 transitions. [2024-06-04 17:59:13,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 156 transitions, 1519 flow [2024-06-04 17:59:13,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 156 transitions, 1493 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:59:13,990 INFO L231 Difference]: Finished difference. Result has 170 places, 131 transitions, 1048 flow [2024-06-04 17:59:13,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1048, PETRI_PLACES=170, PETRI_TRANSITIONS=131} [2024-06-04 17:59:13,991 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 139 predicate places. [2024-06-04 17:59:13,991 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 131 transitions, 1048 flow [2024-06-04 17:59:13,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:13,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:13,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:13,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 17:59:13,992 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-04 17:59:13,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:13,992 INFO L85 PathProgramCache]: Analyzing trace with hash 976024187, now seen corresponding path program 5 times [2024-06-04 17:59:13,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:13,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528013072] [2024-06-04 17:59:13,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:13,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:21,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:21,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528013072] [2024-06-04 17:59:21,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528013072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:21,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:21,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:59:21,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245893845] [2024-06-04 17:59:21,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:21,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:59:21,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:21,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:59:21,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:59:21,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:59:21,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 131 transitions, 1048 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:21,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:21,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:59:21,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:21,435 INFO L124 PetriNetUnfolderBase]: 276/576 cut-off events. [2024-06-04 17:59:21,436 INFO L125 PetriNetUnfolderBase]: For 27815/27821 co-relation queries the response was YES. [2024-06-04 17:59:21,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2906 conditions, 576 events. 276/576 cut-off events. For 27815/27821 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2896 event pairs, 33 based on Foata normal form. 14/589 useless extension candidates. Maximal degree in co-relation 2824. Up to 410 conditions per place. [2024-06-04 17:59:21,440 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 104 selfloop transitions, 31 changer transitions 6/145 dead transitions. [2024-06-04 17:59:21,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 145 transitions, 1416 flow [2024-06-04 17:59:21,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:59:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:59:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-04 17:59:21,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 17:59:21,442 INFO L175 Difference]: Start difference. First operand has 170 places, 131 transitions, 1048 flow. Second operand 10 states and 130 transitions. [2024-06-04 17:59:21,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 145 transitions, 1416 flow [2024-06-04 17:59:21,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 145 transitions, 1374 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-04 17:59:21,478 INFO L231 Difference]: Finished difference. Result has 161 places, 129 transitions, 1080 flow [2024-06-04 17:59:21,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1080, PETRI_PLACES=161, PETRI_TRANSITIONS=129} [2024-06-04 17:59:21,479 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 130 predicate places. [2024-06-04 17:59:21,479 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 129 transitions, 1080 flow [2024-06-04 17:59:21,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:21,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:21,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:21,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 17:59:21,480 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-04 17:59:21,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash 984602011, now seen corresponding path program 1 times [2024-06-04 17:59:21,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:21,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903270078] [2024-06-04 17:59:21,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:21,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:30,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-04 17:59:30,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:30,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903270078] [2024-06-04 17:59:30,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903270078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:30,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:30,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:59:30,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130579918] [2024-06-04 17:59:30,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:30,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:59:30,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:30,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:59:30,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:59:31,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:59:31,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 129 transitions, 1080 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:31,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:31,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:59:31,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:31,340 INFO L124 PetriNetUnfolderBase]: 296/622 cut-off events. [2024-06-04 17:59:31,340 INFO L125 PetriNetUnfolderBase]: For 29647/29653 co-relation queries the response was YES. [2024-06-04 17:59:31,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 622 events. 296/622 cut-off events. For 29647/29653 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3225 event pairs, 52 based on Foata normal form. 10/631 useless extension candidates. Maximal degree in co-relation 3434. Up to 362 conditions per place. [2024-06-04 17:59:31,344 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 109 selfloop transitions, 27 changer transitions 7/147 dead transitions. [2024-06-04 17:59:31,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 147 transitions, 1566 flow [2024-06-04 17:59:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:59:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:59:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 17:59:31,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-04 17:59:31,346 INFO L175 Difference]: Start difference. First operand has 161 places, 129 transitions, 1080 flow. Second operand 10 states and 122 transitions. [2024-06-04 17:59:31,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 147 transitions, 1566 flow [2024-06-04 17:59:31,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 147 transitions, 1482 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-04 17:59:31,380 INFO L231 Difference]: Finished difference. Result has 161 places, 126 transitions, 1025 flow [2024-06-04 17:59:31,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1025, PETRI_PLACES=161, PETRI_TRANSITIONS=126} [2024-06-04 17:59:31,380 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 130 predicate places. [2024-06-04 17:59:31,380 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 126 transitions, 1025 flow [2024-06-04 17:59:31,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:31,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:31,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:31,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 17:59:31,381 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-04 17:59:31,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:31,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1670376355, now seen corresponding path program 6 times [2024-06-04 17:59:31,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:31,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776993399] [2024-06-04 17:59:31,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:31,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:37,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:37,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776993399] [2024-06-04 17:59:37,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776993399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:37,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:37,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:59:37,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241334403] [2024-06-04 17:59:37,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:37,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:59:37,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:37,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:59:37,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:59:38,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:59:38,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 126 transitions, 1025 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:38,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:38,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:59:38,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:38,407 INFO L124 PetriNetUnfolderBase]: 274/568 cut-off events. [2024-06-04 17:59:38,408 INFO L125 PetriNetUnfolderBase]: For 26165/26171 co-relation queries the response was YES. [2024-06-04 17:59:38,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3288 conditions, 568 events. 274/568 cut-off events. For 26165/26171 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2849 event pairs, 48 based on Foata normal form. 6/573 useless extension candidates. Maximal degree in co-relation 3210. Up to 451 conditions per place. [2024-06-04 17:59:38,412 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 108 selfloop transitions, 25 changer transitions 0/137 dead transitions. [2024-06-04 17:59:38,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 137 transitions, 1331 flow [2024-06-04 17:59:38,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:59:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:59:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 17:59:38,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 17:59:38,413 INFO L175 Difference]: Start difference. First operand has 161 places, 126 transitions, 1025 flow. Second operand 10 states and 125 transitions. [2024-06-04 17:59:38,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 137 transitions, 1331 flow [2024-06-04 17:59:38,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 137 transitions, 1280 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:59:38,454 INFO L231 Difference]: Finished difference. Result has 159 places, 127 transitions, 1048 flow [2024-06-04 17:59:38,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1048, PETRI_PLACES=159, PETRI_TRANSITIONS=127} [2024-06-04 17:59:38,455 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 128 predicate places. [2024-06-04 17:59:38,455 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 127 transitions, 1048 flow [2024-06-04 17:59:38,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:38,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:38,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:38,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 17:59:38,456 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-04 17:59:38,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:38,456 INFO L85 PathProgramCache]: Analyzing trace with hash 475784925, now seen corresponding path program 7 times [2024-06-04 17:59:38,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:38,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003280042] [2024-06-04 17:59:38,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:38,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:45,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003280042] [2024-06-04 17:59:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003280042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:45,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:45,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:59:45,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202644903] [2024-06-04 17:59:45,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:45,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:59:45,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:45,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:59:45,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:59:45,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 17:59:45,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 127 transitions, 1048 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-04 17:59:45,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:45,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 17:59:45,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:45,776 INFO L124 PetriNetUnfolderBase]: 279/583 cut-off events. [2024-06-04 17:59:45,777 INFO L125 PetriNetUnfolderBase]: For 29378/29384 co-relation queries the response was YES. [2024-06-04 17:59:45,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3239 conditions, 583 events. 279/583 cut-off events. For 29378/29384 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2950 event pairs, 49 based on Foata normal form. 12/594 useless extension candidates. Maximal degree in co-relation 3162. Up to 464 conditions per place. [2024-06-04 17:59:45,781 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 112 selfloop transitions, 15 changer transitions 9/140 dead transitions. [2024-06-04 17:59:45,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 140 transitions, 1380 flow [2024-06-04 17:59:45,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:59:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:59:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-04 17:59:45,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353125 [2024-06-04 17:59:45,782 INFO L175 Difference]: Start difference. First operand has 159 places, 127 transitions, 1048 flow. Second operand 10 states and 113 transitions. [2024-06-04 17:59:45,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 140 transitions, 1380 flow [2024-06-04 17:59:45,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 140 transitions, 1316 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:59:45,817 INFO L231 Difference]: Finished difference. Result has 161 places, 124 transitions, 986 flow [2024-06-04 17:59:45,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=986, PETRI_PLACES=161, PETRI_TRANSITIONS=124} [2024-06-04 17:59:45,817 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 130 predicate places. [2024-06-04 17:59:45,817 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 124 transitions, 986 flow [2024-06-04 17:59:45,818 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-04 17:59:45,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:45,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:45,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 17:59:45,818 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-04 17:59:45,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:45,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1664113301, now seen corresponding path program 2 times [2024-06-04 17:59:45,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:45,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145271383] [2024-06-04 17:59:45,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:45,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:59:54,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145271383] [2024-06-04 17:59:54,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145271383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:54,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:54,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 17:59:54,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784477211] [2024-06-04 17:59:54,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:54,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 17:59:54,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:54,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 17:59:54,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 17:59:54,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 17:59:54,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 124 transitions, 986 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:54,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:54,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 17:59:54,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:55,201 INFO L124 PetriNetUnfolderBase]: 274/576 cut-off events. [2024-06-04 17:59:55,201 INFO L125 PetriNetUnfolderBase]: For 30967/30973 co-relation queries the response was YES. [2024-06-04 17:59:55,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3160 conditions, 576 events. 274/576 cut-off events. For 30967/30973 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2945 event pairs, 49 based on Foata normal form. 12/587 useless extension candidates. Maximal degree in co-relation 3082. Up to 435 conditions per place. [2024-06-04 17:59:55,205 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 103 selfloop transitions, 22 changer transitions 9/138 dead transitions. [2024-06-04 17:59:55,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 138 transitions, 1316 flow [2024-06-04 17:59:55,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:59:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:59:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-04 17:59:55,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-04 17:59:55,206 INFO L175 Difference]: Start difference. First operand has 161 places, 124 transitions, 986 flow. Second operand 11 states and 138 transitions. [2024-06-04 17:59:55,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 138 transitions, 1316 flow [2024-06-04 17:59:55,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 138 transitions, 1284 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-04 17:59:55,242 INFO L231 Difference]: Finished difference. Result has 162 places, 121 transitions, 979 flow [2024-06-04 17:59:55,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=979, PETRI_PLACES=162, PETRI_TRANSITIONS=121} [2024-06-04 17:59:55,243 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2024-06-04 17:59:55,243 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 121 transitions, 979 flow [2024-06-04 17:59:55,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:55,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:55,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:55,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 17:59:55,244 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-04 17:59:55,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash 475607295, now seen corresponding path program 8 times [2024-06-04 17:59:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:55,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797266104] [2024-06-04 17:59:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:02,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:02,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797266104] [2024-06-04 18:00:02,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797266104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:02,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:02,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:00:02,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936878590] [2024-06-04 18:00:02,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:02,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:00:02,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:02,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:00:02,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:00:02,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:00:02,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 121 transitions, 979 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:02,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:02,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:00:02,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:02,796 INFO L124 PetriNetUnfolderBase]: 269/569 cut-off events. [2024-06-04 18:00:02,796 INFO L125 PetriNetUnfolderBase]: For 30333/30339 co-relation queries the response was YES. [2024-06-04 18:00:02,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 569 events. 269/569 cut-off events. For 30333/30339 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2875 event pairs, 45 based on Foata normal form. 12/580 useless extension candidates. Maximal degree in co-relation 3058. Up to 445 conditions per place. [2024-06-04 18:00:02,801 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 107 selfloop transitions, 11 changer transitions 13/135 dead transitions. [2024-06-04 18:00:02,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 135 transitions, 1303 flow [2024-06-04 18:00:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:00:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:00:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 18:00:02,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-04 18:00:02,805 INFO L175 Difference]: Start difference. First operand has 162 places, 121 transitions, 979 flow. Second operand 10 states and 123 transitions. [2024-06-04 18:00:02,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 135 transitions, 1303 flow [2024-06-04 18:00:02,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 135 transitions, 1255 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 18:00:02,842 INFO L231 Difference]: Finished difference. Result has 159 places, 116 transitions, 896 flow [2024-06-04 18:00:02,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=896, PETRI_PLACES=159, PETRI_TRANSITIONS=116} [2024-06-04 18:00:02,842 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 128 predicate places. [2024-06-04 18:00:02,843 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 116 transitions, 896 flow [2024-06-04 18:00:02,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:02,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:02,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:02,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 18:00:02,843 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-04 18:00:02,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:02,844 INFO L85 PathProgramCache]: Analyzing trace with hash 641841075, now seen corresponding path program 9 times [2024-06-04 18:00:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:02,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053407293] [2024-06-04 18:00:02,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:02,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:10,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:10,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053407293] [2024-06-04 18:00:10,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053407293] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:10,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:10,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:00:10,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294421858] [2024-06-04 18:00:10,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:10,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:00:10,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:10,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:00:10,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:00:10,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:00:10,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 116 transitions, 896 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:10,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:10,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:00:10,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:10,972 INFO L124 PetriNetUnfolderBase]: 251/531 cut-off events. [2024-06-04 18:00:10,973 INFO L125 PetriNetUnfolderBase]: For 23359/23359 co-relation queries the response was YES. [2024-06-04 18:00:10,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2935 conditions, 531 events. 251/531 cut-off events. For 23359/23359 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2645 event pairs, 39 based on Foata normal form. 2/532 useless extension candidates. Maximal degree in co-relation 2858. Up to 402 conditions per place. [2024-06-04 18:00:10,978 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 101 selfloop transitions, 23 changer transitions 0/128 dead transitions. [2024-06-04 18:00:10,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 128 transitions, 1188 flow [2024-06-04 18:00:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:00:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:00:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 18:00:10,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-04 18:00:10,980 INFO L175 Difference]: Start difference. First operand has 159 places, 116 transitions, 896 flow. Second operand 10 states and 127 transitions. [2024-06-04 18:00:10,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 128 transitions, 1188 flow [2024-06-04 18:00:11,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 128 transitions, 1158 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 18:00:11,030 INFO L231 Difference]: Finished difference. Result has 155 places, 117 transitions, 938 flow [2024-06-04 18:00:11,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=938, PETRI_PLACES=155, PETRI_TRANSITIONS=117} [2024-06-04 18:00:11,031 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 124 predicate places. [2024-06-04 18:00:11,031 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 117 transitions, 938 flow [2024-06-04 18:00:11,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:11,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:11,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:11,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 18:00:11,032 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-04 18:00:11,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash 83487561, now seen corresponding path program 3 times [2024-06-04 18:00:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:11,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426024114] [2024-06-04 18:00:11,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:11,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:20,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:20,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426024114] [2024-06-04 18:00:20,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426024114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:20,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:20,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:00:20,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705767312] [2024-06-04 18:00:20,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:20,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:00:20,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:20,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:00:20,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:00:20,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:00:20,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 117 transitions, 938 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:20,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:20,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:00:20,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:20,490 INFO L124 PetriNetUnfolderBase]: 256/546 cut-off events. [2024-06-04 18:00:20,491 INFO L125 PetriNetUnfolderBase]: For 26159/26159 co-relation queries the response was YES. [2024-06-04 18:00:20,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2897 conditions, 546 events. 256/546 cut-off events. For 26159/26159 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2746 event pairs, 50 based on Foata normal form. 8/553 useless extension candidates. Maximal degree in co-relation 2822. Up to 401 conditions per place. [2024-06-04 18:00:20,495 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 99 selfloop transitions, 15 changer transitions 13/131 dead transitions. [2024-06-04 18:00:20,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 131 transitions, 1254 flow [2024-06-04 18:00:20,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:00:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:00:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-04 18:00:20,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-04 18:00:20,496 INFO L175 Difference]: Start difference. First operand has 155 places, 117 transitions, 938 flow. Second operand 11 states and 137 transitions. [2024-06-04 18:00:20,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 131 transitions, 1254 flow [2024-06-04 18:00:20,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 131 transitions, 1192 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 18:00:20,527 INFO L231 Difference]: Finished difference. Result has 158 places, 111 transitions, 868 flow [2024-06-04 18:00:20,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=868, PETRI_PLACES=158, PETRI_TRANSITIONS=111} [2024-06-04 18:00:20,528 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2024-06-04 18:00:20,528 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 111 transitions, 868 flow [2024-06-04 18:00:20,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:20,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:20,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:20,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 18:00:20,529 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-04 18:00:20,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:20,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2070086999, now seen corresponding path program 10 times [2024-06-04 18:00:20,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:20,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918523527] [2024-06-04 18:00:20,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:20,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:28,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:28,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918523527] [2024-06-04 18:00:28,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918523527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:28,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:28,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:00:28,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965293953] [2024-06-04 18:00:28,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:28,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:00:28,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:28,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:00:28,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:00:28,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:00:28,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 111 transitions, 868 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:28,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:28,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:00:28,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:29,288 INFO L124 PetriNetUnfolderBase]: 236/506 cut-off events. [2024-06-04 18:00:29,288 INFO L125 PetriNetUnfolderBase]: For 21200/21200 co-relation queries the response was YES. [2024-06-04 18:00:29,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2712 conditions, 506 events. 236/506 cut-off events. For 21200/21200 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2467 event pairs, 40 based on Foata normal form. 2/507 useless extension candidates. Maximal degree in co-relation 2636. Up to 404 conditions per place. [2024-06-04 18:00:29,291 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 106 selfloop transitions, 14 changer transitions 0/124 dead transitions. [2024-06-04 18:00:29,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 124 transitions, 1156 flow [2024-06-04 18:00:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:00:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:00:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-04 18:00:29,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-04 18:00:29,293 INFO L175 Difference]: Start difference. First operand has 158 places, 111 transitions, 868 flow. Second operand 10 states and 121 transitions. [2024-06-04 18:00:29,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 124 transitions, 1156 flow [2024-06-04 18:00:29,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 124 transitions, 1112 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-06-04 18:00:29,325 INFO L231 Difference]: Finished difference. Result has 151 places, 112 transitions, 880 flow [2024-06-04 18:00:29,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=880, PETRI_PLACES=151, PETRI_TRANSITIONS=112} [2024-06-04 18:00:29,326 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-04 18:00:29,326 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 112 transitions, 880 flow [2024-06-04 18:00:29,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:29,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:29,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:29,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 18:00:29,326 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-04 18:00:29,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1399444643, now seen corresponding path program 11 times [2024-06-04 18:00:29,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:29,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353622209] [2024-06-04 18:00:29,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:29,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:37,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:37,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353622209] [2024-06-04 18:00:37,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353622209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:37,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:37,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:00:37,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714471524] [2024-06-04 18:00:37,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:37,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:00:37,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:37,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:00:37,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:00:37,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:00:37,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 112 transitions, 880 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:37,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:37,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:00:37,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:37,511 INFO L124 PetriNetUnfolderBase]: 240/512 cut-off events. [2024-06-04 18:00:37,511 INFO L125 PetriNetUnfolderBase]: For 18900/18900 co-relation queries the response was YES. [2024-06-04 18:00:37,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2709 conditions, 512 events. 240/512 cut-off events. For 18900/18900 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2492 event pairs, 47 based on Foata normal form. 2/511 useless extension candidates. Maximal degree in co-relation 2636. Up to 354 conditions per place. [2024-06-04 18:00:37,515 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 78 selfloop transitions, 39 changer transitions 0/121 dead transitions. [2024-06-04 18:00:37,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 121 transitions, 1152 flow [2024-06-04 18:00:37,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:00:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:00:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-04 18:00:37,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 18:00:37,517 INFO L175 Difference]: Start difference. First operand has 151 places, 112 transitions, 880 flow. Second operand 10 states and 128 transitions. [2024-06-04 18:00:37,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 121 transitions, 1152 flow [2024-06-04 18:00:37,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 121 transitions, 1108 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 18:00:37,552 INFO L231 Difference]: Finished difference. Result has 153 places, 113 transitions, 942 flow [2024-06-04 18:00:37,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=942, PETRI_PLACES=153, PETRI_TRANSITIONS=113} [2024-06-04 18:00:37,553 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2024-06-04 18:00:37,553 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 113 transitions, 942 flow [2024-06-04 18:00:37,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:37,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:37,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:37,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 18:00:37,554 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-04 18:00:37,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:37,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1807295599, now seen corresponding path program 4 times [2024-06-04 18:00:37,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:37,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581421967] [2024-06-04 18:00:37,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:37,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:44,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-04 18:00:44,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:44,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581421967] [2024-06-04 18:00:44,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581421967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:44,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:44,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:00:44,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116805405] [2024-06-04 18:00:44,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:44,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:00:44,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:44,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:00:44,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:00:44,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:00:44,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 113 transitions, 942 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:44,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:44,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:00:44,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:45,272 INFO L124 PetriNetUnfolderBase]: 270/580 cut-off events. [2024-06-04 18:00:45,273 INFO L125 PetriNetUnfolderBase]: For 32079/32079 co-relation queries the response was YES. [2024-06-04 18:00:45,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 580 events. 270/580 cut-off events. For 32079/32079 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2983 event pairs, 59 based on Foata normal form. 6/583 useless extension candidates. Maximal degree in co-relation 3301. Up to 326 conditions per place. [2024-06-04 18:00:45,277 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 76 selfloop transitions, 43 changer transitions 6/129 dead transitions. [2024-06-04 18:00:45,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 129 transitions, 1364 flow [2024-06-04 18:00:45,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:00:45,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:00:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-04 18:00:45,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119318181818182 [2024-06-04 18:00:45,279 INFO L175 Difference]: Start difference. First operand has 153 places, 113 transitions, 942 flow. Second operand 11 states and 145 transitions. [2024-06-04 18:00:45,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 129 transitions, 1364 flow [2024-06-04 18:00:45,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 129 transitions, 1268 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 18:00:45,321 INFO L231 Difference]: Finished difference. Result has 156 places, 111 transitions, 923 flow [2024-06-04 18:00:45,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=923, PETRI_PLACES=156, PETRI_TRANSITIONS=111} [2024-06-04 18:00:45,322 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-04 18:00:45,322 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 111 transitions, 923 flow [2024-06-04 18:00:45,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:45,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:45,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:45,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 18:00:45,323 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-04 18:00:45,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:45,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1399437699, now seen corresponding path program 5 times [2024-06-04 18:00:45,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:45,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251236661] [2024-06-04 18:00:45,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:45,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:53,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-04 18:00:53,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:53,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251236661] [2024-06-04 18:00:53,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251236661] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:53,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:53,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:00:53,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247693189] [2024-06-04 18:00:53,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:53,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:00:53,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:53,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:00:53,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:00:54,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:00:54,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 111 transitions, 923 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:54,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:54,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:00:54,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:54,536 INFO L124 PetriNetUnfolderBase]: 268/574 cut-off events. [2024-06-04 18:00:54,536 INFO L125 PetriNetUnfolderBase]: For 35517/35517 co-relation queries the response was YES. [2024-06-04 18:00:54,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3374 conditions, 574 events. 268/574 cut-off events. For 35517/35517 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2944 event pairs, 63 based on Foata normal form. 8/579 useless extension candidates. Maximal degree in co-relation 3299. Up to 351 conditions per place. [2024-06-04 18:00:54,541 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 62 selfloop transitions, 48 changer transitions 9/123 dead transitions. [2024-06-04 18:00:54,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 123 transitions, 1215 flow [2024-06-04 18:00:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:00:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:00:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-04 18:00:54,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119318181818182 [2024-06-04 18:00:54,542 INFO L175 Difference]: Start difference. First operand has 156 places, 111 transitions, 923 flow. Second operand 11 states and 145 transitions. [2024-06-04 18:00:54,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 123 transitions, 1215 flow [2024-06-04 18:00:54,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 123 transitions, 1135 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 18:00:54,584 INFO L231 Difference]: Finished difference. Result has 155 places, 108 transitions, 918 flow [2024-06-04 18:00:54,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=918, PETRI_PLACES=155, PETRI_TRANSITIONS=108} [2024-06-04 18:00:54,585 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 124 predicate places. [2024-06-04 18:00:54,585 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 108 transitions, 918 flow [2024-06-04 18:00:54,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:54,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:54,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:54,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 18:00:54,586 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-04 18:00:54,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:54,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1399207059, now seen corresponding path program 6 times [2024-06-04 18:00:54,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:54,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776979125] [2024-06-04 18:00:54,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:54,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:01:00,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:00,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776979125] [2024-06-04 18:01:00,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776979125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:00,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:00,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:01:00,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16471892] [2024-06-04 18:01:00,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:00,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:01:00,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:00,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:01:00,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:01:00,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:01:00,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 108 transitions, 918 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:00,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:00,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:01:00,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:01,225 INFO L124 PetriNetUnfolderBase]: 263/567 cut-off events. [2024-06-04 18:01:01,225 INFO L125 PetriNetUnfolderBase]: For 34081/34081 co-relation queries the response was YES. [2024-06-04 18:01:01,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3338 conditions, 567 events. 263/567 cut-off events. For 34081/34081 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2897 event pairs, 63 based on Foata normal form. 8/572 useless extension candidates. Maximal degree in co-relation 3265. Up to 376 conditions per place. [2024-06-04 18:01:01,229 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 69 selfloop transitions, 37 changer transitions 10/120 dead transitions. [2024-06-04 18:01:01,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 120 transitions, 1204 flow [2024-06-04 18:01:01,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:01:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:01:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-04 18:01:01,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2024-06-04 18:01:01,231 INFO L175 Difference]: Start difference. First operand has 155 places, 108 transitions, 918 flow. Second operand 11 states and 142 transitions. [2024-06-04 18:01:01,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 120 transitions, 1204 flow [2024-06-04 18:01:01,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 120 transitions, 1104 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 18:01:01,271 INFO L231 Difference]: Finished difference. Result has 153 places, 104 transitions, 866 flow [2024-06-04 18:01:01,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=866, PETRI_PLACES=153, PETRI_TRANSITIONS=104} [2024-06-04 18:01:01,271 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 122 predicate places. [2024-06-04 18:01:01,271 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 104 transitions, 866 flow [2024-06-04 18:01:01,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:01,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:01,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:01,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 18:01:01,280 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-04 18:01:01,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:01,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1627345793, now seen corresponding path program 12 times [2024-06-04 18:01:01,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:01,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134639891] [2024-06-04 18:01:01,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:01,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:01:10,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:10,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134639891] [2024-06-04 18:01:10,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134639891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:10,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:10,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:01:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342389980] [2024-06-04 18:01:10,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:10,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:01:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:10,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:01:10,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:01:11,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:01:11,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 104 transitions, 866 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:11,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:11,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:01:11,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:11,293 INFO L124 PetriNetUnfolderBase]: 249/535 cut-off events. [2024-06-04 18:01:11,293 INFO L125 PetriNetUnfolderBase]: For 26770/26770 co-relation queries the response was YES. [2024-06-04 18:01:11,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3189 conditions, 535 events. 249/535 cut-off events. For 26770/26770 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2658 event pairs, 61 based on Foata normal form. 2/534 useless extension candidates. Maximal degree in co-relation 3117. Up to 381 conditions per place. [2024-06-04 18:01:11,297 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 71 selfloop transitions, 38 changer transitions 0/113 dead transitions. [2024-06-04 18:01:11,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 113 transitions, 1124 flow [2024-06-04 18:01:11,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:01:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:01:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 18:01:11,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-04 18:01:11,298 INFO L175 Difference]: Start difference. First operand has 153 places, 104 transitions, 866 flow. Second operand 10 states and 127 transitions. [2024-06-04 18:01:11,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 113 transitions, 1124 flow [2024-06-04 18:01:11,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 113 transitions, 1039 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-04 18:01:11,332 INFO L231 Difference]: Finished difference. Result has 148 places, 105 transitions, 887 flow [2024-06-04 18:01:11,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=887, PETRI_PLACES=148, PETRI_TRANSITIONS=105} [2024-06-04 18:01:11,333 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-04 18:01:11,333 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 105 transitions, 887 flow [2024-06-04 18:01:11,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:11,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:11,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:11,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 18:01:11,333 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-04 18:01:11,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1627523423, now seen corresponding path program 13 times [2024-06-04 18:01:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:11,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808684475] [2024-06-04 18:01:11,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:11,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:01:18,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:18,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808684475] [2024-06-04 18:01:18,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808684475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:18,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:18,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:01:18,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809464079] [2024-06-04 18:01:18,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:18,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:01:18,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:18,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:01:18,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:01:18,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:01:18,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 105 transitions, 887 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:18,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:18,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:01:18,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:18,534 INFO L124 PetriNetUnfolderBase]: 282/602 cut-off events. [2024-06-04 18:01:18,534 INFO L125 PetriNetUnfolderBase]: For 35887/35887 co-relation queries the response was YES. [2024-06-04 18:01:18,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3934 conditions, 602 events. 282/602 cut-off events. For 35887/35887 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3103 event pairs, 72 based on Foata normal form. 2/601 useless extension candidates. Maximal degree in co-relation 3863. Up to 337 conditions per place. [2024-06-04 18:01:18,539 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 63 selfloop transitions, 53 changer transitions 0/120 dead transitions. [2024-06-04 18:01:18,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 120 transitions, 1313 flow [2024-06-04 18:01:18,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:01:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:01:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-04 18:01:18,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-04 18:01:18,540 INFO L175 Difference]: Start difference. First operand has 148 places, 105 transitions, 887 flow. Second operand 10 states and 136 transitions. [2024-06-04 18:01:18,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 120 transitions, 1313 flow [2024-06-04 18:01:18,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 120 transitions, 1217 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-04 18:01:18,580 INFO L231 Difference]: Finished difference. Result has 150 places, 107 transitions, 955 flow [2024-06-04 18:01:18,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=955, PETRI_PLACES=150, PETRI_TRANSITIONS=107} [2024-06-04 18:01:18,580 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 119 predicate places. [2024-06-04 18:01:18,580 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 107 transitions, 955 flow [2024-06-04 18:01:18,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:18,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:18,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:18,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 18:01:18,581 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-04 18:01:18,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1627338849, now seen corresponding path program 7 times [2024-06-04 18:01:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:18,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215277304] [2024-06-04 18:01:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:27,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-04 18:01:27,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215277304] [2024-06-04 18:01:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215277304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:27,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:27,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:01:27,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280459796] [2024-06-04 18:01:27,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:27,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:01:27,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:27,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:01:27,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:01:27,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:01:27,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 107 transitions, 955 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:27,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:27,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:01:27,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:27,885 INFO L124 PetriNetUnfolderBase]: 272/584 cut-off events. [2024-06-04 18:01:27,885 INFO L125 PetriNetUnfolderBase]: For 35526/35526 co-relation queries the response was YES. [2024-06-04 18:01:27,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 584 events. 272/584 cut-off events. For 35526/35526 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3025 event pairs, 66 based on Foata normal form. 8/589 useless extension candidates. Maximal degree in co-relation 3481. Up to 401 conditions per place. [2024-06-04 18:01:27,890 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 70 selfloop transitions, 36 changer transitions 9/119 dead transitions. [2024-06-04 18:01:27,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 119 transitions, 1237 flow [2024-06-04 18:01:27,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:01:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:01:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-04 18:01:27,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-04 18:01:27,892 INFO L175 Difference]: Start difference. First operand has 150 places, 107 transitions, 955 flow. Second operand 11 states and 140 transitions. [2024-06-04 18:01:27,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 119 transitions, 1237 flow [2024-06-04 18:01:27,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 119 transitions, 1126 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 18:01:27,933 INFO L231 Difference]: Finished difference. Result has 154 places, 104 transitions, 898 flow [2024-06-04 18:01:27,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=898, PETRI_PLACES=154, PETRI_TRANSITIONS=104} [2024-06-04 18:01:27,933 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 123 predicate places. [2024-06-04 18:01:27,934 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 104 transitions, 898 flow [2024-06-04 18:01:27,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:27,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:27,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:27,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 18:01:27,934 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-04 18:01:27,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:27,935 INFO L85 PathProgramCache]: Analyzing trace with hash -76431201, now seen corresponding path program 8 times [2024-06-04 18:01:27,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:27,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542296195] [2024-06-04 18:01:27,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:27,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:01:34,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:34,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542296195] [2024-06-04 18:01:34,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542296195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:34,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:34,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:01:34,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720408948] [2024-06-04 18:01:34,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:34,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:01:34,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:34,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:01:34,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:01:34,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:01:34,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 104 transitions, 898 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:34,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:34,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:01:34,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:35,270 INFO L124 PetriNetUnfolderBase]: 285/629 cut-off events. [2024-06-04 18:01:35,271 INFO L125 PetriNetUnfolderBase]: For 42210/42210 co-relation queries the response was YES. [2024-06-04 18:01:35,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4010 conditions, 629 events. 285/629 cut-off events. For 42210/42210 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3360 event pairs, 74 based on Foata normal form. 6/634 useless extension candidates. Maximal degree in co-relation 3937. Up to 374 conditions per place. [2024-06-04 18:01:35,276 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 94 selfloop transitions, 16 changer transitions 9/123 dead transitions. [2024-06-04 18:01:35,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 123 transitions, 1314 flow [2024-06-04 18:01:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:01:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:01:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-04 18:01:35,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-04 18:01:35,277 INFO L175 Difference]: Start difference. First operand has 154 places, 104 transitions, 898 flow. Second operand 11 states and 144 transitions. [2024-06-04 18:01:35,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 123 transitions, 1314 flow [2024-06-04 18:01:35,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 123 transitions, 1234 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 18:01:35,328 INFO L231 Difference]: Finished difference. Result has 151 places, 101 transitions, 837 flow [2024-06-04 18:01:35,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=837, PETRI_PLACES=151, PETRI_TRANSITIONS=101} [2024-06-04 18:01:35,329 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-04 18:01:35,329 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 101 transitions, 837 flow [2024-06-04 18:01:35,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:35,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:35,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:35,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 18:01:35,330 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-04 18:01:35,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:35,330 INFO L85 PathProgramCache]: Analyzing trace with hash -86262231, now seen corresponding path program 9 times [2024-06-04 18:01:35,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:35,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435358692] [2024-06-04 18:01:35,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:35,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:01:41,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:41,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435358692] [2024-06-04 18:01:41,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435358692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:41,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:41,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:01:41,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089161169] [2024-06-04 18:01:41,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:41,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:01:41,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:41,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:01:41,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:01:41,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:01:41,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 101 transitions, 837 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:41,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:41,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:01:41,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:42,266 INFO L124 PetriNetUnfolderBase]: 307/673 cut-off events. [2024-06-04 18:01:42,266 INFO L125 PetriNetUnfolderBase]: For 48273/48273 co-relation queries the response was YES. [2024-06-04 18:01:42,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4486 conditions, 673 events. 307/673 cut-off events. For 48273/48273 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3649 event pairs, 86 based on Foata normal form. 6/678 useless extension candidates. Maximal degree in co-relation 4414. Up to 499 conditions per place. [2024-06-04 18:01:42,272 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 94 selfloop transitions, 21 changer transitions 6/125 dead transitions. [2024-06-04 18:01:42,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 125 transitions, 1295 flow [2024-06-04 18:01:42,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 18:01:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 18:01:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 154 transitions. [2024-06-04 18:01:42,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010416666666667 [2024-06-04 18:01:42,274 INFO L175 Difference]: Start difference. First operand has 151 places, 101 transitions, 837 flow. Second operand 12 states and 154 transitions. [2024-06-04 18:01:42,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 125 transitions, 1295 flow [2024-06-04 18:01:42,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 125 transitions, 1254 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-04 18:01:42,322 INFO L231 Difference]: Finished difference. Result has 150 places, 103 transitions, 869 flow [2024-06-04 18:01:42,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=869, PETRI_PLACES=150, PETRI_TRANSITIONS=103} [2024-06-04 18:01:42,322 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 119 predicate places. [2024-06-04 18:01:42,322 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 103 transitions, 869 flow [2024-06-04 18:01:42,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:42,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:42,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:42,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 18:01:42,323 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-04 18:01:42,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:42,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1750443433, now seen corresponding path program 14 times [2024-06-04 18:01:42,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:42,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274242466] [2024-06-04 18:01:42,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:42,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:01:48,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:48,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274242466] [2024-06-04 18:01:48,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274242466] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:48,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:48,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:01:48,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108223396] [2024-06-04 18:01:48,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:48,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:01:48,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:48,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:01:48,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:01:48,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:01:48,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 103 transitions, 869 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:48,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:48,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:01:48,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:49,237 INFO L124 PetriNetUnfolderBase]: 309/673 cut-off events. [2024-06-04 18:01:49,237 INFO L125 PetriNetUnfolderBase]: For 48196/48196 co-relation queries the response was YES. [2024-06-04 18:01:49,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4487 conditions, 673 events. 309/673 cut-off events. For 48196/48196 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3668 event pairs, 90 based on Foata normal form. 10/680 useless extension candidates. Maximal degree in co-relation 4416. Up to 512 conditions per place. [2024-06-04 18:01:49,242 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 75 selfloop transitions, 30 changer transitions 6/115 dead transitions. [2024-06-04 18:01:49,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 115 transitions, 1167 flow [2024-06-04 18:01:49,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:01:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:01:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-04 18:01:49,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 18:01:49,244 INFO L175 Difference]: Start difference. First operand has 150 places, 103 transitions, 869 flow. Second operand 10 states and 130 transitions. [2024-06-04 18:01:49,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 115 transitions, 1167 flow [2024-06-04 18:01:49,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 115 transitions, 1099 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-04 18:01:49,290 INFO L231 Difference]: Finished difference. Result has 148 places, 101 transitions, 873 flow [2024-06-04 18:01:49,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=873, PETRI_PLACES=148, PETRI_TRANSITIONS=101} [2024-06-04 18:01:49,291 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-04 18:01:49,291 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 101 transitions, 873 flow [2024-06-04 18:01:49,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:49,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:49,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:49,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 18:01:49,291 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-04 18:01:49,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2050740645, now seen corresponding path program 10 times [2024-06-04 18:01:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:49,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359700850] [2024-06-04 18:01:49,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:49,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:01:56,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:56,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359700850] [2024-06-04 18:01:56,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359700850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:56,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:56,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:01:56,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130206094] [2024-06-04 18:01:56,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:56,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:01:56,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:56,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:01:56,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:01:56,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:01:56,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 101 transitions, 873 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:56,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:56,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:01:56,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:56,824 INFO L124 PetriNetUnfolderBase]: 315/689 cut-off events. [2024-06-04 18:01:56,824 INFO L125 PetriNetUnfolderBase]: For 49836/49836 co-relation queries the response was YES. [2024-06-04 18:01:56,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4761 conditions, 689 events. 315/689 cut-off events. For 49836/49836 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3790 event pairs, 95 based on Foata normal form. 6/692 useless extension candidates. Maximal degree in co-relation 4693. Up to 465 conditions per place. [2024-06-04 18:01:56,829 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 78 selfloop transitions, 28 changer transitions 7/117 dead transitions. [2024-06-04 18:01:56,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 117 transitions, 1263 flow [2024-06-04 18:01:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:01:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:01:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-04 18:01:56,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4005681818181818 [2024-06-04 18:01:56,830 INFO L175 Difference]: Start difference. First operand has 148 places, 101 transitions, 873 flow. Second operand 11 states and 141 transitions. [2024-06-04 18:01:56,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 117 transitions, 1263 flow [2024-06-04 18:01:56,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 117 transitions, 1160 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-06-04 18:01:56,874 INFO L231 Difference]: Finished difference. Result has 149 places, 98 transitions, 802 flow [2024-06-04 18:01:56,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=138, 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=11, PETRI_FLOW=802, PETRI_PLACES=149, PETRI_TRANSITIONS=98} [2024-06-04 18:01:56,874 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 118 predicate places. [2024-06-04 18:01:56,874 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 98 transitions, 802 flow [2024-06-04 18:01:56,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:56,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:56,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:56,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 18:01:56,875 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-04 18:01:56,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1998590779, now seen corresponding path program 15 times [2024-06-04 18:01:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:56,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403029969] [2024-06-04 18:01:56,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:56,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:02:04,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:04,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403029969] [2024-06-04 18:02:04,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403029969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:04,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:04,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:02:04,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34144401] [2024-06-04 18:02:04,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:04,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:02:04,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:04,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:02:04,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:02:04,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:02:04,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 98 transitions, 802 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:04,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:04,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:02:04,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:05,171 INFO L124 PetriNetUnfolderBase]: 266/588 cut-off events. [2024-06-04 18:02:05,171 INFO L125 PetriNetUnfolderBase]: For 46120/46120 co-relation queries the response was YES. [2024-06-04 18:02:05,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 588 events. 266/588 cut-off events. For 46120/46120 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3058 event pairs, 74 based on Foata normal form. 18/605 useless extension candidates. Maximal degree in co-relation 3469. Up to 434 conditions per place. [2024-06-04 18:02:05,176 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 81 selfloop transitions, 16 changer transitions 10/111 dead transitions. [2024-06-04 18:02:05,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 111 transitions, 1072 flow [2024-06-04 18:02:05,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:02:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:02:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-04 18:02:05,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-04 18:02:05,177 INFO L175 Difference]: Start difference. First operand has 149 places, 98 transitions, 802 flow. Second operand 10 states and 129 transitions. [2024-06-04 18:02:05,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 111 transitions, 1072 flow [2024-06-04 18:02:05,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 111 transitions, 971 flow, removed 17 selfloop flow, removed 12 redundant places. [2024-06-04 18:02:05,219 INFO L231 Difference]: Finished difference. Result has 144 places, 91 transitions, 689 flow [2024-06-04 18:02:05,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=689, PETRI_PLACES=144, PETRI_TRANSITIONS=91} [2024-06-04 18:02:05,219 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-04 18:02:05,219 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 91 transitions, 689 flow [2024-06-04 18:02:05,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:05,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:05,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:05,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 18:02:05,220 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-04 18:02:05,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2007168603, now seen corresponding path program 11 times [2024-06-04 18:02:05,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:05,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572790522] [2024-06-04 18:02:05,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:02:12,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:12,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572790522] [2024-06-04 18:02:12,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572790522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:12,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:12,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:02:12,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400747881] [2024-06-04 18:02:12,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:12,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:02:12,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:12,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:02:12,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:02:12,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:02:12,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 91 transitions, 689 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:12,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:12,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:02:12,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:12,780 INFO L124 PetriNetUnfolderBase]: 253/559 cut-off events. [2024-06-04 18:02:12,781 INFO L125 PetriNetUnfolderBase]: For 36567/36567 co-relation queries the response was YES. [2024-06-04 18:02:12,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3453 conditions, 559 events. 253/559 cut-off events. For 36567/36567 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2815 event pairs, 77 based on Foata normal form. 6/564 useless extension candidates. Maximal degree in co-relation 3388. Up to 413 conditions per place. [2024-06-04 18:02:12,785 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 85 selfloop transitions, 13 changer transitions 7/109 dead transitions. [2024-06-04 18:02:12,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 109 transitions, 1057 flow [2024-06-04 18:02:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:02:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:02:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-04 18:02:12,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-04 18:02:12,787 INFO L175 Difference]: Start difference. First operand has 144 places, 91 transitions, 689 flow. Second operand 11 states and 139 transitions. [2024-06-04 18:02:12,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 109 transitions, 1057 flow [2024-06-04 18:02:12,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 109 transitions, 991 flow, removed 3 selfloop flow, removed 14 redundant places. [2024-06-04 18:02:12,844 INFO L231 Difference]: Finished difference. Result has 139 places, 88 transitions, 634 flow [2024-06-04 18:02:12,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=634, PETRI_PLACES=139, PETRI_TRANSITIONS=88} [2024-06-04 18:02:12,845 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 108 predicate places. [2024-06-04 18:02:12,845 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 88 transitions, 634 flow [2024-06-04 18:02:12,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:12,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:12,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:12,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 18:02:12,846 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-04 18:02:12,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1325274819, now seen corresponding path program 12 times [2024-06-04 18:02:12,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:12,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767470231] [2024-06-04 18:02:12,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:12,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:02:22,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:22,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767470231] [2024-06-04 18:02:22,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767470231] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:22,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:22,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:02:22,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175014968] [2024-06-04 18:02:22,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:22,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:02:22,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:22,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:02:22,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:02:22,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:02:22,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 88 transitions, 634 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:22,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:22,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:02:22,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:23,369 INFO L124 PetriNetUnfolderBase]: 250/548 cut-off events. [2024-06-04 18:02:23,370 INFO L125 PetriNetUnfolderBase]: For 40431/40431 co-relation queries the response was YES. [2024-06-04 18:02:23,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3432 conditions, 548 events. 250/548 cut-off events. For 40431/40431 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2760 event pairs, 81 based on Foata normal form. 8/553 useless extension candidates. Maximal degree in co-relation 3366. Up to 421 conditions per place. [2024-06-04 18:02:23,373 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 63 selfloop transitions, 24 changer transitions 9/100 dead transitions. [2024-06-04 18:02:23,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 100 transitions, 872 flow [2024-06-04 18:02:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:02:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:02:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-04 18:02:23,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-04 18:02:23,375 INFO L175 Difference]: Start difference. First operand has 139 places, 88 transitions, 634 flow. Second operand 11 states and 138 transitions. [2024-06-04 18:02:23,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 100 transitions, 872 flow [2024-06-04 18:02:23,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 100 transitions, 844 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 18:02:23,411 INFO L231 Difference]: Finished difference. Result has 137 places, 85 transitions, 636 flow [2024-06-04 18:02:23,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=636, PETRI_PLACES=137, PETRI_TRANSITIONS=85} [2024-06-04 18:02:23,411 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 106 predicate places. [2024-06-04 18:02:23,411 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 85 transitions, 636 flow [2024-06-04 18:02:23,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:23,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:23,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:23,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 18:02:23,412 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-04 18:02:23,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:23,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1998597723, now seen corresponding path program 13 times [2024-06-04 18:02:23,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:23,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895229529] [2024-06-04 18:02:23,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:23,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:02:32,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:32,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895229529] [2024-06-04 18:02:32,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895229529] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:32,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:32,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:02:32,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346491131] [2024-06-04 18:02:32,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:32,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:02:32,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:32,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:02:32,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:02:32,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:02:32,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 85 transitions, 636 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:32,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:32,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:02:32,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:33,053 INFO L124 PetriNetUnfolderBase]: 223/497 cut-off events. [2024-06-04 18:02:33,053 INFO L125 PetriNetUnfolderBase]: For 31483/31483 co-relation queries the response was YES. [2024-06-04 18:02:33,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2892 conditions, 497 events. 223/497 cut-off events. For 31483/31483 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2398 event pairs, 67 based on Foata normal form. 8/504 useless extension candidates. Maximal degree in co-relation 2827. Up to 400 conditions per place. [2024-06-04 18:02:33,057 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 76 selfloop transitions, 12 changer transitions 6/98 dead transitions. [2024-06-04 18:02:33,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 98 transitions, 874 flow [2024-06-04 18:02:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:02:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:02:33,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 18:02:33,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 18:02:33,058 INFO L175 Difference]: Start difference. First operand has 137 places, 85 transitions, 636 flow. Second operand 10 states and 125 transitions. [2024-06-04 18:02:33,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 98 transitions, 874 flow [2024-06-04 18:02:33,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 98 transitions, 822 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 18:02:33,090 INFO L231 Difference]: Finished difference. Result has 134 places, 82 transitions, 590 flow [2024-06-04 18:02:33,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=124, 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=10, PETRI_FLOW=590, PETRI_PLACES=134, PETRI_TRANSITIONS=82} [2024-06-04 18:02:33,091 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2024-06-04 18:02:33,091 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 82 transitions, 590 flow [2024-06-04 18:02:33,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:33,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:33,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:33,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 18:02:33,092 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-04 18:02:33,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:33,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1553182913, now seen corresponding path program 16 times [2024-06-04 18:02:33,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:33,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509524997] [2024-06-04 18:02:33,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:33,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:41,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-04 18:02:41,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:41,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509524997] [2024-06-04 18:02:41,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509524997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:41,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:41,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:02:41,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475744377] [2024-06-04 18:02:41,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:41,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:02:41,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:41,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:02:41,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:02:41,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:02:41,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 82 transitions, 590 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:41,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:41,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:02:41,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:42,118 INFO L124 PetriNetUnfolderBase]: 210/468 cut-off events. [2024-06-04 18:02:42,118 INFO L125 PetriNetUnfolderBase]: For 25279/25279 co-relation queries the response was YES. [2024-06-04 18:02:42,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2776 conditions, 468 events. 210/468 cut-off events. For 25279/25279 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2223 event pairs, 67 based on Foata normal form. 2/467 useless extension candidates. Maximal degree in co-relation 2712. Up to 367 conditions per place. [2024-06-04 18:02:42,121 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 61 selfloop transitions, 26 changer transitions 0/91 dead transitions. [2024-06-04 18:02:42,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 91 transitions, 808 flow [2024-06-04 18:02:42,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:02:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:02:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 18:02:42,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 18:02:42,123 INFO L175 Difference]: Start difference. First operand has 134 places, 82 transitions, 590 flow. Second operand 10 states and 125 transitions. [2024-06-04 18:02:42,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 91 transitions, 808 flow [2024-06-04 18:02:42,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 91 transitions, 778 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 18:02:42,151 INFO L231 Difference]: Finished difference. Result has 131 places, 83 transitions, 646 flow [2024-06-04 18:02:42,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=646, PETRI_PLACES=131, PETRI_TRANSITIONS=83} [2024-06-04 18:02:42,152 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 100 predicate places. [2024-06-04 18:02:42,152 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 83 transitions, 646 flow [2024-06-04 18:02:42,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:42,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:42,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:42,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 18:02:42,153 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-04 18:02:42,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:42,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1553360543, now seen corresponding path program 17 times [2024-06-04 18:02:42,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:42,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91100081] [2024-06-04 18:02:42,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:42,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:02:51,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:51,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91100081] [2024-06-04 18:02:51,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91100081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:51,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:51,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:02:51,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688414259] [2024-06-04 18:02:51,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:51,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:02:51,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:51,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:02:51,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:02:51,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:02:51,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 83 transitions, 646 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:51,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:51,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:02:51,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:51,820 INFO L124 PetriNetUnfolderBase]: 214/476 cut-off events. [2024-06-04 18:02:51,821 INFO L125 PetriNetUnfolderBase]: For 24735/24735 co-relation queries the response was YES. [2024-06-04 18:02:51,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 476 events. 214/476 cut-off events. For 24735/24735 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2268 event pairs, 67 based on Foata normal form. 2/475 useless extension candidates. Maximal degree in co-relation 2787. Up to 358 conditions per place. [2024-06-04 18:02:51,824 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 63 selfloop transitions, 26 changer transitions 0/93 dead transitions. [2024-06-04 18:02:51,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 93 transitions, 872 flow [2024-06-04 18:02:51,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:02:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:02:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 18:02:51,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-04 18:02:51,825 INFO L175 Difference]: Start difference. First operand has 131 places, 83 transitions, 646 flow. Second operand 10 states and 126 transitions. [2024-06-04 18:02:51,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 93 transitions, 872 flow [2024-06-04 18:02:51,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 93 transitions, 796 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-04 18:02:51,855 INFO L231 Difference]: Finished difference. Result has 133 places, 84 transitions, 658 flow [2024-06-04 18:02:51,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=658, PETRI_PLACES=133, PETRI_TRANSITIONS=84} [2024-06-04 18:02:51,856 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 102 predicate places. [2024-06-04 18:02:51,856 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 84 transitions, 658 flow [2024-06-04 18:02:51,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:51,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:51,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:51,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 18:02:51,857 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-04 18:02:51,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:51,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2007754621, now seen corresponding path program 14 times [2024-06-04 18:02:51,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:51,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117368548] [2024-06-04 18:02:51,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:51,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:00,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-04 18:03:00,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:00,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117368548] [2024-06-04 18:03:00,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117368548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:00,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:00,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:03:00,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736231337] [2024-06-04 18:03:00,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:00,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:03:00,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:00,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:03:00,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:03:00,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:03:00,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 84 transitions, 658 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:00,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:00,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:03:00,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:01,088 INFO L124 PetriNetUnfolderBase]: 204/458 cut-off events. [2024-06-04 18:03:01,089 INFO L125 PetriNetUnfolderBase]: For 23938/23938 co-relation queries the response was YES. [2024-06-04 18:03:01,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 458 events. 204/458 cut-off events. For 23938/23938 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2170 event pairs, 59 based on Foata normal form. 8/463 useless extension candidates. Maximal degree in co-relation 2395. Up to 331 conditions per place. [2024-06-04 18:03:01,092 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 60 selfloop transitions, 22 changer transitions 9/95 dead transitions. [2024-06-04 18:03:01,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 95 transitions, 870 flow [2024-06-04 18:03:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:03:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:03:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-04 18:03:01,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-04 18:03:01,093 INFO L175 Difference]: Start difference. First operand has 133 places, 84 transitions, 658 flow. Second operand 11 states and 137 transitions. [2024-06-04 18:03:01,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 95 transitions, 870 flow [2024-06-04 18:03:01,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 95 transitions, 788 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-04 18:03:01,117 INFO L231 Difference]: Finished difference. Result has 136 places, 80 transitions, 590 flow [2024-06-04 18:03:01,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=590, PETRI_PLACES=136, PETRI_TRANSITIONS=80} [2024-06-04 18:03:01,118 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 105 predicate places. [2024-06-04 18:03:01,118 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 80 transitions, 590 flow [2024-06-04 18:03:01,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:01,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:01,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:01,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 18:03:01,119 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-04 18:03:01,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:01,119 INFO L85 PathProgramCache]: Analyzing trace with hash 853754559, now seen corresponding path program 18 times [2024-06-04 18:03:01,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:01,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720734343] [2024-06-04 18:03:01,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:01,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:03:08,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:08,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720734343] [2024-06-04 18:03:08,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720734343] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:08,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:03:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597166500] [2024-06-04 18:03:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:08,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:03:08,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:08,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:03:08,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:03:08,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:03:08,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 80 transitions, 590 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:08,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:08,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:03:08,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:08,485 INFO L124 PetriNetUnfolderBase]: 191/431 cut-off events. [2024-06-04 18:03:08,486 INFO L125 PetriNetUnfolderBase]: For 19967/19967 co-relation queries the response was YES. [2024-06-04 18:03:08,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2354 conditions, 431 events. 191/431 cut-off events. For 19967/19967 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1973 event pairs, 57 based on Foata normal form. 2/430 useless extension candidates. Maximal degree in co-relation 2289. Up to 348 conditions per place. [2024-06-04 18:03:08,488 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 66 selfloop transitions, 19 changer transitions 0/89 dead transitions. [2024-06-04 18:03:08,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 89 transitions, 808 flow [2024-06-04 18:03:08,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:03:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:03:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-04 18:03:08,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-04 18:03:08,490 INFO L175 Difference]: Start difference. First operand has 136 places, 80 transitions, 590 flow. Second operand 10 states and 121 transitions. [2024-06-04 18:03:08,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 89 transitions, 808 flow [2024-06-04 18:03:08,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 89 transitions, 733 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-06-04 18:03:08,512 INFO L231 Difference]: Finished difference. Result has 130 places, 81 transitions, 591 flow [2024-06-04 18:03:08,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=591, PETRI_PLACES=130, PETRI_TRANSITIONS=81} [2024-06-04 18:03:08,512 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 99 predicate places. [2024-06-04 18:03:08,512 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 81 transitions, 591 flow [2024-06-04 18:03:08,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:08,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:08,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:08,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 18:03:08,513 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-04 18:03:08,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:08,513 INFO L85 PathProgramCache]: Analyzing trace with hash 858218559, now seen corresponding path program 19 times [2024-06-04 18:03:08,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:08,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064529460] [2024-06-04 18:03:08,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:08,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:03:15,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:15,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064529460] [2024-06-04 18:03:15,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064529460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:15,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:15,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:03:15,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718189185] [2024-06-04 18:03:15,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:15,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:03:15,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:15,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:03:15,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:03:15,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:03:15,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 81 transitions, 591 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:15,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:15,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:03:15,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:16,226 INFO L124 PetriNetUnfolderBase]: 195/439 cut-off events. [2024-06-04 18:03:16,226 INFO L125 PetriNetUnfolderBase]: For 19359/19359 co-relation queries the response was YES. [2024-06-04 18:03:16,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 439 events. 195/439 cut-off events. For 19359/19359 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2025 event pairs, 57 based on Foata normal form. 2/438 useless extension candidates. Maximal degree in co-relation 2285. Up to 342 conditions per place. [2024-06-04 18:03:16,229 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 67 selfloop transitions, 20 changer transitions 0/91 dead transitions. [2024-06-04 18:03:16,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 91 transitions, 815 flow [2024-06-04 18:03:16,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:03:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:03:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 18:03:16,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-04 18:03:16,231 INFO L175 Difference]: Start difference. First operand has 130 places, 81 transitions, 591 flow. Second operand 10 states and 123 transitions. [2024-06-04 18:03:16,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 91 transitions, 815 flow [2024-06-04 18:03:16,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 91 transitions, 753 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 18:03:16,256 INFO L231 Difference]: Finished difference. Result has 133 places, 82 transitions, 607 flow [2024-06-04 18:03:16,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=607, PETRI_PLACES=133, PETRI_TRANSITIONS=82} [2024-06-04 18:03:16,257 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 102 predicate places. [2024-06-04 18:03:16,257 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 82 transitions, 607 flow [2024-06-04 18:03:16,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:16,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:16,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:16,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 18:03:16,257 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-04 18:03:16,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash 119597883, now seen corresponding path program 20 times [2024-06-04 18:03:16,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:16,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697266910] [2024-06-04 18:03:16,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:16,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:03:24,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:24,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697266910] [2024-06-04 18:03:24,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697266910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:24,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:24,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:03:24,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184894410] [2024-06-04 18:03:24,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:24,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:03:24,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:24,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:03:24,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:03:24,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:03:24,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 82 transitions, 607 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:24,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:24,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:03:24,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:24,869 INFO L124 PetriNetUnfolderBase]: 192/434 cut-off events. [2024-06-04 18:03:24,870 INFO L125 PetriNetUnfolderBase]: For 18185/18185 co-relation queries the response was YES. [2024-06-04 18:03:24,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 434 events. 192/434 cut-off events. For 18185/18185 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2007 event pairs, 54 based on Foata normal form. 2/433 useless extension candidates. Maximal degree in co-relation 2143. Up to 341 conditions per place. [2024-06-04 18:03:24,872 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 70 selfloop transitions, 18 changer transitions 0/92 dead transitions. [2024-06-04 18:03:24,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 92 transitions, 803 flow [2024-06-04 18:03:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:03:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:03:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 18:03:24,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2024-06-04 18:03:24,874 INFO L175 Difference]: Start difference. First operand has 133 places, 82 transitions, 607 flow. Second operand 10 states and 122 transitions. [2024-06-04 18:03:24,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 92 transitions, 803 flow [2024-06-04 18:03:24,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 92 transitions, 735 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 18:03:24,897 INFO L231 Difference]: Finished difference. Result has 135 places, 82 transitions, 579 flow [2024-06-04 18:03:24,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=579, PETRI_PLACES=135, PETRI_TRANSITIONS=82} [2024-06-04 18:03:24,898 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 104 predicate places. [2024-06-04 18:03:24,898 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 82 transitions, 579 flow [2024-06-04 18:03:24,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:24,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:24,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:24,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 18:03:24,898 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-04 18:03:24,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:24,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1147730830, now seen corresponding path program 1 times [2024-06-04 18:03:24,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:24,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326437429] [2024-06-04 18:03:24,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:24,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:03:33,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:33,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326437429] [2024-06-04 18:03:33,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326437429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:33,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:33,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:03:33,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492510536] [2024-06-04 18:03:33,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:33,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:03:33,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:33,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:03:33,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:03:33,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 18:03:33,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 82 transitions, 579 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:33,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:33,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 18:03:33,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:33,623 INFO L124 PetriNetUnfolderBase]: 196/444 cut-off events. [2024-06-04 18:03:33,623 INFO L125 PetriNetUnfolderBase]: For 18595/18595 co-relation queries the response was YES. [2024-06-04 18:03:33,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2199 conditions, 444 events. 196/444 cut-off events. For 18595/18595 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2077 event pairs, 43 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 2135. Up to 348 conditions per place. [2024-06-04 18:03:33,626 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 77 selfloop transitions, 14 changer transitions 0/95 dead transitions. [2024-06-04 18:03:33,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 95 transitions, 795 flow [2024-06-04 18:03:33,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:03:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:03:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-04 18:03:33,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-04 18:03:33,627 INFO L175 Difference]: Start difference. First operand has 135 places, 82 transitions, 579 flow. Second operand 10 states and 112 transitions. [2024-06-04 18:03:33,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 95 transitions, 795 flow [2024-06-04 18:03:33,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 95 transitions, 687 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-04 18:03:33,650 INFO L231 Difference]: Finished difference. Result has 135 places, 83 transitions, 513 flow [2024-06-04 18:03:33,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=513, PETRI_PLACES=135, PETRI_TRANSITIONS=83} [2024-06-04 18:03:33,659 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 104 predicate places. [2024-06-04 18:03:33,660 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 83 transitions, 513 flow [2024-06-04 18:03:33,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:33,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:33,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:33,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-04 18:03:33,661 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-04 18:03:33,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:33,661 INFO L85 PathProgramCache]: Analyzing trace with hash 580720686, now seen corresponding path program 2 times [2024-06-04 18:03:33,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:33,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188140357] [2024-06-04 18:03:33,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:33,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:03:46,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:46,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188140357] [2024-06-04 18:03:46,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188140357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:46,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:46,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:03:46,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568493839] [2024-06-04 18:03:46,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:46,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:03:46,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:46,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:03:46,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:03:47,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:03:47,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 83 transitions, 513 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:47,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:47,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:03:47,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:47,328 INFO L124 PetriNetUnfolderBase]: 189/431 cut-off events. [2024-06-04 18:03:47,328 INFO L125 PetriNetUnfolderBase]: For 16884/16884 co-relation queries the response was YES. [2024-06-04 18:03:47,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1802 conditions, 431 events. 189/431 cut-off events. For 16884/16884 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2012 event pairs, 44 based on Foata normal form. 6/436 useless extension candidates. Maximal degree in co-relation 1738. Up to 318 conditions per place. [2024-06-04 18:03:47,331 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 69 selfloop transitions, 11 changer transitions 13/97 dead transitions. [2024-06-04 18:03:47,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 97 transitions, 737 flow [2024-06-04 18:03:47,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:03:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:03:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 18:03:47,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-04 18:03:47,332 INFO L175 Difference]: Start difference. First operand has 135 places, 83 transitions, 513 flow. Second operand 11 states and 134 transitions. [2024-06-04 18:03:47,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 97 transitions, 737 flow [2024-06-04 18:03:47,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 97 transitions, 701 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 18:03:47,353 INFO L231 Difference]: Finished difference. Result has 137 places, 78 transitions, 473 flow [2024-06-04 18:03:47,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=473, PETRI_PLACES=137, PETRI_TRANSITIONS=78} [2024-06-04 18:03:47,353 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 106 predicate places. [2024-06-04 18:03:47,353 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 78 transitions, 473 flow [2024-06-04 18:03:47,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:47,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:47,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:47,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-04 18:03:47,354 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-04 18:03:47,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:47,354 INFO L85 PathProgramCache]: Analyzing trace with hash 381274746, now seen corresponding path program 3 times [2024-06-04 18:03:47,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:47,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93582758] [2024-06-04 18:03:47,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:47,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:03:57,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:57,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93582758] [2024-06-04 18:03:57,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93582758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:57,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:57,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:03:57,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950276907] [2024-06-04 18:03:57,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:57,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:03:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:57,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:03:57,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:03:57,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:03:57,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 78 transitions, 473 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:57,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:57,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:03:57,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:58,285 INFO L124 PetriNetUnfolderBase]: 179/411 cut-off events. [2024-06-04 18:03:58,286 INFO L125 PetriNetUnfolderBase]: For 17090/17090 co-relation queries the response was YES. [2024-06-04 18:03:58,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 411 events. 179/411 cut-off events. For 17090/17090 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1894 event pairs, 40 based on Foata normal form. 6/416 useless extension candidates. Maximal degree in co-relation 1652. Up to 300 conditions per place. [2024-06-04 18:03:58,288 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 64 selfloop transitions, 8 changer transitions 17/93 dead transitions. [2024-06-04 18:03:58,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 93 transitions, 691 flow [2024-06-04 18:03:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:03:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:03:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-04 18:03:58,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-04 18:03:58,289 INFO L175 Difference]: Start difference. First operand has 137 places, 78 transitions, 473 flow. Second operand 11 states and 133 transitions. [2024-06-04 18:03:58,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 93 transitions, 691 flow [2024-06-04 18:03:58,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 93 transitions, 657 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-04 18:03:58,307 INFO L231 Difference]: Finished difference. Result has 130 places, 71 transitions, 416 flow [2024-06-04 18:03:58,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=416, PETRI_PLACES=130, PETRI_TRANSITIONS=71} [2024-06-04 18:03:58,308 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 99 predicate places. [2024-06-04 18:03:58,308 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 71 transitions, 416 flow [2024-06-04 18:03:58,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:58,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:58,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:58,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-04 18:03:58,308 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-04 18:03:58,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:58,309 INFO L85 PathProgramCache]: Analyzing trace with hash 952562832, now seen corresponding path program 4 times [2024-06-04 18:03:58,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:58,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027195155] [2024-06-04 18:03:58,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:58,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:04:06,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:06,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027195155] [2024-06-04 18:04:06,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027195155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:06,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:06,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:04:06,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641329839] [2024-06-04 18:04:06,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:06,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:04:06,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:06,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:04:06,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:04:06,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:04:06,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 71 transitions, 416 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:06,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:06,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:04:06,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:07,276 INFO L124 PetriNetUnfolderBase]: 164/378 cut-off events. [2024-06-04 18:04:07,276 INFO L125 PetriNetUnfolderBase]: For 14940/14940 co-relation queries the response was YES. [2024-06-04 18:04:07,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 378 events. 164/378 cut-off events. For 14940/14940 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1691 event pairs, 43 based on Foata normal form. 6/381 useless extension candidates. Maximal degree in co-relation 1511. Up to 233 conditions per place. [2024-06-04 18:04:07,278 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 46 selfloop transitions, 22 changer transitions 11/83 dead transitions. [2024-06-04 18:04:07,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 83 transitions, 604 flow [2024-06-04 18:04:07,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:04:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:04:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-04 18:04:07,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-04 18:04:07,279 INFO L175 Difference]: Start difference. First operand has 130 places, 71 transitions, 416 flow. Second operand 11 states and 133 transitions. [2024-06-04 18:04:07,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 83 transitions, 604 flow [2024-06-04 18:04:07,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 83 transitions, 578 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-04 18:04:07,293 INFO L231 Difference]: Finished difference. Result has 121 places, 67 transitions, 417 flow [2024-06-04 18:04:07,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=417, PETRI_PLACES=121, PETRI_TRANSITIONS=67} [2024-06-04 18:04:07,293 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 90 predicate places. [2024-06-04 18:04:07,294 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 67 transitions, 417 flow [2024-06-04 18:04:07,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:07,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:07,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:07,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-04 18:04:07,294 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-04 18:04:07,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:07,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2071717894, now seen corresponding path program 5 times [2024-06-04 18:04:07,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:07,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350499896] [2024-06-04 18:04:07,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:07,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:04:14,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:14,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350499896] [2024-06-04 18:04:14,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350499896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:14,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:14,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:04:14,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809177271] [2024-06-04 18:04:14,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:14,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:04:14,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:14,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:04:14,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:04:15,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:04:15,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 67 transitions, 417 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:15,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:15,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:04:15,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:15,605 INFO L124 PetriNetUnfolderBase]: 156/360 cut-off events. [2024-06-04 18:04:15,605 INFO L125 PetriNetUnfolderBase]: For 12199/12199 co-relation queries the response was YES. [2024-06-04 18:04:15,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 360 events. 156/360 cut-off events. For 12199/12199 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1579 event pairs, 43 based on Foata normal form. 6/363 useless extension candidates. Maximal degree in co-relation 1440. Up to 223 conditions per place. [2024-06-04 18:04:15,607 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 43 selfloop transitions, 22 changer transitions 10/79 dead transitions. [2024-06-04 18:04:15,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 79 transitions, 597 flow [2024-06-04 18:04:15,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:04:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:04:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 18:04:15,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-04 18:04:15,608 INFO L175 Difference]: Start difference. First operand has 121 places, 67 transitions, 417 flow. Second operand 11 states and 131 transitions. [2024-06-04 18:04:15,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 79 transitions, 597 flow [2024-06-04 18:04:15,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 79 transitions, 545 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 18:04:15,622 INFO L231 Difference]: Finished difference. Result has 115 places, 64 transitions, 398 flow [2024-06-04 18:04:15,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=398, PETRI_PLACES=115, PETRI_TRANSITIONS=64} [2024-06-04 18:04:15,622 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-04 18:04:15,622 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 64 transitions, 398 flow [2024-06-04 18:04:15,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:15,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:15,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:15,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-04 18:04:15,623 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-04 18:04:15,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:15,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1086382220, now seen corresponding path program 6 times [2024-06-04 18:04:15,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:15,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163955772] [2024-06-04 18:04:15,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:15,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:04:23,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:23,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163955772] [2024-06-04 18:04:23,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163955772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:23,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:23,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:04:23,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485594013] [2024-06-04 18:04:23,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:23,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:04:23,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:23,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:04:23,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:04:23,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:04:23,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 64 transitions, 398 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:23,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:23,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:04:23,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:24,204 INFO L124 PetriNetUnfolderBase]: 149/347 cut-off events. [2024-06-04 18:04:24,205 INFO L125 PetriNetUnfolderBase]: For 10363/10363 co-relation queries the response was YES. [2024-06-04 18:04:24,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 347 events. 149/347 cut-off events. For 10363/10363 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1508 event pairs, 39 based on Foata normal form. 6/350 useless extension candidates. Maximal degree in co-relation 1368. Up to 199 conditions per place. [2024-06-04 18:04:24,207 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 42 selfloop transitions, 20 changer transitions 11/77 dead transitions. [2024-06-04 18:04:24,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 77 transitions, 576 flow [2024-06-04 18:04:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:04:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:04:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-04 18:04:24,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 18:04:24,208 INFO L175 Difference]: Start difference. First operand has 115 places, 64 transitions, 398 flow. Second operand 11 states and 132 transitions. [2024-06-04 18:04:24,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 77 transitions, 576 flow [2024-06-04 18:04:24,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 77 transitions, 526 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 18:04:24,219 INFO L231 Difference]: Finished difference. Result has 111 places, 59 transitions, 365 flow [2024-06-04 18:04:24,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=365, PETRI_PLACES=111, PETRI_TRANSITIONS=59} [2024-06-04 18:04:24,219 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 80 predicate places. [2024-06-04 18:04:24,219 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 59 transitions, 365 flow [2024-06-04 18:04:24,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:24,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:24,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:24,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-04 18:04:24,220 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-04 18:04:24,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1325284898, now seen corresponding path program 7 times [2024-06-04 18:04:24,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672555995] [2024-06-04 18:04:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:24,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:04:32,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:32,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672555995] [2024-06-04 18:04:32,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672555995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:32,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:32,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:04:32,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665038684] [2024-06-04 18:04:32,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:32,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:04:32,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:32,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:04:32,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:04:32,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:04:32,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 59 transitions, 365 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:32,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:32,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:04:32,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:33,110 INFO L124 PetriNetUnfolderBase]: 122/288 cut-off events. [2024-06-04 18:04:33,110 INFO L125 PetriNetUnfolderBase]: For 6196/6196 co-relation queries the response was YES. [2024-06-04 18:04:33,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 288 events. 122/288 cut-off events. For 6196/6196 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1169 event pairs, 27 based on Foata normal form. 6/293 useless extension candidates. Maximal degree in co-relation 996. Up to 212 conditions per place. [2024-06-04 18:04:33,112 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 48 selfloop transitions, 5 changer transitions 16/73 dead transitions. [2024-06-04 18:04:33,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 73 transitions, 539 flow [2024-06-04 18:04:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:04:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:04:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 18:04:33,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-04 18:04:33,113 INFO L175 Difference]: Start difference. First operand has 111 places, 59 transitions, 365 flow. Second operand 11 states and 131 transitions. [2024-06-04 18:04:33,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 73 transitions, 539 flow [2024-06-04 18:04:33,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 73 transitions, 489 flow, removed 5 selfloop flow, removed 13 redundant places. [2024-06-04 18:04:33,118 INFO L231 Difference]: Finished difference. Result has 103 places, 53 transitions, 299 flow [2024-06-04 18:04:33,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=299, PETRI_PLACES=103, PETRI_TRANSITIONS=53} [2024-06-04 18:04:33,118 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-04 18:04:33,119 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 53 transitions, 299 flow [2024-06-04 18:04:33,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:33,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:33,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:33,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-04 18:04:33,119 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-04 18:04:33,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:33,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1990391262, now seen corresponding path program 8 times [2024-06-04 18:04:33,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:33,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300895212] [2024-06-04 18:04:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:33,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:04:41,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300895212] [2024-06-04 18:04:41,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300895212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:41,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:41,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:04:41,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676788794] [2024-06-04 18:04:41,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:41,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:04:41,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:41,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:04:41,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:04:42,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 18:04:42,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 53 transitions, 299 flow. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:42,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:42,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 18:04:42,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:42,299 INFO L124 PetriNetUnfolderBase]: 112/260 cut-off events. [2024-06-04 18:04:42,300 INFO L125 PetriNetUnfolderBase]: For 4710/4710 co-relation queries the response was YES. [2024-06-04 18:04:42,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 260 events. 112/260 cut-off events. For 4710/4710 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1002 event pairs, 28 based on Foata normal form. 6/263 useless extension candidates. Maximal degree in co-relation 873. Up to 152 conditions per place. [2024-06-04 18:04:42,301 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 33 selfloop transitions, 17 changer transitions 11/65 dead transitions. [2024-06-04 18:04:42,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 65 transitions, 451 flow [2024-06-04 18:04:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:04:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:04:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-04 18:04:42,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2024-06-04 18:04:42,302 INFO L175 Difference]: Start difference. First operand has 103 places, 53 transitions, 299 flow. Second operand 11 states and 120 transitions. [2024-06-04 18:04:42,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 65 transitions, 451 flow [2024-06-04 18:04:42,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 65 transitions, 423 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-04 18:04:42,306 INFO L231 Difference]: Finished difference. Result has 93 places, 49 transitions, 290 flow [2024-06-04 18:04:42,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=290, PETRI_PLACES=93, PETRI_TRANSITIONS=49} [2024-06-04 18:04:42,307 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 62 predicate places. [2024-06-04 18:04:42,307 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 49 transitions, 290 flow [2024-06-04 18:04:42,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:42,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:42,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:42,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-04 18:04:42,307 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-04 18:04:42,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:42,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1698758748, now seen corresponding path program 9 times [2024-06-04 18:04:42,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:42,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068323286] [2024-06-04 18:04:42,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:42,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:04:50,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:50,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068323286] [2024-06-04 18:04:50,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068323286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:50,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:50,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:04:50,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865386171] [2024-06-04 18:04:50,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:50,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:04:50,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:50,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:04:50,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:04:50,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:04:50,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 49 transitions, 290 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:50,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:50,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:04:50,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:51,148 INFO L124 PetriNetUnfolderBase]: 104/242 cut-off events. [2024-06-04 18:04:51,149 INFO L125 PetriNetUnfolderBase]: For 3571/3571 co-relation queries the response was YES. [2024-06-04 18:04:51,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 242 events. 104/242 cut-off events. For 3571/3571 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 892 event pairs, 28 based on Foata normal form. 6/245 useless extension candidates. Maximal degree in co-relation 800. Up to 142 conditions per place. [2024-06-04 18:04:51,150 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 32 selfloop transitions, 15 changer transitions 10/61 dead transitions. [2024-06-04 18:04:51,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 61 transitions, 430 flow [2024-06-04 18:04:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:04:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:04:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 18:04:51,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-04 18:04:51,151 INFO L175 Difference]: Start difference. First operand has 93 places, 49 transitions, 290 flow. Second operand 11 states and 131 transitions. [2024-06-04 18:04:51,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 61 transitions, 430 flow [2024-06-04 18:04:51,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 61 transitions, 385 flow, removed 3 selfloop flow, removed 12 redundant places. [2024-06-04 18:04:51,155 INFO L231 Difference]: Finished difference. Result has 87 places, 46 transitions, 264 flow [2024-06-04 18:04:51,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=264, PETRI_PLACES=87, PETRI_TRANSITIONS=46} [2024-06-04 18:04:51,155 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-04 18:04:51,155 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 46 transitions, 264 flow [2024-06-04 18:04:51,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:51,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:51,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:51,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-04 18:04:51,156 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-04 18:04:51,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash 412950812, now seen corresponding path program 10 times [2024-06-04 18:04:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:51,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903364891] [2024-06-04 18:04:51,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:51,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:05:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:05:00,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:05:00,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903364891] [2024-06-04 18:05:00,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903364891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:05:00,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:05:00,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:05:00,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754349203] [2024-06-04 18:05:00,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:05:00,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:05:00,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:05:00,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:05:00,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:05:00,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:05:00,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 46 transitions, 264 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:05:00,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:05:00,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:05:00,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:05:00,852 INFO L124 PetriNetUnfolderBase]: 97/229 cut-off events. [2024-06-04 18:05:00,853 INFO L125 PetriNetUnfolderBase]: For 3019/3019 co-relation queries the response was YES. [2024-06-04 18:05:00,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 229 events. 97/229 cut-off events. For 3019/3019 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 815 event pairs, 26 based on Foata normal form. 6/232 useless extension candidates. Maximal degree in co-relation 742. Up to 124 conditions per place. [2024-06-04 18:05:00,854 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 29 selfloop transitions, 12 changer transitions 14/59 dead transitions. [2024-06-04 18:05:00,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 59 transitions, 402 flow [2024-06-04 18:05:00,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:05:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:05:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 18:05:00,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-04 18:05:00,855 INFO L175 Difference]: Start difference. First operand has 87 places, 46 transitions, 264 flow. Second operand 11 states and 131 transitions. [2024-06-04 18:05:00,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 59 transitions, 402 flow [2024-06-04 18:05:00,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 59 transitions, 366 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 18:05:00,858 INFO L231 Difference]: Finished difference. Result has 83 places, 41 transitions, 231 flow [2024-06-04 18:05:00,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=231, PETRI_PLACES=83, PETRI_TRANSITIONS=41} [2024-06-04 18:05:00,859 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 52 predicate places. [2024-06-04 18:05:00,859 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 41 transitions, 231 flow [2024-06-04 18:05:00,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:05:00,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:05:00,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:05:00,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-04 18:05:00,860 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-04 18:05:00,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:05:00,860 INFO L85 PathProgramCache]: Analyzing trace with hash -439822542, now seen corresponding path program 11 times [2024-06-04 18:05:00,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:05:00,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983923951] [2024-06-04 18:05:00,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:05:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:05:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:05:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:05:07,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:05:07,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983923951] [2024-06-04 18:05:07,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983923951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:05:07,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:05:07,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:05:07,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752711845] [2024-06-04 18:05:07,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:05:07,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:05:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:05:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:05:07,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:05:07,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:05:07,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 41 transitions, 231 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:05:07,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:05:07,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:05:07,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:05:07,837 INFO L124 PetriNetUnfolderBase]: 85/203 cut-off events. [2024-06-04 18:05:07,838 INFO L125 PetriNetUnfolderBase]: For 2503/2503 co-relation queries the response was YES. [2024-06-04 18:05:07,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 203 events. 85/203 cut-off events. For 2503/2503 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 680 event pairs, 26 based on Foata normal form. 6/206 useless extension candidates. Maximal degree in co-relation 656. Up to 114 conditions per place. [2024-06-04 18:05:07,839 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 27 selfloop transitions, 12 changer transitions 10/53 dead transitions. [2024-06-04 18:05:07,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 53 transitions, 355 flow [2024-06-04 18:05:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:05:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:05:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-04 18:05:07,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 18:05:07,842 INFO L175 Difference]: Start difference. First operand has 83 places, 41 transitions, 231 flow. Second operand 11 states and 128 transitions. [2024-06-04 18:05:07,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 53 transitions, 355 flow [2024-06-04 18:05:07,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 53 transitions, 320 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 18:05:07,845 INFO L231 Difference]: Finished difference. Result has 76 places, 38 transitions, 209 flow [2024-06-04 18:05:07,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=209, PETRI_PLACES=76, PETRI_TRANSITIONS=38} [2024-06-04 18:05:07,845 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2024-06-04 18:05:07,845 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 38 transitions, 209 flow [2024-06-04 18:05:07,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:05:07,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:05:07,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:05:07,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-04 18:05:07,846 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-04 18:05:07,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:05:07,846 INFO L85 PathProgramCache]: Analyzing trace with hash 834972334, now seen corresponding path program 12 times [2024-06-04 18:05:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:05:07,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036689785] [2024-06-04 18:05:07,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:05:07,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:05:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:05:15,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:05:15,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:05:15,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036689785] [2024-06-04 18:05:15,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036689785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:05:15,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:05:15,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:05:15,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150255575] [2024-06-04 18:05:15,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:05:15,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:05:15,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:05:15,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:05:15,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:05:15,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:05:15,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 38 transitions, 209 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:05:15,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:05:15,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:05:15,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:05:15,362 INFO L124 PetriNetUnfolderBase]: 78/190 cut-off events. [2024-06-04 18:05:15,363 INFO L125 PetriNetUnfolderBase]: For 1839/1839 co-relation queries the response was YES. [2024-06-04 18:05:15,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 190 events. 78/190 cut-off events. For 1839/1839 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 622 event pairs, 24 based on Foata normal form. 6/193 useless extension candidates. Maximal degree in co-relation 600. Up to 96 conditions per place. [2024-06-04 18:05:15,364 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 24 selfloop transitions, 10 changer transitions 13/51 dead transitions. [2024-06-04 18:05:15,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 51 transitions, 331 flow [2024-06-04 18:05:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:05:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:05:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-04 18:05:15,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 18:05:15,365 INFO L175 Difference]: Start difference. First operand has 76 places, 38 transitions, 209 flow. Second operand 11 states and 128 transitions. [2024-06-04 18:05:15,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 51 transitions, 331 flow [2024-06-04 18:05:15,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 51 transitions, 301 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 18:05:15,367 INFO L231 Difference]: Finished difference. Result has 72 places, 34 transitions, 184 flow [2024-06-04 18:05:15,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=184, PETRI_PLACES=72, PETRI_TRANSITIONS=34} [2024-06-04 18:05:15,367 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2024-06-04 18:05:15,368 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 34 transitions, 184 flow [2024-06-04 18:05:15,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:05:15,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:05:15,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:05:15,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-04 18:05:15,368 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-04 18:05:15,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:05:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash 692869264, now seen corresponding path program 13 times [2024-06-04 18:05:15,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:05:15,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444001672] [2024-06-04 18:05:15,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:05:15,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:05:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:05:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:05:22,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:05:22,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444001672] [2024-06-04 18:05:22,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444001672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:05:22,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:05:22,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:05:22,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621846296] [2024-06-04 18:05:22,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:05:22,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:05:22,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:05:22,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:05:22,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:05:22,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:05:22,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 34 transitions, 184 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:05:22,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:05:22,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:05:22,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:05:22,478 INFO L124 PetriNetUnfolderBase]: 60/156 cut-off events. [2024-06-04 18:05:22,479 INFO L125 PetriNetUnfolderBase]: For 1245/1245 co-relation queries the response was YES. [2024-06-04 18:05:22,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 156 events. 60/156 cut-off events. For 1245/1245 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 461 event pairs, 17 based on Foata normal form. 6/159 useless extension candidates. Maximal degree in co-relation 466. Up to 57 conditions per place. [2024-06-04 18:05:22,480 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 18 selfloop transitions, 6 changer transitions 19/47 dead transitions. [2024-06-04 18:05:22,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 47 transitions, 296 flow [2024-06-04 18:05:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:05:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:05:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-04 18:05:22,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 18:05:22,486 INFO L175 Difference]: Start difference. First operand has 72 places, 34 transitions, 184 flow. Second operand 11 states and 128 transitions. [2024-06-04 18:05:22,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 47 transitions, 296 flow [2024-06-04 18:05:22,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 47 transitions, 268 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 18:05:22,488 INFO L231 Difference]: Finished difference. Result has 66 places, 26 transitions, 134 flow [2024-06-04 18:05:22,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=134, PETRI_PLACES=66, PETRI_TRANSITIONS=26} [2024-06-04 18:05:22,488 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-04 18:05:22,488 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 26 transitions, 134 flow [2024-06-04 18:05:22,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:05:22,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:05:22,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:05:22,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-04 18:05:22,489 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-04 18:05:22,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:05:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1846289262, now seen corresponding path program 1 times [2024-06-04 18:05:22,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:05:22,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682485768] [2024-06-04 18:05:22,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:05:22,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:05:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:05:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:05:28,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:05:28,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682485768] [2024-06-04 18:05:28,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682485768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:05:28,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:05:28,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 18:05:28,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67685128] [2024-06-04 18:05:28,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:05:28,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 18:05:28,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:05:28,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 18:05:28,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 18:05:29,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 18:05:29,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 26 transitions, 134 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:05:29,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:05:29,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 18:05:29,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:05:29,181 INFO L124 PetriNetUnfolderBase]: 31/91 cut-off events. [2024-06-04 18:05:29,181 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2024-06-04 18:05:29,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 91 events. 31/91 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 190 event pairs, 0 based on Foata normal form. 4/95 useless extension candidates. Maximal degree in co-relation 242. Up to 19 conditions per place. [2024-06-04 18:05:29,181 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2024-06-04 18:05:29,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 37 transitions, 200 flow [2024-06-04 18:05:29,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:05:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:05:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-04 18:05:29,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2024-06-04 18:05:29,183 INFO L175 Difference]: Start difference. First operand has 66 places, 26 transitions, 134 flow. Second operand 11 states and 120 transitions. [2024-06-04 18:05:29,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 37 transitions, 200 flow [2024-06-04 18:05:29,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 37 transitions, 165 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-06-04 18:05:29,183 INFO L231 Difference]: Finished difference. Result has 50 places, 0 transitions, 0 flow [2024-06-04 18:05:29,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=50, PETRI_TRANSITIONS=0} [2024-06-04 18:05:29,184 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 19 predicate places. [2024-06-04 18:05:29,184 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 0 transitions, 0 flow [2024-06-04 18:05:29,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:05:29,197 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-04 18:05:29,197 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 18:05:29,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-04 18:05:29,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 18:05:29,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-04 18:05:29,198 INFO L445 BasicCegarLoop]: Path program histogram: [20, 14, 13, 10, 8, 7, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:05:29,203 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 18:05:29,203 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 18:05:29,212 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-04 18:05:29,212 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-04 18:05:29,213 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 06:05:29 BasicIcfg [2024-06-04 18:05:29,214 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 18:05:29,214 INFO L158 Benchmark]: Toolchain (without parser) took 788759.15ms. Allocated memory was 172.0MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 132.5MB in the beginning and 766.8MB in the end (delta: -634.3MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-06-04 18:05:29,214 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 18:05:29,214 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 172.0MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 18:05:29,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 756.36ms. Allocated memory is still 172.0MB. Free memory was 131.8MB in the beginning and 127.7MB in the end (delta: 4.1MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2024-06-04 18:05:29,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.72ms. Allocated memory is still 172.0MB. Free memory was 127.7MB in the beginning and 112.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-04 18:05:29,215 INFO L158 Benchmark]: Boogie Preprocessor took 115.32ms. Allocated memory is still 172.0MB. Free memory was 112.0MB in the beginning and 104.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-06-04 18:05:29,216 INFO L158 Benchmark]: RCFGBuilder took 1063.29ms. Allocated memory was 172.0MB in the beginning and 245.4MB in the end (delta: 73.4MB). Free memory was 104.6MB in the beginning and 109.6MB in the end (delta: -4.9MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2024-06-04 18:05:29,216 INFO L158 Benchmark]: TraceAbstraction took 786715.67ms. Allocated memory was 245.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 109.6MB in the beginning and 766.8MB in the end (delta: -657.2MB). Peak memory consumption was 919.8MB. Max. memory is 16.1GB. [2024-06-04 18:05:29,217 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 172.0MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 756.36ms. Allocated memory is still 172.0MB. Free memory was 131.8MB in the beginning and 127.7MB in the end (delta: 4.1MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.72ms. Allocated memory is still 172.0MB. Free memory was 127.7MB in the beginning and 112.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.32ms. Allocated memory is still 172.0MB. Free memory was 112.0MB in the beginning and 104.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1063.29ms. Allocated memory was 172.0MB in the beginning and 245.4MB in the end (delta: 73.4MB). Free memory was 104.6MB in the beginning and 109.6MB in the end (delta: -4.9MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. * TraceAbstraction took 786715.67ms. Allocated memory was 245.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 109.6MB in the beginning and 766.8MB in the end (delta: -657.2MB). Peak memory consumption was 919.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 826]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 827]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 786.5s, OverallIterations: 106, TraceHistogramMax: 1, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 50.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6036 SdHoareTripleChecker+Valid, 31.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5111 mSDsluCounter, 1990 SdHoareTripleChecker+Invalid, 28.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1696 mSDsCounter, 894 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39164 IncrementalHoareTripleChecker+Invalid, 40058 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 894 mSolverCounterUnsat, 294 mSDtfsCounter, 39164 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1094 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1087 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 30.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1385occurred in iteration=54, InterpolantAutomatonStates: 986, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 729.7s InterpolantComputationTime, 1849 NumberOfCodeBlocks, 1849 NumberOfCodeBlocksAsserted, 106 NumberOfCheckSat, 1743 ConstructedInterpolants, 0 QuantifiedInterpolants, 83048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 106 InterpolantComputations, 106 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-04 18:05:29,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE