./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe006_power.oepc-thin000_power.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/safe006_power.oepc-thin000_power.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe006_power.oepc-thin000_power.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 00:10:18,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 00:10:18,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 00:10:18,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 00:10:18,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 00:10:18,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 00:10:18,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 00:10:18,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 00:10:18,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 00:10:18,900 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 00:10:18,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 00:10:18,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 00:10:18,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 00:10:18,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 00:10:18,909 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 00:10:18,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 00:10:18,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 00:10:18,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 00:10:18,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 00:10:18,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 00:10:18,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 00:10:18,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 00:10:18,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 00:10:18,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 00:10:18,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 00:10:18,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 00:10:18,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 00:10:18,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 00:10:18,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 00:10:18,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 00:10:18,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 00:10:18,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 00:10:18,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:10:18,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 00:10:18,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 00:10:18,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 00:10:18,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 00:10:18,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 00:10:18,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 00:10:18,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 00:10:18,916 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 00:10:18,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 00:10:18,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 00:10:18,916 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-28 00:10:19,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 00:10:19,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 00:10:19,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 00:10:19,156 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 00:10:19,156 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 00:10:19,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe006_power.oepc-thin000_power.oepc.yml/witness.yml [2024-06-28 00:10:19,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 00:10:19,256 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 00:10:19,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-06-28 00:10:20,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 00:10:20,535 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 00:10:20,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-06-28 00:10:20,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86edae3fd/7ee629ad69dd4fc98c975ac405807789/FLAG0d27e0c19 [2024-06-28 00:10:20,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86edae3fd/7ee629ad69dd4fc98c975ac405807789 [2024-06-28 00:10:20,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 00:10:20,568 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 00:10:20,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 00:10:20,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 00:10:20,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 00:10:20,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:10:19" (1/2) ... [2024-06-28 00:10:20,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ba00d2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:10:20, skipping insertion in model container [2024-06-28 00:10:20,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:10:19" (1/2) ... [2024-06-28 00:10:20,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3d8a5bee and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 12:10:20, skipping insertion in model container [2024-06-28 00:10:20,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:10:20" (2/2) ... [2024-06-28 00:10:20,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ba00d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:20, skipping insertion in model container [2024-06-28 00:10:20,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 12:10:20" (2/2) ... [2024-06-28 00:10:20,578 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 00:10:20,595 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 00:10:20,596 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )x) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice1) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) [2024-06-28 00:10:20,597 INFO L97 edCorrectnessWitness]: Location invariant before [L817-L817] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )x) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice1) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) [2024-06-28 00:10:20,597 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 00:10:20,597 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-06-28 00:10:20,630 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 00:10:20,903 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:10:20,913 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 00:10:21,070 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 00:10:21,103 INFO L206 MainTranslator]: Completed translation [2024-06-28 00:10:21,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:21 WrapperNode [2024-06-28 00:10:21,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 00:10:21,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 00:10:21,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 00:10:21,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 00:10:21,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:21" (1/1) ... [2024-06-28 00:10:21,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:21" (1/1) ... [2024-06-28 00:10:21,178 INFO L138 Inliner]: procedures = 174, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2024-06-28 00:10:21,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 00:10:21,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 00:10:21,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 00:10:21,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 00:10:21,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:21" (1/1) ... [2024-06-28 00:10:21,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:21" (1/1) ... [2024-06-28 00:10:21,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:21" (1/1) ... [2024-06-28 00:10:21,224 INFO L175 MemorySlicer]: Split 21 memory accesses to 2 slices as follows [2, 19]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-28 00:10:21,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:21" (1/1) ... [2024-06-28 00:10:21,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:21" (1/1) ... [2024-06-28 00:10:21,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:21" (1/1) ... [2024-06-28 00:10:21,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:21" (1/1) ... [2024-06-28 00:10:21,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:21" (1/1) ... [2024-06-28 00:10:21,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:21" (1/1) ... [2024-06-28 00:10:21,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 00:10:21,276 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 00:10:21,276 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 00:10:21,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 00:10:21,277 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:21" (1/1) ... [2024-06-28 00:10:21,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 00:10:21,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 00:10:21,305 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-28 00:10:21,311 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-28 00:10:21,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 00:10:21,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 00:10:21,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 00:10:21,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 00:10:21,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 00:10:21,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 00:10:21,338 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 00:10:21,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 00:10:21,338 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 00:10:21,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 00:10:21,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 00:10:21,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 00:10:21,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 00:10:21,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 00:10:21,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 00:10:21,340 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 00:10:21,484 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 00:10:21,486 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 00:10:21,993 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 00:10:21,994 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 00:10:22,278 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 00:10:22,279 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 00:10:22,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:10:22 BoogieIcfgContainer [2024-06-28 00:10:22,279 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 00:10:22,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 00:10:22,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 00:10:22,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 00:10:22,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 12:10:19" (1/4) ... [2024-06-28 00:10:22,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3fdc46 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 12:10:22, skipping insertion in model container [2024-06-28 00:10:22,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 12:10:20" (2/4) ... [2024-06-28 00:10:22,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3fdc46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 12:10:22, skipping insertion in model container [2024-06-28 00:10:22,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 12:10:21" (3/4) ... [2024-06-28 00:10:22,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3fdc46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 12:10:22, skipping insertion in model container [2024-06-28 00:10:22,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 12:10:22" (4/4) ... [2024-06-28 00:10:22,289 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2024-06-28 00:10:22,304 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 00:10:22,304 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-28 00:10:22,304 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 00:10:22,359 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 00:10:22,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2024-06-28 00:10:22,449 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-28 00:10:22,449 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:10:22,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-28 00:10:22,451 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2024-06-28 00:10:22,454 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2024-06-28 00:10:22,466 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 00:10:22,474 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;@1872f287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 00:10:22,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-28 00:10:22,479 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 00:10:22,480 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 00:10:22,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 00:10:22,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:22,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 00:10:22,481 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-28 00:10:22,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:22,486 INFO L85 PathProgramCache]: Analyzing trace with hash 568513886, now seen corresponding path program 1 times [2024-06-28 00:10:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:22,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913612281] [2024-06-28 00:10:22,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:22,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913612281] [2024-06-28 00:10:24,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913612281] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:24,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:24,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 00:10:24,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726456387] [2024-06-28 00:10:24,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:24,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 00:10:24,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:24,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 00:10:24,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 00:10:24,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-28 00:10:24,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:24,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:24,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-28 00:10:24,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:25,096 INFO L124 PetriNetUnfolderBase]: 113/223 cut-off events. [2024-06-28 00:10:25,096 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-28 00:10:25,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 223 events. 113/223 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 777 event pairs, 61 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 440. Up to 206 conditions per place. [2024-06-28 00:10:25,100 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 21 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-28 00:10:25,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 115 flow [2024-06-28 00:10:25,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 00:10:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 00:10:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2024-06-28 00:10:25,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2024-06-28 00:10:25,109 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 47 transitions. [2024-06-28 00:10:25,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 115 flow [2024-06-28 00:10:25,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 00:10:25,113 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2024-06-28 00:10:25,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2024-06-28 00:10:25,117 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-06-28 00:10:25,117 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2024-06-28 00:10:25,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:25,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:25,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:25,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 00:10:25,118 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-28 00:10:25,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:25,118 INFO L85 PathProgramCache]: Analyzing trace with hash 881037181, now seen corresponding path program 1 times [2024-06-28 00:10:25,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:25,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174173124] [2024-06-28 00:10:25,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:25,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:27,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:27,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:27,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174173124] [2024-06-28 00:10:27,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174173124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:27,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:27,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 00:10:27,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960256924] [2024-06-28 00:10:27,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:27,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 00:10:27,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:27,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 00:10:27,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 00:10:27,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-28 00:10:27,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:27,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:27,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-28 00:10:27,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:28,319 INFO L124 PetriNetUnfolderBase]: 110/217 cut-off events. [2024-06-28 00:10:28,320 INFO L125 PetriNetUnfolderBase]: For 44/47 co-relation queries the response was YES. [2024-06-28 00:10:28,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 217 events. 110/217 cut-off events. For 44/47 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 754 event pairs, 46 based on Foata normal form. 4/219 useless extension candidates. Maximal degree in co-relation 494. Up to 190 conditions per place. [2024-06-28 00:10:28,322 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 26 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-28 00:10:28,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 161 flow [2024-06-28 00:10:28,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 00:10:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 00:10:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2024-06-28 00:10:28,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2024-06-28 00:10:28,324 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 4 states and 61 transitions. [2024-06-28 00:10:28,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 161 flow [2024-06-28 00:10:28,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 00:10:28,325 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 93 flow [2024-06-28 00:10:28,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2024-06-28 00:10:28,326 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2024-06-28 00:10:28,326 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 93 flow [2024-06-28 00:10:28,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:28,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:28,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:28,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 00:10:28,327 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-28 00:10:28,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:28,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1542350125, now seen corresponding path program 1 times [2024-06-28 00:10:28,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:28,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464001472] [2024-06-28 00:10:28,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:28,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:31,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464001472] [2024-06-28 00:10:31,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464001472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:31,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:31,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 00:10:31,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713762669] [2024-06-28 00:10:31,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:31,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 00:10:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:31,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 00:10:31,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 00:10:31,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-28 00:10:31,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-28 00:10:31,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:31,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-28 00:10:31,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:32,306 INFO L124 PetriNetUnfolderBase]: 125/242 cut-off events. [2024-06-28 00:10:32,307 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2024-06-28 00:10:32,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 242 events. 125/242 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 839 event pairs, 37 based on Foata normal form. 2/243 useless extension candidates. Maximal degree in co-relation 618. Up to 205 conditions per place. [2024-06-28 00:10:32,309 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 36 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2024-06-28 00:10:32,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 235 flow [2024-06-28 00:10:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:10:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:10:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2024-06-28 00:10:32,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-06-28 00:10:32,310 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 93 flow. Second operand 5 states and 71 transitions. [2024-06-28 00:10:32,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 235 flow [2024-06-28 00:10:32,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 224 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-28 00:10:32,312 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 137 flow [2024-06-28 00:10:32,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2024-06-28 00:10:32,313 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-06-28 00:10:32,313 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 137 flow [2024-06-28 00:10:32,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-28 00:10:32,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:32,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:32,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 00:10:32,314 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 00:10:32,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:32,315 INFO L85 PathProgramCache]: Analyzing trace with hash 434200662, now seen corresponding path program 1 times [2024-06-28 00:10:32,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:32,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338146214] [2024-06-28 00:10:32,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:32,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:36,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:36,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338146214] [2024-06-28 00:10:36,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338146214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:36,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:36,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:10:36,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833404152] [2024-06-28 00:10:36,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:36,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:10:36,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:36,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:10:36,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:10:36,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-28 00:10:36,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 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-28 00:10:36,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:36,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-28 00:10:36,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:36,562 INFO L124 PetriNetUnfolderBase]: 121/234 cut-off events. [2024-06-28 00:10:36,562 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2024-06-28 00:10:36,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 234 events. 121/234 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 799 event pairs, 18 based on Foata normal form. 4/237 useless extension candidates. Maximal degree in co-relation 674. Up to 175 conditions per place. [2024-06-28 00:10:36,565 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 36 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-28 00:10:36,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 257 flow [2024-06-28 00:10:36,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:10:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:10:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-06-28 00:10:36,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-28 00:10:36,566 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 137 flow. Second operand 6 states and 78 transitions. [2024-06-28 00:10:36,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 257 flow [2024-06-28 00:10:36,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 257 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 00:10:36,568 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 149 flow [2024-06-28 00:10:36,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=37, 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=149, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2024-06-28 00:10:36,569 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2024-06-28 00:10:36,569 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 149 flow [2024-06-28 00:10:36,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 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-28 00:10:36,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:36,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:36,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 00:10:36,570 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-28 00:10:36,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:36,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1282769634, now seen corresponding path program 1 times [2024-06-28 00:10:36,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:36,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72705878] [2024-06-28 00:10:36,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:36,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:39,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:39,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72705878] [2024-06-28 00:10:39,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72705878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:39,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:39,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 00:10:39,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375554881] [2024-06-28 00:10:39,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:39,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 00:10:39,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:39,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 00:10:39,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 00:10:39,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:10:39,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:39,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:39,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:10:39,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:39,678 INFO L124 PetriNetUnfolderBase]: 119/231 cut-off events. [2024-06-28 00:10:39,679 INFO L125 PetriNetUnfolderBase]: For 371/371 co-relation queries the response was YES. [2024-06-28 00:10:39,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 231 events. 119/231 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 789 event pairs, 32 based on Foata normal form. 1/231 useless extension candidates. Maximal degree in co-relation 718. Up to 206 conditions per place. [2024-06-28 00:10:39,680 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 29 selfloop transitions, 11 changer transitions 0/43 dead transitions. [2024-06-28 00:10:39,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 277 flow [2024-06-28 00:10:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:10:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:10:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2024-06-28 00:10:39,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2024-06-28 00:10:39,682 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 149 flow. Second operand 5 states and 58 transitions. [2024-06-28 00:10:39,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 277 flow [2024-06-28 00:10:39,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 254 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-28 00:10:39,684 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 199 flow [2024-06-28 00:10:39,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=128, 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=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2024-06-28 00:10:39,685 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2024-06-28 00:10:39,685 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 199 flow [2024-06-28 00:10:39,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:39,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:39,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:39,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 00:10:39,686 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-28 00:10:39,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:39,687 INFO L85 PathProgramCache]: Analyzing trace with hash -566870363, now seen corresponding path program 1 times [2024-06-28 00:10:39,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:39,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257890436] [2024-06-28 00:10:39,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:39,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:43,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:43,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257890436] [2024-06-28 00:10:43,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257890436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:43,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:43,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:10:43,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868090524] [2024-06-28 00:10:43,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:43,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:10:43,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:43,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:10:43,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:10:43,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:10:43,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 199 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:43,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:43,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:10:43,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:43,842 INFO L124 PetriNetUnfolderBase]: 117/228 cut-off events. [2024-06-28 00:10:43,842 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2024-06-28 00:10:43,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 228 events. 117/228 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 767 event pairs, 32 based on Foata normal form. 1/228 useless extension candidates. Maximal degree in co-relation 762. Up to 204 conditions per place. [2024-06-28 00:10:43,844 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 29 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2024-06-28 00:10:43,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 289 flow [2024-06-28 00:10:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 00:10:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 00:10:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2024-06-28 00:10:43,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38 [2024-06-28 00:10:43,845 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 199 flow. Second operand 5 states and 57 transitions. [2024-06-28 00:10:43,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 289 flow [2024-06-28 00:10:43,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 289 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 00:10:43,848 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 227 flow [2024-06-28 00:10:43,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-06-28 00:10:43,848 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2024-06-28 00:10:43,849 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 227 flow [2024-06-28 00:10:43,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:43,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:43,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:43,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 00:10:43,849 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-28 00:10:43,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:43,850 INFO L85 PathProgramCache]: Analyzing trace with hash -593730395, now seen corresponding path program 1 times [2024-06-28 00:10:43,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:43,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942311475] [2024-06-28 00:10:43,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:43,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:48,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:48,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942311475] [2024-06-28 00:10:48,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942311475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:48,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:48,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:10:48,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805392682] [2024-06-28 00:10:48,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:48,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:10:48,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:48,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:10:48,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:10:48,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:10:48,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 227 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:48,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:48,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:10:48,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:49,506 INFO L124 PetriNetUnfolderBase]: 120/235 cut-off events. [2024-06-28 00:10:49,506 INFO L125 PetriNetUnfolderBase]: For 600/600 co-relation queries the response was YES. [2024-06-28 00:10:49,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 235 events. 120/235 cut-off events. For 600/600 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 806 event pairs, 30 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 824. Up to 181 conditions per place. [2024-06-28 00:10:49,508 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 41 selfloop transitions, 16 changer transitions 0/60 dead transitions. [2024-06-28 00:10:49,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 421 flow [2024-06-28 00:10:49,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:10:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:10:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-28 00:10:49,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.362962962962963 [2024-06-28 00:10:49,511 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 227 flow. Second operand 9 states and 98 transitions. [2024-06-28 00:10:49,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 421 flow [2024-06-28 00:10:49,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 406 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 00:10:49,513 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 273 flow [2024-06-28 00:10:49,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=273, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2024-06-28 00:10:49,514 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 27 predicate places. [2024-06-28 00:10:49,514 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 273 flow [2024-06-28 00:10:49,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:49,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:49,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:49,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 00:10:49,515 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-28 00:10:49,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1105246783, now seen corresponding path program 2 times [2024-06-28 00:10:49,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:49,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9169132] [2024-06-28 00:10:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:49,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:53,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9169132] [2024-06-28 00:10:53,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9169132] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:53,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:53,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:10:53,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432487571] [2024-06-28 00:10:53,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:53,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:10:53,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:53,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:10:53,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:10:53,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:10:53,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:53,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:53,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:10:53,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:54,359 INFO L124 PetriNetUnfolderBase]: 136/269 cut-off events. [2024-06-28 00:10:54,360 INFO L125 PetriNetUnfolderBase]: For 884/886 co-relation queries the response was YES. [2024-06-28 00:10:54,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 269 events. 136/269 cut-off events. For 884/886 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 990 event pairs, 33 based on Foata normal form. 3/271 useless extension candidates. Maximal degree in co-relation 1017. Up to 211 conditions per place. [2024-06-28 00:10:54,361 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 40 selfloop transitions, 18 changer transitions 0/61 dead transitions. [2024-06-28 00:10:54,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 488 flow [2024-06-28 00:10:54,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 00:10:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 00:10:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2024-06-28 00:10:54,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-28 00:10:54,363 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 273 flow. Second operand 6 states and 72 transitions. [2024-06-28 00:10:54,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 488 flow [2024-06-28 00:10:54,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 437 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-28 00:10:54,366 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 349 flow [2024-06-28 00:10:54,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-06-28 00:10:54,366 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2024-06-28 00:10:54,367 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 349 flow [2024-06-28 00:10:54,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:54,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:54,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:54,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 00:10:54,367 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-28 00:10:54,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:54,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1105246969, now seen corresponding path program 1 times [2024-06-28 00:10:54,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:54,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211302822] [2024-06-28 00:10:54,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:54,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:10:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:10:58,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:10:58,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211302822] [2024-06-28 00:10:58,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211302822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:10:58,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:10:58,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:10:58,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570160958] [2024-06-28 00:10:58,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:10:58,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:10:58,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:10:58,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:10:58,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:10:58,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:10:58,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 349 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:58,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:10:58,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:10:58,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:10:59,136 INFO L124 PetriNetUnfolderBase]: 144/282 cut-off events. [2024-06-28 00:10:59,137 INFO L125 PetriNetUnfolderBase]: For 1042/1044 co-relation queries the response was YES. [2024-06-28 00:10:59,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 282 events. 144/282 cut-off events. For 1042/1044 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1029 event pairs, 32 based on Foata normal form. 3/284 useless extension candidates. Maximal degree in co-relation 1093. Up to 227 conditions per place. [2024-06-28 00:10:59,138 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 44 selfloop transitions, 18 changer transitions 0/65 dead transitions. [2024-06-28 00:10:59,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 533 flow [2024-06-28 00:10:59,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:10:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:10:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-28 00:10:59,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2024-06-28 00:10:59,140 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 349 flow. Second operand 7 states and 78 transitions. [2024-06-28 00:10:59,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 533 flow [2024-06-28 00:10:59,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 65 transitions, 516 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-28 00:10:59,143 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 398 flow [2024-06-28 00:10:59,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=398, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-06-28 00:10:59,144 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-28 00:10:59,144 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 398 flow [2024-06-28 00:10:59,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:10:59,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:10:59,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:10:59,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 00:10:59,145 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-28 00:10:59,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:10:59,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1654176679, now seen corresponding path program 2 times [2024-06-28 00:10:59,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:10:59,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835358115] [2024-06-28 00:10:59,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:10:59,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:10:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:02,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:02,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835358115] [2024-06-28 00:11:02,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835358115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:02,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:02,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:11:02,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711967533] [2024-06-28 00:11:02,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:02,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:11:02,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:02,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:11:02,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:11:02,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:11:02,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 398 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:02,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:02,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:11:02,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:03,483 INFO L124 PetriNetUnfolderBase]: 150/290 cut-off events. [2024-06-28 00:11:03,483 INFO L125 PetriNetUnfolderBase]: For 1348/1348 co-relation queries the response was YES. [2024-06-28 00:11:03,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 290 events. 150/290 cut-off events. For 1348/1348 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1074 event pairs, 30 based on Foata normal form. 2/291 useless extension candidates. Maximal degree in co-relation 1202. Up to 214 conditions per place. [2024-06-28 00:11:03,485 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 47 selfloop transitions, 22 changer transitions 0/72 dead transitions. [2024-06-28 00:11:03,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 72 transitions, 618 flow [2024-06-28 00:11:03,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:11:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:11:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-28 00:11:03,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-28 00:11:03,487 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 398 flow. Second operand 7 states and 83 transitions. [2024-06-28 00:11:03,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 72 transitions, 618 flow [2024-06-28 00:11:03,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 72 transitions, 593 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-28 00:11:03,490 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 451 flow [2024-06-28 00:11:03,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=451, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2024-06-28 00:11:03,491 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2024-06-28 00:11:03,491 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 451 flow [2024-06-28 00:11:03,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:03,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:03,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:03,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 00:11:03,491 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-28 00:11:03,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:03,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1663772163, now seen corresponding path program 3 times [2024-06-28 00:11:03,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:03,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833059414] [2024-06-28 00:11:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:03,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:06,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:06,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833059414] [2024-06-28 00:11:06,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833059414] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:06,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:06,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:11:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688575107] [2024-06-28 00:11:06,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:06,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:11:06,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:06,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:11:06,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:11:06,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:11:06,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 451 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:06,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:06,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:11:06,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:07,009 INFO L124 PetriNetUnfolderBase]: 148/290 cut-off events. [2024-06-28 00:11:07,010 INFO L125 PetriNetUnfolderBase]: For 1627/1633 co-relation queries the response was YES. [2024-06-28 00:11:07,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1306 conditions, 290 events. 148/290 cut-off events. For 1627/1633 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1078 event pairs, 35 based on Foata normal form. 7/296 useless extension candidates. Maximal degree in co-relation 1269. Up to 221 conditions per place. [2024-06-28 00:11:07,012 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 40 selfloop transitions, 24 changer transitions 0/67 dead transitions. [2024-06-28 00:11:07,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 629 flow [2024-06-28 00:11:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:11:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:11:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2024-06-28 00:11:07,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2024-06-28 00:11:07,014 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 451 flow. Second operand 7 states and 74 transitions. [2024-06-28 00:11:07,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 629 flow [2024-06-28 00:11:07,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 581 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-28 00:11:07,018 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 478 flow [2024-06-28 00:11:07,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=478, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2024-06-28 00:11:07,019 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 42 predicate places. [2024-06-28 00:11:07,019 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 478 flow [2024-06-28 00:11:07,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:07,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:07,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:07,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 00:11:07,020 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-28 00:11:07,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash -315871, now seen corresponding path program 3 times [2024-06-28 00:11:07,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:07,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630905541] [2024-06-28 00:11:07,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:07,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:09,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:09,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630905541] [2024-06-28 00:11:09,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630905541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:09,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:09,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 00:11:09,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626463499] [2024-06-28 00:11:09,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:09,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 00:11:09,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:09,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 00:11:09,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 00:11:09,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:11:09,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 478 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:09,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:09,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:11:09,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:10,223 INFO L124 PetriNetUnfolderBase]: 153/302 cut-off events. [2024-06-28 00:11:10,223 INFO L125 PetriNetUnfolderBase]: For 1819/1825 co-relation queries the response was YES. [2024-06-28 00:11:10,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 302 events. 153/302 cut-off events. For 1819/1825 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1177 event pairs, 35 based on Foata normal form. 11/312 useless extension candidates. Maximal degree in co-relation 1304. Up to 197 conditions per place. [2024-06-28 00:11:10,225 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 41 selfloop transitions, 29 changer transitions 0/73 dead transitions. [2024-06-28 00:11:10,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 73 transitions, 673 flow [2024-06-28 00:11:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:11:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:11:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-28 00:11:10,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-28 00:11:10,227 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 478 flow. Second operand 7 states and 79 transitions. [2024-06-28 00:11:10,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 73 transitions, 673 flow [2024-06-28 00:11:10,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 73 transitions, 632 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-28 00:11:10,231 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 564 flow [2024-06-28 00:11:10,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=68, 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=7, PETRI_FLOW=564, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2024-06-28 00:11:10,231 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2024-06-28 00:11:10,232 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 564 flow [2024-06-28 00:11:10,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:10,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:10,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:10,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 00:11:10,232 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-28 00:11:10,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:10,233 INFO L85 PathProgramCache]: Analyzing trace with hash -393110981, now seen corresponding path program 1 times [2024-06-28 00:11:10,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:10,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192679377] [2024-06-28 00:11:10,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:10,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:14,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:14,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192679377] [2024-06-28 00:11:14,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192679377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:14,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:14,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:11:14,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911423971] [2024-06-28 00:11:14,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:14,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:11:14,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:14,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:11:14,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:11:14,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:11:14,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 564 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-28 00:11:14,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:14,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:11:14,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:14,651 INFO L124 PetriNetUnfolderBase]: 150/297 cut-off events. [2024-06-28 00:11:14,651 INFO L125 PetriNetUnfolderBase]: For 2000/2000 co-relation queries the response was YES. [2024-06-28 00:11:14,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 297 events. 150/297 cut-off events. For 2000/2000 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1112 event pairs, 35 based on Foata normal form. 2/298 useless extension candidates. Maximal degree in co-relation 1356. Up to 256 conditions per place. [2024-06-28 00:11:14,654 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 57 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2024-06-28 00:11:14,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 71 transitions, 716 flow [2024-06-28 00:11:14,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:11:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:11:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2024-06-28 00:11:14,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32857142857142857 [2024-06-28 00:11:14,655 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 564 flow. Second operand 7 states and 69 transitions. [2024-06-28 00:11:14,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 71 transitions, 716 flow [2024-06-28 00:11:14,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 666 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 00:11:14,660 INFO L231 Difference]: Finished difference. Result has 78 places, 64 transitions, 540 flow [2024-06-28 00:11:14,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=540, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2024-06-28 00:11:14,661 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 49 predicate places. [2024-06-28 00:11:14,661 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 540 flow [2024-06-28 00:11:14,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-28 00:11:14,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:14,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:14,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 00:11:14,661 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-28 00:11:14,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:14,662 INFO L85 PathProgramCache]: Analyzing trace with hash 422420767, now seen corresponding path program 1 times [2024-06-28 00:11:14,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:14,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054680726] [2024-06-28 00:11:14,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:14,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:19,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:19,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054680726] [2024-06-28 00:11:19,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054680726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:19,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:19,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:11:19,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903447507] [2024-06-28 00:11:19,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:19,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:11:19,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:19,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:11:19,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:11:19,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:11:19,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 64 transitions, 540 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-28 00:11:19,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:19,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:11:19,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:20,254 INFO L124 PetriNetUnfolderBase]: 156/310 cut-off events. [2024-06-28 00:11:20,255 INFO L125 PetriNetUnfolderBase]: For 1886/1890 co-relation queries the response was YES. [2024-06-28 00:11:20,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 310 events. 156/310 cut-off events. For 1886/1890 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1182 event pairs, 28 based on Foata normal form. 6/315 useless extension candidates. Maximal degree in co-relation 1372. Up to 188 conditions per place. [2024-06-28 00:11:20,257 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 49 selfloop transitions, 36 changer transitions 0/88 dead transitions. [2024-06-28 00:11:20,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 88 transitions, 784 flow [2024-06-28 00:11:20,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:11:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:11:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2024-06-28 00:11:20,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2024-06-28 00:11:20,262 INFO L175 Difference]: Start difference. First operand has 78 places, 64 transitions, 540 flow. Second operand 12 states and 124 transitions. [2024-06-28 00:11:20,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 88 transitions, 784 flow [2024-06-28 00:11:20,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 88 transitions, 753 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-28 00:11:20,267 INFO L231 Difference]: Finished difference. Result has 84 places, 66 transitions, 604 flow [2024-06-28 00:11:20,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=604, PETRI_PLACES=84, PETRI_TRANSITIONS=66} [2024-06-28 00:11:20,267 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 55 predicate places. [2024-06-28 00:11:20,268 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 66 transitions, 604 flow [2024-06-28 00:11:20,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-28 00:11:20,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:20,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:20,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 00:11:20,268 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-28 00:11:20,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 700564133, now seen corresponding path program 2 times [2024-06-28 00:11:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:20,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694405997] [2024-06-28 00:11:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:20,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:25,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:25,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694405997] [2024-06-28 00:11:25,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694405997] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:25,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:25,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:11:25,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834954266] [2024-06-28 00:11:25,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:25,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:11:25,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:25,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:11:25,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:11:25,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:11:25,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 66 transitions, 604 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-28 00:11:25,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:25,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:11:25,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:25,943 INFO L124 PetriNetUnfolderBase]: 152/304 cut-off events. [2024-06-28 00:11:25,943 INFO L125 PetriNetUnfolderBase]: For 2136/2140 co-relation queries the response was YES. [2024-06-28 00:11:25,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 304 events. 152/304 cut-off events. For 2136/2140 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1162 event pairs, 27 based on Foata normal form. 6/309 useless extension candidates. Maximal degree in co-relation 1413. Up to 173 conditions per place. [2024-06-28 00:11:25,946 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 49 selfloop transitions, 37 changer transitions 0/89 dead transitions. [2024-06-28 00:11:25,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 89 transitions, 856 flow [2024-06-28 00:11:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:11:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:11:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-28 00:11:25,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37666666666666665 [2024-06-28 00:11:25,947 INFO L175 Difference]: Start difference. First operand has 84 places, 66 transitions, 604 flow. Second operand 10 states and 113 transitions. [2024-06-28 00:11:25,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 89 transitions, 856 flow [2024-06-28 00:11:25,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 89 transitions, 781 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-28 00:11:25,953 INFO L231 Difference]: Finished difference. Result has 85 places, 68 transitions, 630 flow [2024-06-28 00:11:25,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=630, PETRI_PLACES=85, PETRI_TRANSITIONS=68} [2024-06-28 00:11:25,954 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 56 predicate places. [2024-06-28 00:11:25,954 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 68 transitions, 630 flow [2024-06-28 00:11:25,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-28 00:11:25,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:25,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:25,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 00:11:25,955 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-28 00:11:25,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:25,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1601096150, now seen corresponding path program 1 times [2024-06-28 00:11:25,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:25,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256055929] [2024-06-28 00:11:25,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:25,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:30,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:30,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256055929] [2024-06-28 00:11:30,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256055929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:30,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:30,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:11:30,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95179309] [2024-06-28 00:11:30,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:30,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:11:30,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:30,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:11:30,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:11:30,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:11:30,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 68 transitions, 630 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-28 00:11:30,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:30,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:11:30,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:31,619 INFO L124 PetriNetUnfolderBase]: 156/312 cut-off events. [2024-06-28 00:11:31,620 INFO L125 PetriNetUnfolderBase]: For 2394/2398 co-relation queries the response was YES. [2024-06-28 00:11:31,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 312 events. 156/312 cut-off events. For 2394/2398 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1205 event pairs, 11 based on Foata normal form. 6/317 useless extension candidates. Maximal degree in co-relation 1465. Up to 173 conditions per place. [2024-06-28 00:11:31,622 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 58 selfloop transitions, 29 changer transitions 0/90 dead transitions. [2024-06-28 00:11:31,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 890 flow [2024-06-28 00:11:31,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:11:31,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:11:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-28 00:11:31,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-28 00:11:31,624 INFO L175 Difference]: Start difference. First operand has 85 places, 68 transitions, 630 flow. Second operand 10 states and 105 transitions. [2024-06-28 00:11:31,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 890 flow [2024-06-28 00:11:31,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 90 transitions, 805 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-28 00:11:31,629 INFO L231 Difference]: Finished difference. Result has 87 places, 69 transitions, 615 flow [2024-06-28 00:11:31,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=615, PETRI_PLACES=87, PETRI_TRANSITIONS=69} [2024-06-28 00:11:31,630 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2024-06-28 00:11:31,630 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 69 transitions, 615 flow [2024-06-28 00:11:31,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-28 00:11:31,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:31,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:31,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 00:11:31,631 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-28 00:11:31,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:31,631 INFO L85 PathProgramCache]: Analyzing trace with hash 655768676, now seen corresponding path program 2 times [2024-06-28 00:11:31,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:31,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634457144] [2024-06-28 00:11:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:31,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:36,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:36,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634457144] [2024-06-28 00:11:36,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634457144] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:36,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:36,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:11:36,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237946115] [2024-06-28 00:11:36,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:36,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:11:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:36,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:11:36,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:11:36,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:11:36,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 69 transitions, 615 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-28 00:11:36,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:36,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:11:36,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:37,376 INFO L124 PetriNetUnfolderBase]: 160/324 cut-off events. [2024-06-28 00:11:37,377 INFO L125 PetriNetUnfolderBase]: For 2492/2496 co-relation queries the response was YES. [2024-06-28 00:11:37,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 324 events. 160/324 cut-off events. For 2492/2496 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1295 event pairs, 25 based on Foata normal form. 6/329 useless extension candidates. Maximal degree in co-relation 1489. Up to 226 conditions per place. [2024-06-28 00:11:37,379 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 59 selfloop transitions, 27 changer transitions 0/89 dead transitions. [2024-06-28 00:11:37,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 843 flow [2024-06-28 00:11:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 00:11:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 00:11:37,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2024-06-28 00:11:37,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-28 00:11:37,380 INFO L175 Difference]: Start difference. First operand has 87 places, 69 transitions, 615 flow. Second operand 10 states and 105 transitions. [2024-06-28 00:11:37,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 843 flow [2024-06-28 00:11:37,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 89 transitions, 784 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-28 00:11:37,386 INFO L231 Difference]: Finished difference. Result has 90 places, 70 transitions, 626 flow [2024-06-28 00:11:37,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=626, PETRI_PLACES=90, PETRI_TRANSITIONS=70} [2024-06-28 00:11:37,387 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-28 00:11:37,387 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 70 transitions, 626 flow [2024-06-28 00:11:37,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-28 00:11:37,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:37,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:37,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 00:11:37,388 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-28 00:11:37,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:37,389 INFO L85 PathProgramCache]: Analyzing trace with hash 325429156, now seen corresponding path program 3 times [2024-06-28 00:11:37,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:37,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442106443] [2024-06-28 00:11:37,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:37,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:43,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:43,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442106443] [2024-06-28 00:11:43,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442106443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:43,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:43,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:11:43,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780381835] [2024-06-28 00:11:43,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:43,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:11:43,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:43,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:11:43,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:11:43,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:11:43,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 70 transitions, 626 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-28 00:11:43,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:43,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:11:43,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:44,503 INFO L124 PetriNetUnfolderBase]: 170/346 cut-off events. [2024-06-28 00:11:44,503 INFO L125 PetriNetUnfolderBase]: For 2897/2901 co-relation queries the response was YES. [2024-06-28 00:11:44,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 346 events. 170/346 cut-off events. For 2897/2901 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1437 event pairs, 28 based on Foata normal form. 6/351 useless extension candidates. Maximal degree in co-relation 1569. Up to 258 conditions per place. [2024-06-28 00:11:44,505 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 64 selfloop transitions, 20 changer transitions 0/87 dead transitions. [2024-06-28 00:11:44,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 87 transitions, 852 flow [2024-06-28 00:11:44,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:11:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:11:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2024-06-28 00:11:44,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952380952380952 [2024-06-28 00:11:44,507 INFO L175 Difference]: Start difference. First operand has 90 places, 70 transitions, 626 flow. Second operand 7 states and 83 transitions. [2024-06-28 00:11:44,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 87 transitions, 852 flow [2024-06-28 00:11:44,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 87 transitions, 794 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-28 00:11:44,516 INFO L231 Difference]: Finished difference. Result has 89 places, 72 transitions, 636 flow [2024-06-28 00:11:44,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=636, PETRI_PLACES=89, PETRI_TRANSITIONS=72} [2024-06-28 00:11:44,517 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-28 00:11:44,517 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 72 transitions, 636 flow [2024-06-28 00:11:44,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-28 00:11:44,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:44,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:44,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 00:11:44,517 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-28 00:11:44,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 325613854, now seen corresponding path program 1 times [2024-06-28 00:11:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:44,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343130476] [2024-06-28 00:11:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:11:52,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:52,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343130476] [2024-06-28 00:11:52,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343130476] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:52,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:52,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:52,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666385414] [2024-06-28 00:11:52,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:52,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:52,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:52,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:52,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:52,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:11:52,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 72 transitions, 636 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:52,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:52,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:11:52,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:53,595 INFO L124 PetriNetUnfolderBase]: 174/350 cut-off events. [2024-06-28 00:11:53,595 INFO L125 PetriNetUnfolderBase]: For 3176/3180 co-relation queries the response was YES. [2024-06-28 00:11:53,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 350 events. 174/350 cut-off events. For 3176/3180 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1440 event pairs, 30 based on Foata normal form. 6/355 useless extension candidates. Maximal degree in co-relation 1591. Up to 284 conditions per place. [2024-06-28 00:11:53,598 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 63 selfloop transitions, 18 changer transitions 0/84 dead transitions. [2024-06-28 00:11:53,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 84 transitions, 832 flow [2024-06-28 00:11:53,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:11:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:11:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2024-06-28 00:11:53,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2024-06-28 00:11:53,600 INFO L175 Difference]: Start difference. First operand has 89 places, 72 transitions, 636 flow. Second operand 7 states and 78 transitions. [2024-06-28 00:11:53,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 84 transitions, 832 flow [2024-06-28 00:11:53,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 84 transitions, 790 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 00:11:53,606 INFO L231 Difference]: Finished difference. Result has 91 places, 73 transitions, 642 flow [2024-06-28 00:11:53,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=642, PETRI_PLACES=91, PETRI_TRANSITIONS=73} [2024-06-28 00:11:53,606 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-28 00:11:53,606 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 73 transitions, 642 flow [2024-06-28 00:11:53,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:53,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:53,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:53,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 00:11:53,607 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-28 00:11:53,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:53,607 INFO L85 PathProgramCache]: Analyzing trace with hash 168923354, now seen corresponding path program 2 times [2024-06-28 00:11:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:53,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792941737] [2024-06-28 00:11:53,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:11:59,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-28 00:11:59,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:11:59,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792941737] [2024-06-28 00:11:59,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792941737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:11:59,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:11:59,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:11:59,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695957898] [2024-06-28 00:11:59,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:11:59,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:11:59,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:11:59,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:11:59,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:11:59,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:11:59,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 73 transitions, 642 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:59,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:11:59,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:11:59,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:11:59,633 INFO L124 PetriNetUnfolderBase]: 178/360 cut-off events. [2024-06-28 00:11:59,633 INFO L125 PetriNetUnfolderBase]: For 3431/3435 co-relation queries the response was YES. [2024-06-28 00:11:59,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1677 conditions, 360 events. 178/360 cut-off events. For 3431/3435 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1502 event pairs, 35 based on Foata normal form. 6/365 useless extension candidates. Maximal degree in co-relation 1631. Up to 272 conditions per place. [2024-06-28 00:11:59,636 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 61 selfloop transitions, 24 changer transitions 0/88 dead transitions. [2024-06-28 00:11:59,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 88 transitions, 856 flow [2024-06-28 00:11:59,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:11:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:11:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-28 00:11:59,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-28 00:11:59,638 INFO L175 Difference]: Start difference. First operand has 91 places, 73 transitions, 642 flow. Second operand 8 states and 90 transitions. [2024-06-28 00:11:59,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 88 transitions, 856 flow [2024-06-28 00:11:59,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 818 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 00:11:59,644 INFO L231 Difference]: Finished difference. Result has 94 places, 74 transitions, 666 flow [2024-06-28 00:11:59,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=666, PETRI_PLACES=94, PETRI_TRANSITIONS=74} [2024-06-28 00:11:59,645 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-28 00:11:59,645 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 74 transitions, 666 flow [2024-06-28 00:11:59,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:11:59,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:11:59,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:11:59,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 00:11:59,646 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-28 00:11:59,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:11:59,646 INFO L85 PathProgramCache]: Analyzing trace with hash 177205934, now seen corresponding path program 3 times [2024-06-28 00:11:59,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:11:59,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535256127] [2024-06-28 00:11:59,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:11:59,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:11:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:04,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:04,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535256127] [2024-06-28 00:12:04,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535256127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:04,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:04,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:12:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508716671] [2024-06-28 00:12:04,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:04,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:12:04,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:04,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:12:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:12:04,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:04,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 74 transitions, 666 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:04,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:04,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:04,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:04,678 INFO L124 PetriNetUnfolderBase]: 182/370 cut-off events. [2024-06-28 00:12:04,678 INFO L125 PetriNetUnfolderBase]: For 3779/3783 co-relation queries the response was YES. [2024-06-28 00:12:04,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 370 events. 182/370 cut-off events. For 3779/3783 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1547 event pairs, 33 based on Foata normal form. 6/375 useless extension candidates. Maximal degree in co-relation 1701. Up to 251 conditions per place. [2024-06-28 00:12:04,680 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 60 selfloop transitions, 28 changer transitions 0/91 dead transitions. [2024-06-28 00:12:04,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 91 transitions, 930 flow [2024-06-28 00:12:04,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:12:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:12:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-28 00:12:04,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2024-06-28 00:12:04,682 INFO L175 Difference]: Start difference. First operand has 94 places, 74 transitions, 666 flow. Second operand 8 states and 89 transitions. [2024-06-28 00:12:04,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 91 transitions, 930 flow [2024-06-28 00:12:04,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 878 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 00:12:04,688 INFO L231 Difference]: Finished difference. Result has 96 places, 75 transitions, 684 flow [2024-06-28 00:12:04,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=684, PETRI_PLACES=96, PETRI_TRANSITIONS=75} [2024-06-28 00:12:04,689 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-28 00:12:04,689 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 75 transitions, 684 flow [2024-06-28 00:12:04,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:04,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:04,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:04,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 00:12:04,690 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-28 00:12:04,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1025173292, now seen corresponding path program 4 times [2024-06-28 00:12:04,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:04,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106010818] [2024-06-28 00:12:04,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:04,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:07,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-28 00:12:07,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:07,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106010818] [2024-06-28 00:12:07,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106010818] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:07,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:07,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 00:12:07,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217607415] [2024-06-28 00:12:07,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:07,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 00:12:07,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:07,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 00:12:07,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-28 00:12:07,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:07,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 75 transitions, 684 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-28 00:12:07,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:07,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:07,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:08,480 INFO L124 PetriNetUnfolderBase]: 201/416 cut-off events. [2024-06-28 00:12:08,481 INFO L125 PetriNetUnfolderBase]: For 5866/5876 co-relation queries the response was YES. [2024-06-28 00:12:08,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1877 conditions, 416 events. 201/416 cut-off events. For 5866/5876 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1872 event pairs, 43 based on Foata normal form. 22/437 useless extension candidates. Maximal degree in co-relation 1830. Up to 213 conditions per place. [2024-06-28 00:12:08,483 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 50 selfloop transitions, 21 changer transitions 19/93 dead transitions. [2024-06-28 00:12:08,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 93 transitions, 939 flow [2024-06-28 00:12:08,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:12:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:12:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-28 00:12:08,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-28 00:12:08,484 INFO L175 Difference]: Start difference. First operand has 96 places, 75 transitions, 684 flow. Second operand 8 states and 93 transitions. [2024-06-28 00:12:08,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 93 transitions, 939 flow [2024-06-28 00:12:08,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 879 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-28 00:12:08,492 INFO L231 Difference]: Finished difference. Result has 99 places, 62 transitions, 555 flow [2024-06-28 00:12:08,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=555, PETRI_PLACES=99, PETRI_TRANSITIONS=62} [2024-06-28 00:12:08,492 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 70 predicate places. [2024-06-28 00:12:08,493 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 62 transitions, 555 flow [2024-06-28 00:12:08,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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-28 00:12:08,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:08,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:08,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 00:12:08,493 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-28 00:12:08,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:08,493 INFO L85 PathProgramCache]: Analyzing trace with hash -303339430, now seen corresponding path program 4 times [2024-06-28 00:12:08,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:08,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127947548] [2024-06-28 00:12:08,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:08,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127947548] [2024-06-28 00:12:13,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127947548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:13,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:13,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:12:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113714452] [2024-06-28 00:12:13,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:13,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:12:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:12:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:12:13,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:13,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 62 transitions, 555 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:13,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:13,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:13,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:13,581 INFO L124 PetriNetUnfolderBase]: 150/321 cut-off events. [2024-06-28 00:12:13,581 INFO L125 PetriNetUnfolderBase]: For 3549/3559 co-relation queries the response was YES. [2024-06-28 00:12:13,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 321 events. 150/321 cut-off events. For 3549/3559 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1354 event pairs, 38 based on Foata normal form. 12/332 useless extension candidates. Maximal degree in co-relation 1412. Up to 232 conditions per place. [2024-06-28 00:12:13,584 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 48 selfloop transitions, 18 changer transitions 0/69 dead transitions. [2024-06-28 00:12:13,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 69 transitions, 703 flow [2024-06-28 00:12:13,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 00:12:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 00:12:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2024-06-28 00:12:13,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2024-06-28 00:12:13,585 INFO L175 Difference]: Start difference. First operand has 99 places, 62 transitions, 555 flow. Second operand 7 states and 72 transitions. [2024-06-28 00:12:13,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 69 transitions, 703 flow [2024-06-28 00:12:13,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 69 transitions, 628 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-28 00:12:13,592 INFO L231 Difference]: Finished difference. Result has 95 places, 62 transitions, 524 flow [2024-06-28 00:12:13,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=524, PETRI_PLACES=95, PETRI_TRANSITIONS=62} [2024-06-28 00:12:13,592 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 66 predicate places. [2024-06-28 00:12:13,592 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 62 transitions, 524 flow [2024-06-28 00:12:13,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:13,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:13,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:13,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 00:12:13,593 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-28 00:12:13,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash 904398306, now seen corresponding path program 1 times [2024-06-28 00:12:13,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:13,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508768273] [2024-06-28 00:12:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:13,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:19,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:19,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508768273] [2024-06-28 00:12:19,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508768273] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:19,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:19,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:12:19,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078534742] [2024-06-28 00:12:19,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:19,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:12:19,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:19,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:12:19,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:12:19,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:19,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 62 transitions, 524 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:19,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:19,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:19,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:20,692 INFO L124 PetriNetUnfolderBase]: 208/441 cut-off events. [2024-06-28 00:12:20,692 INFO L125 PetriNetUnfolderBase]: For 6134/6134 co-relation queries the response was YES. [2024-06-28 00:12:20,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1957 conditions, 441 events. 208/441 cut-off events. For 6134/6134 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2043 event pairs, 75 based on Foata normal form. 8/448 useless extension candidates. Maximal degree in co-relation 1908. Up to 245 conditions per place. [2024-06-28 00:12:20,695 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 69 selfloop transitions, 15 changer transitions 12/99 dead transitions. [2024-06-28 00:12:20,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 99 transitions, 892 flow [2024-06-28 00:12:20,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-28 00:12:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-28 00:12:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2024-06-28 00:12:20,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34102564102564104 [2024-06-28 00:12:20,697 INFO L175 Difference]: Start difference. First operand has 95 places, 62 transitions, 524 flow. Second operand 13 states and 133 transitions. [2024-06-28 00:12:20,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 99 transitions, 892 flow [2024-06-28 00:12:20,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 99 transitions, 842 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-28 00:12:20,704 INFO L231 Difference]: Finished difference. Result has 104 places, 64 transitions, 523 flow [2024-06-28 00:12:20,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=523, PETRI_PLACES=104, PETRI_TRANSITIONS=64} [2024-06-28 00:12:20,705 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 75 predicate places. [2024-06-28 00:12:20,705 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 64 transitions, 523 flow [2024-06-28 00:12:20,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:20,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:20,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:20,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 00:12:20,706 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-28 00:12:20,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:20,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1049959086, now seen corresponding path program 2 times [2024-06-28 00:12:20,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:20,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601629443] [2024-06-28 00:12:20,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:20,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:26,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:26,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601629443] [2024-06-28 00:12:26,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601629443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:26,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:26,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:12:26,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557165586] [2024-06-28 00:12:26,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:26,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:12:26,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:26,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:12:26,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:12:26,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:26,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 64 transitions, 523 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:26,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:26,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:26,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:27,209 INFO L124 PetriNetUnfolderBase]: 235/501 cut-off events. [2024-06-28 00:12:27,210 INFO L125 PetriNetUnfolderBase]: For 8714/8718 co-relation queries the response was YES. [2024-06-28 00:12:27,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 501 events. 235/501 cut-off events. For 8714/8718 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2412 event pairs, 53 based on Foata normal form. 20/520 useless extension candidates. Maximal degree in co-relation 2247. Up to 188 conditions per place. [2024-06-28 00:12:27,213 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 59 selfloop transitions, 25 changer transitions 8/95 dead transitions. [2024-06-28 00:12:27,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 95 transitions, 853 flow [2024-06-28 00:12:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:12:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:12:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-28 00:12:27,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2024-06-28 00:12:27,214 INFO L175 Difference]: Start difference. First operand has 104 places, 64 transitions, 523 flow. Second operand 12 states and 128 transitions. [2024-06-28 00:12:27,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 95 transitions, 853 flow [2024-06-28 00:12:27,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 95 transitions, 819 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-28 00:12:27,223 INFO L231 Difference]: Finished difference. Result has 102 places, 61 transitions, 521 flow [2024-06-28 00:12:27,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=521, PETRI_PLACES=102, PETRI_TRANSITIONS=61} [2024-06-28 00:12:27,224 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 73 predicate places. [2024-06-28 00:12:27,224 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 61 transitions, 521 flow [2024-06-28 00:12:27,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:27,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:27,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:27,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 00:12:27,225 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-28 00:12:27,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1909576132, now seen corresponding path program 3 times [2024-06-28 00:12:27,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:27,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862283734] [2024-06-28 00:12:27,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:27,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:32,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:32,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862283734] [2024-06-28 00:12:32,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862283734] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:32,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:32,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:12:32,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379688556] [2024-06-28 00:12:32,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:32,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:12:32,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:32,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:12:32,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:12:32,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:32,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 61 transitions, 521 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:32,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:32,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:32,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:33,259 INFO L124 PetriNetUnfolderBase]: 173/379 cut-off events. [2024-06-28 00:12:33,260 INFO L125 PetriNetUnfolderBase]: For 6081/6085 co-relation queries the response was YES. [2024-06-28 00:12:33,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1593 conditions, 379 events. 173/379 cut-off events. For 6081/6085 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1711 event pairs, 35 based on Foata normal form. 24/402 useless extension candidates. Maximal degree in co-relation 1545. Up to 188 conditions per place. [2024-06-28 00:12:33,262 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 49 selfloop transitions, 15 changer transitions 19/86 dead transitions. [2024-06-28 00:12:33,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 86 transitions, 771 flow [2024-06-28 00:12:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:12:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:12:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-28 00:12:33,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-06-28 00:12:33,264 INFO L175 Difference]: Start difference. First operand has 102 places, 61 transitions, 521 flow. Second operand 11 states and 115 transitions. [2024-06-28 00:12:33,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 86 transitions, 771 flow [2024-06-28 00:12:33,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 86 transitions, 721 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-28 00:12:33,270 INFO L231 Difference]: Finished difference. Result has 100 places, 51 transitions, 415 flow [2024-06-28 00:12:33,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=415, PETRI_PLACES=100, PETRI_TRANSITIONS=51} [2024-06-28 00:12:33,270 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2024-06-28 00:12:33,270 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 51 transitions, 415 flow [2024-06-28 00:12:33,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:33,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:33,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:33,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 00:12:33,271 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-28 00:12:33,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:33,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1194212688, now seen corresponding path program 1 times [2024-06-28 00:12:33,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:33,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966262750] [2024-06-28 00:12:33,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:33,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:39,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:39,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966262750] [2024-06-28 00:12:39,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966262750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:39,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:39,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:12:39,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094021057] [2024-06-28 00:12:39,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:39,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:12:39,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:39,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:12:39,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:12:39,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:39,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 51 transitions, 415 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:39,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:39,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:39,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:39,963 INFO L124 PetriNetUnfolderBase]: 126/286 cut-off events. [2024-06-28 00:12:39,964 INFO L125 PetriNetUnfolderBase]: For 3116/3117 co-relation queries the response was YES. [2024-06-28 00:12:39,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 286 events. 126/286 cut-off events. For 3116/3117 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1167 event pairs, 36 based on Foata normal form. 7/292 useless extension candidates. Maximal degree in co-relation 1174. Up to 198 conditions per place. [2024-06-28 00:12:39,965 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 38 selfloop transitions, 8 changer transitions 17/66 dead transitions. [2024-06-28 00:12:39,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 66 transitions, 588 flow [2024-06-28 00:12:39,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:12:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:12:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2024-06-28 00:12:39,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2024-06-28 00:12:39,966 INFO L175 Difference]: Start difference. First operand has 100 places, 51 transitions, 415 flow. Second operand 8 states and 85 transitions. [2024-06-28 00:12:39,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 66 transitions, 588 flow [2024-06-28 00:12:39,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 66 transitions, 542 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-06-28 00:12:39,971 INFO L231 Difference]: Finished difference. Result has 87 places, 45 transitions, 334 flow [2024-06-28 00:12:39,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=334, PETRI_PLACES=87, PETRI_TRANSITIONS=45} [2024-06-28 00:12:39,971 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2024-06-28 00:12:39,971 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 45 transitions, 334 flow [2024-06-28 00:12:39,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:39,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:39,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:39,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 00:12:39,972 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-28 00:12:39,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:39,972 INFO L85 PathProgramCache]: Analyzing trace with hash -876475072, now seen corresponding path program 4 times [2024-06-28 00:12:39,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:39,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383121230] [2024-06-28 00:12:39,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:39,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:12:44,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:44,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383121230] [2024-06-28 00:12:44,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383121230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:44,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:44,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:12:44,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878822295] [2024-06-28 00:12:44,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:44,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:12:44,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:44,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:12:44,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:12:45,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:45,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 45 transitions, 334 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:45,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:45,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:45,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:46,151 INFO L124 PetriNetUnfolderBase]: 126/284 cut-off events. [2024-06-28 00:12:46,151 INFO L125 PetriNetUnfolderBase]: For 2888/2889 co-relation queries the response was YES. [2024-06-28 00:12:46,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 284 events. 126/284 cut-off events. For 2888/2889 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1128 event pairs, 32 based on Foata normal form. 11/294 useless extension candidates. Maximal degree in co-relation 1083. Up to 152 conditions per place. [2024-06-28 00:12:46,153 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 42 selfloop transitions, 16 changer transitions 15/76 dead transitions. [2024-06-28 00:12:46,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 76 transitions, 590 flow [2024-06-28 00:12:46,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 00:12:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 00:12:46,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-28 00:12:46,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2024-06-28 00:12:46,154 INFO L175 Difference]: Start difference. First operand has 87 places, 45 transitions, 334 flow. Second operand 12 states and 128 transitions. [2024-06-28 00:12:46,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 76 transitions, 590 flow [2024-06-28 00:12:46,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 76 transitions, 559 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-28 00:12:46,158 INFO L231 Difference]: Finished difference. Result has 85 places, 44 transitions, 343 flow [2024-06-28 00:12:46,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=343, PETRI_PLACES=85, PETRI_TRANSITIONS=44} [2024-06-28 00:12:46,159 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 56 predicate places. [2024-06-28 00:12:46,159 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 44 transitions, 343 flow [2024-06-28 00:12:46,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:46,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:46,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:46,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 00:12:46,160 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-28 00:12:46,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:46,160 INFO L85 PathProgramCache]: Analyzing trace with hash 941657518, now seen corresponding path program 2 times [2024-06-28 00:12:46,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:46,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37734340] [2024-06-28 00:12:46,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:46,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:12:53,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-28 00:12:53,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:12:53,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37734340] [2024-06-28 00:12:53,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37734340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:12:53,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:12:53,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:12:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139089348] [2024-06-28 00:12:53,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:12:53,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:12:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:12:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:12:53,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:12:53,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:12:53,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 44 transitions, 343 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:53,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:12:53,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:12:53,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:12:54,520 INFO L124 PetriNetUnfolderBase]: 103/245 cut-off events. [2024-06-28 00:12:54,520 INFO L125 PetriNetUnfolderBase]: For 2315/2316 co-relation queries the response was YES. [2024-06-28 00:12:54,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 245 events. 103/245 cut-off events. For 2315/2316 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 942 event pairs, 27 based on Foata normal form. 7/251 useless extension candidates. Maximal degree in co-relation 985. Up to 140 conditions per place. [2024-06-28 00:12:54,522 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 39 selfloop transitions, 11 changer transitions 13/66 dead transitions. [2024-06-28 00:12:54,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 66 transitions, 529 flow [2024-06-28 00:12:54,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:12:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:12:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-28 00:12:54,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3424242424242424 [2024-06-28 00:12:54,523 INFO L175 Difference]: Start difference. First operand has 85 places, 44 transitions, 343 flow. Second operand 11 states and 113 transitions. [2024-06-28 00:12:54,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 66 transitions, 529 flow [2024-06-28 00:12:54,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 66 transitions, 489 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-28 00:12:54,527 INFO L231 Difference]: Finished difference. Result has 84 places, 38 transitions, 283 flow [2024-06-28 00:12:54,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=283, PETRI_PLACES=84, PETRI_TRANSITIONS=38} [2024-06-28 00:12:54,527 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 55 predicate places. [2024-06-28 00:12:54,527 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 38 transitions, 283 flow [2024-06-28 00:12:54,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:12:54,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:12:54,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:12:54,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 00:12:54,528 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-28 00:12:54,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:12:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1207354798, now seen corresponding path program 3 times [2024-06-28 00:12:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:12:54,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194941163] [2024-06-28 00:12:54,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:12:54,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:12:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:00,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:00,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194941163] [2024-06-28 00:13:00,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194941163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:00,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:00,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:13:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262004998] [2024-06-28 00:13:00,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:00,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:13:00,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:00,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:13:00,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:13:00,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:00,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 38 transitions, 283 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:00,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:00,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:00,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:00,999 INFO L124 PetriNetUnfolderBase]: 100/244 cut-off events. [2024-06-28 00:13:00,999 INFO L125 PetriNetUnfolderBase]: For 2531/2532 co-relation queries the response was YES. [2024-06-28 00:13:00,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 244 events. 100/244 cut-off events. For 2531/2532 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 920 event pairs, 35 based on Foata normal form. 7/250 useless extension candidates. Maximal degree in co-relation 964. Up to 99 conditions per place. [2024-06-28 00:13:01,000 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 34 selfloop transitions, 9 changer transitions 17/63 dead transitions. [2024-06-28 00:13:01,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 63 transitions, 497 flow [2024-06-28 00:13:01,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 00:13:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 00:13:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2024-06-28 00:13:01,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3424242424242424 [2024-06-28 00:13:01,002 INFO L175 Difference]: Start difference. First operand has 84 places, 38 transitions, 283 flow. Second operand 11 states and 113 transitions. [2024-06-28 00:13:01,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 63 transitions, 497 flow [2024-06-28 00:13:01,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 63 transitions, 461 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-06-28 00:13:01,004 INFO L231 Difference]: Finished difference. Result has 78 places, 31 transitions, 218 flow [2024-06-28 00:13:01,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=218, PETRI_PLACES=78, PETRI_TRANSITIONS=31} [2024-06-28 00:13:01,005 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 49 predicate places. [2024-06-28 00:13:01,005 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 31 transitions, 218 flow [2024-06-28 00:13:01,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:01,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:01,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:01,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 00:13:01,006 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-28 00:13:01,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:01,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1702771216, now seen corresponding path program 5 times [2024-06-28 00:13:01,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:01,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149996422] [2024-06-28 00:13:01,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:01,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:05,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:05,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149996422] [2024-06-28 00:13:05,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149996422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:05,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:05,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:13:05,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440414812] [2024-06-28 00:13:05,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:05,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:13:05,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:05,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:13:05,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:13:05,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:05,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 31 transitions, 218 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:05,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:05,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:05,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:06,472 INFO L124 PetriNetUnfolderBase]: 101/238 cut-off events. [2024-06-28 00:13:06,473 INFO L125 PetriNetUnfolderBase]: For 2106/2107 co-relation queries the response was YES. [2024-06-28 00:13:06,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 238 events. 101/238 cut-off events. For 2106/2107 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 904 event pairs, 47 based on Foata normal form. 9/246 useless extension candidates. Maximal degree in co-relation 892. Up to 147 conditions per place. [2024-06-28 00:13:06,474 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 30 selfloop transitions, 7 changer transitions 18/58 dead transitions. [2024-06-28 00:13:06,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 58 transitions, 415 flow [2024-06-28 00:13:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:13:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:13:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-28 00:13:06,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2024-06-28 00:13:06,475 INFO L175 Difference]: Start difference. First operand has 78 places, 31 transitions, 218 flow. Second operand 9 states and 95 transitions. [2024-06-28 00:13:06,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 58 transitions, 415 flow [2024-06-28 00:13:06,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 366 flow, removed 4 selfloop flow, removed 16 redundant places. [2024-06-28 00:13:06,477 INFO L231 Difference]: Finished difference. Result has 65 places, 31 transitions, 197 flow [2024-06-28 00:13:06,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=197, PETRI_PLACES=65, PETRI_TRANSITIONS=31} [2024-06-28 00:13:06,477 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 36 predicate places. [2024-06-28 00:13:06,477 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 31 transitions, 197 flow [2024-06-28 00:13:06,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:06,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:06,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:06,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 00:13:06,478 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-28 00:13:06,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:06,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1503247506, now seen corresponding path program 6 times [2024-06-28 00:13:06,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:06,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747354198] [2024-06-28 00:13:06,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:06,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:11,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:11,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747354198] [2024-06-28 00:13:11,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747354198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:11,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:11,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:13:11,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723923963] [2024-06-28 00:13:11,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:11,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:13:11,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:11,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:13:11,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:13:11,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:11,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 31 transitions, 197 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:11,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:11,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:11,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:12,803 INFO L124 PetriNetUnfolderBase]: 91/217 cut-off events. [2024-06-28 00:13:12,803 INFO L125 PetriNetUnfolderBase]: For 1259/1260 co-relation queries the response was YES. [2024-06-28 00:13:12,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 217 events. 91/217 cut-off events. For 1259/1260 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 773 event pairs, 19 based on Foata normal form. 9/225 useless extension candidates. Maximal degree in co-relation 776. Up to 111 conditions per place. [2024-06-28 00:13:12,804 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 27 selfloop transitions, 6 changer transitions 18/54 dead transitions. [2024-06-28 00:13:12,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 54 transitions, 362 flow [2024-06-28 00:13:12,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:13:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:13:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2024-06-28 00:13:12,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34074074074074073 [2024-06-28 00:13:12,805 INFO L175 Difference]: Start difference. First operand has 65 places, 31 transitions, 197 flow. Second operand 9 states and 92 transitions. [2024-06-28 00:13:12,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 54 transitions, 362 flow [2024-06-28 00:13:12,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 54 transitions, 340 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-28 00:13:12,807 INFO L231 Difference]: Finished difference. Result has 64 places, 27 transitions, 161 flow [2024-06-28 00:13:12,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=161, PETRI_PLACES=64, PETRI_TRANSITIONS=27} [2024-06-28 00:13:12,807 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-28 00:13:12,808 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 27 transitions, 161 flow [2024-06-28 00:13:12,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:12,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:12,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:12,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 00:13:12,808 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-28 00:13:12,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash 45209408, now seen corresponding path program 7 times [2024-06-28 00:13:12,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:12,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045382477] [2024-06-28 00:13:12,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:17,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:17,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045382477] [2024-06-28 00:13:17,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045382477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:17,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:17,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 00:13:17,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741529746] [2024-06-28 00:13:17,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:17,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 00:13:17,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:17,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 00:13:17,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 00:13:17,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:17,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 27 transitions, 161 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:17,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:17,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:17,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:18,362 INFO L124 PetriNetUnfolderBase]: 54/134 cut-off events. [2024-06-28 00:13:18,362 INFO L125 PetriNetUnfolderBase]: For 825/826 co-relation queries the response was YES. [2024-06-28 00:13:18,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 134 events. 54/134 cut-off events. For 825/826 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 384 event pairs, 13 based on Foata normal form. 9/142 useless extension candidates. Maximal degree in co-relation 464. Up to 44 conditions per place. [2024-06-28 00:13:18,362 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 17 selfloop transitions, 4 changer transitions 18/42 dead transitions. [2024-06-28 00:13:18,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 42 transitions, 273 flow [2024-06-28 00:13:18,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 00:13:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 00:13:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2024-06-28 00:13:18,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3148148148148148 [2024-06-28 00:13:18,363 INFO L175 Difference]: Start difference. First operand has 64 places, 27 transitions, 161 flow. Second operand 9 states and 85 transitions. [2024-06-28 00:13:18,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 42 transitions, 273 flow [2024-06-28 00:13:18,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 42 transitions, 235 flow, removed 6 selfloop flow, removed 14 redundant places. [2024-06-28 00:13:18,365 INFO L231 Difference]: Finished difference. Result has 56 places, 21 transitions, 103 flow [2024-06-28 00:13:18,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=103, PETRI_PLACES=56, PETRI_TRANSITIONS=21} [2024-06-28 00:13:18,365 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 27 predicate places. [2024-06-28 00:13:18,365 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 21 transitions, 103 flow [2024-06-28 00:13:18,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:18,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 00:13:18,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:18,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 00:13:18,366 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-28 00:13:18,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 00:13:18,366 INFO L85 PathProgramCache]: Analyzing trace with hash -581440406, now seen corresponding path program 4 times [2024-06-28 00:13:18,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 00:13:18,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975812906] [2024-06-28 00:13:18,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 00:13:18,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 00:13:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 00:13:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 00:13:23,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 00:13:23,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975812906] [2024-06-28 00:13:23,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975812906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 00:13:23,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 00:13:23,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 00:13:23,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343336689] [2024-06-28 00:13:23,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 00:13:23,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 00:13:23,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 00:13:23,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 00:13:23,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 00:13:23,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-28 00:13:23,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 21 transitions, 103 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:23,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 00:13:23,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-28 00:13:23,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 00:13:23,604 INFO L124 PetriNetUnfolderBase]: 18/56 cut-off events. [2024-06-28 00:13:23,604 INFO L125 PetriNetUnfolderBase]: For 269/269 co-relation queries the response was YES. [2024-06-28 00:13:23,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 56 events. 18/56 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 2 based on Foata normal form. 6/61 useless extension candidates. Maximal degree in co-relation 152. Up to 24 conditions per place. [2024-06-28 00:13:23,604 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 0 selfloop transitions, 0 changer transitions 24/24 dead transitions. [2024-06-28 00:13:23,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 24 transitions, 133 flow [2024-06-28 00:13:23,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 00:13:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 00:13:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2024-06-28 00:13:23,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25833333333333336 [2024-06-28 00:13:23,605 INFO L175 Difference]: Start difference. First operand has 56 places, 21 transitions, 103 flow. Second operand 8 states and 62 transitions. [2024-06-28 00:13:23,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 24 transitions, 133 flow [2024-06-28 00:13:23,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 24 transitions, 99 flow, removed 2 selfloop flow, removed 16 redundant places. [2024-06-28 00:13:23,605 INFO L231 Difference]: Finished difference. Result has 39 places, 0 transitions, 0 flow [2024-06-28 00:13:23,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=39, PETRI_TRANSITIONS=0} [2024-06-28 00:13:23,606 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2024-06-28 00:13:23,606 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 0 transitions, 0 flow [2024-06-28 00:13:23,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 00:13:23,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-28 00:13:23,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-28 00:13:23,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-28 00:13:23,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-28 00:13:23,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 00:13:23,609 INFO L445 BasicCegarLoop]: Path program histogram: [7, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 00:13:23,611 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 00:13:23,611 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 00:13:23,614 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 00:13:23,614 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 00:13:23,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 12:13:23 BasicIcfg [2024-06-28 00:13:23,614 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 00:13:23,615 INFO L158 Benchmark]: Toolchain (without parser) took 183046.90ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 127.9MB in the beginning and 653.2MB in the end (delta: -525.3MB). Peak memory consumption was 838.9MB. Max. memory is 16.1GB. [2024-06-28 00:13:23,615 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 00:13:23,615 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 00:13:23,615 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.63ms. Allocated memory is still 167.8MB. Free memory was 127.4MB in the beginning and 93.3MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-06-28 00:13:23,615 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.84ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 86.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-06-28 00:13:23,616 INFO L158 Benchmark]: Boogie Preprocessor took 96.17ms. Allocated memory is still 167.8MB. Free memory was 86.0MB in the beginning and 81.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 00:13:23,616 INFO L158 Benchmark]: RCFGBuilder took 1003.58ms. Allocated memory is still 167.8MB. Free memory was 80.8MB in the beginning and 80.0MB in the end (delta: 812.4kB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2024-06-28 00:13:23,616 INFO L158 Benchmark]: TraceAbstraction took 181332.83ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 78.9MB in the beginning and 653.2MB in the end (delta: -574.3MB). Peak memory consumption was 789.9MB. Max. memory is 16.1GB. [2024-06-28 00:13:23,617 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.63ms. Allocated memory is still 167.8MB. Free memory was 127.4MB in the beginning and 93.3MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.84ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 86.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.17ms. Allocated memory is still 167.8MB. Free memory was 86.0MB in the beginning and 81.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1003.58ms. Allocated memory is still 167.8MB. Free memory was 80.8MB in the beginning and 80.0MB in the end (delta: 812.4kB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. * TraceAbstraction took 181332.83ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 78.9MB in the beginning and 653.2MB in the end (delta: -574.3MB). Peak memory consumption was 789.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 816]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 817]: 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, 47 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: 181.2s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 24.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 894 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 793 mSDsluCounter, 262 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5474 IncrementalHoareTripleChecker+Invalid, 5810 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 336 mSolverCounterUnsat, 126 mSDtfsCounter, 5474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 35.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=684occurred in iteration=21, InterpolantAutomatonStates: 278, 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.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 155.1s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 464 ConstructedInterpolants, 0 QuantifiedInterpolants, 62997 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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-28 00:13:23,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE