./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix043.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/mix043.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix043.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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:37:57,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:37:57,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:37:57,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:37:57,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:37:57,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:37:57,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:37:57,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:37:57,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:37:57,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:37:57,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:37:57,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:37:57,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:37:57,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:37:57,764 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:37:57,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:37:57,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:37:57,765 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:37:57,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:37:57,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:37:57,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:37:57,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:37:57,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:37:57,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:37:57,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:37:57,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:37:57,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:37:57,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:37:57,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:37:57,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:37:57,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:37:57,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:37:57,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:37:57,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:37:57,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:37:57,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:37:57,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:37:57,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:37:57,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:37:57,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:37:57,770 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:37:57,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:37:57,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:37:57,771 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 [2024-06-28 01:37:57,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:37:58,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:37:58,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:37:58,005 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:37:58,005 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:37:58,006 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-nonrel/mix043.oepc.yml/witness.yml [2024-06-28 01:37:58,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:37:58,155 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:37:58,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2024-06-28 01:37:59,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:37:59,388 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:37:59,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2024-06-28 01:37:59,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa75cbe24/0db34957389e48a2b6758979119ecdae/FLAGa3a539e86 [2024-06-28 01:37:59,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa75cbe24/0db34957389e48a2b6758979119ecdae [2024-06-28 01:37:59,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:37:59,416 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:37:59,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:37:59,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:37:59,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:37:59,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:37:58" (1/2) ... [2024-06-28 01:37:59,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd92713 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:59, skipping insertion in model container [2024-06-28 01:37:59,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:37:58" (1/2) ... [2024-06-28 01:37:59,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@48f22fc4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:37:59, skipping insertion in model container [2024-06-28 01:37:59,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:37:59" (2/2) ... [2024-06-28 01:37:59,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd92713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:37:59, skipping insertion in model container [2024-06-28 01:37:59,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:37:59" (2/2) ... [2024-06-28 01:37:59,431 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:37:59,522 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:37:59,523 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] (((((((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || b$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff0_thd4 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$r_buff1_thd4 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (b$w_buff0 == 0 || b$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || b$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (b$w_buff1 == 0 || b$w_buff1 == 1))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (b$mem_tmp == 0 || b$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0) [2024-06-28 01:37:59,523 INFO L97 edCorrectnessWitness]: Location invariant before [L878-L878] (((((((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || b$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff0_thd4 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$r_buff1_thd4 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (b$w_buff0 == 0 || b$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || b$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (b$w_buff1 == 0 || b$w_buff1 == 1))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (b$mem_tmp == 0 || b$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0) [2024-06-28 01:37:59,523 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] (((((((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || b$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff0_thd4 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$r_buff1_thd4 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (b$w_buff0 == 0 || b$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || b$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (b$w_buff1 == 0 || b$w_buff1 == 1))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (b$mem_tmp == 0 || b$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0) [2024-06-28 01:37:59,523 INFO L97 edCorrectnessWitness]: Location invariant before [L879-L879] (((((((((((((((((((((((! multithreaded || (y == 0 || y == 1)) && (! multithreaded || b$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && b$flush_delayed == (_Bool)0) && b$r_buff0_thd0 == (_Bool)0) && b$r_buff0_thd2 == (_Bool)0) && b$r_buff0_thd3 == (_Bool)0) && b$r_buff0_thd4 == (_Bool)0) && b$r_buff1_thd0 == (_Bool)0) && b$r_buff1_thd2 == (_Bool)0) && b$r_buff1_thd3 == (_Bool)0) && b$r_buff1_thd4 == (_Bool)0) && b$read_delayed == (_Bool)0) && b$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (b$mem_tmp == 0 || b$mem_tmp == 1)) && (b$w_buff0 == 0 || b$w_buff0 == 1)) && (b$w_buff1 == 0 || b$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (b$w_buff0 == 0 || b$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || b$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (b$w_buff1 == 0 || b$w_buff1 == 1))) && (! multithreaded || b$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (b$mem_tmp == 0 || b$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || b$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || b$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || b$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || b$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || b$read_delayed == (_Bool)0)) && (! multithreaded || b$r_buff1_thd0 == (_Bool)0) [2024-06-28 01:37:59,524 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:37:59,524 INFO L106 edCorrectnessWitness]: ghost_update [L872-L872] multithreaded = 1; [2024-06-28 01:37:59,560 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:37:59,677 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i[945,958] [2024-06-28 01:37:59,845 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:37:59,855 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:37:59,883 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:37:59,969 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:38:00,046 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:38:00,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:00 WrapperNode [2024-06-28 01:38:00,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:38:00,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:38:00,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:38:00,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:38:00,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:00" (1/1) ... [2024-06-28 01:38:00,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:00" (1/1) ... [2024-06-28 01:38:00,102 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2024-06-28 01:38:00,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:38:00,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:38:00,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:38:00,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:38:00,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:00" (1/1) ... [2024-06-28 01:38:00,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:00" (1/1) ... [2024-06-28 01:38:00,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:00" (1/1) ... [2024-06-28 01:38:00,172 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-28 01:38:00,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:00" (1/1) ... [2024-06-28 01:38:00,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:00" (1/1) ... [2024-06-28 01:38:00,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:00" (1/1) ... [2024-06-28 01:38:00,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:00" (1/1) ... [2024-06-28 01:38:00,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:00" (1/1) ... [2024-06-28 01:38:00,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:00" (1/1) ... [2024-06-28 01:38:00,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:38:00,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:38:00,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:38:00,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:38:00,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:00" (1/1) ... [2024-06-28 01:38:00,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:38:00,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:38:00,249 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 01:38:00,268 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 01:38:00,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:38:00,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:38:00,281 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:38:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:38:00,281 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:38:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:38:00,281 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 01:38:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 01:38:00,281 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 01:38:00,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 01:38:00,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:38:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:38:00,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:38:00,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:38:00,284 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 01:38:00,428 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:38:00,429 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:38:00,787 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:38:00,788 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:38:00,935 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:38:00,935 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:38:00,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:38:00 BoogieIcfgContainer [2024-06-28 01:38:00,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:38:00,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:38:00,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:38:00,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:38:00,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:37:58" (1/4) ... [2024-06-28 01:38:00,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5899fc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:38:00, skipping insertion in model container [2024-06-28 01:38:00,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:37:59" (2/4) ... [2024-06-28 01:38:00,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5899fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:38:00, skipping insertion in model container [2024-06-28 01:38:00,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:00" (3/4) ... [2024-06-28 01:38:00,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5899fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:38:00, skipping insertion in model container [2024-06-28 01:38:00,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:38:00" (4/4) ... [2024-06-28 01:38:00,943 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2024-06-28 01:38:00,957 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:38:00,957 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-28 01:38:00,957 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:38:01,016 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:38:01,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:38:01,078 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2024-06-28 01:38:01,079 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:38:01,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 1/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2024-06-28 01:38:01,083 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:38:01,086 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 55 transitions, 122 flow [2024-06-28 01:38:01,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:38:01,104 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;@ab84299, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:38:01,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-28 01:38:01,109 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:38:01,109 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:38:01,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:38:01,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:01,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:38:01,110 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:01,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash 386818320, now seen corresponding path program 1 times [2024-06-28 01:38:01,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:01,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593575613] [2024-06-28 01:38:01,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:01,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:01,986 INFO 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 01:38:01,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:01,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593575613] [2024-06-28 01:38:01,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593575613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:01,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:01,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:38:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490825567] [2024-06-28 01:38:01,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:01,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:38:01,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:02,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:38:02,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:38:02,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:38:02,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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 01:38:02,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:02,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:38:02,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:06,126 INFO L124 PetriNetUnfolderBase]: 30035/43736 cut-off events. [2024-06-28 01:38:06,126 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2024-06-28 01:38:06,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83892 conditions, 43736 events. 30035/43736 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 1571. Compared 306131 event pairs, 24578 based on Foata normal form. 1081/41677 useless extension candidates. Maximal degree in co-relation 83879. Up to 39701 conditions per place. [2024-06-28 01:38:06,379 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 53 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-06-28 01:38:06,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 285 flow [2024-06-28 01:38:06,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:38:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:38:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-06-28 01:38:06,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2024-06-28 01:38:06,390 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 119 transitions. [2024-06-28 01:38:06,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 285 flow [2024-06-28 01:38:06,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 278 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 01:38:06,396 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 162 flow [2024-06-28 01:38:06,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2024-06-28 01:38:06,400 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2024-06-28 01:38:06,400 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 162 flow [2024-06-28 01:38:06,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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 01:38:06,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:06,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:38:06,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:38:06,401 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:06,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:06,402 INFO L85 PathProgramCache]: Analyzing trace with hash 386819209, now seen corresponding path program 1 times [2024-06-28 01:38:06,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:06,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654788736] [2024-06-28 01:38:06,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:06,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:06,475 INFO 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 01:38:06,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:06,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654788736] [2024-06-28 01:38:06,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654788736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:06,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:06,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:38:06,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320505982] [2024-06-28 01:38:06,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:06,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:38:06,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:06,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:38:06,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:38:06,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 59 [2024-06-28 01:38:06,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 01:38:06,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:06,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 59 [2024-06-28 01:38:06,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:07,422 INFO L124 PetriNetUnfolderBase]: 5221/8977 cut-off events. [2024-06-28 01:38:07,422 INFO L125 PetriNetUnfolderBase]: For 688/688 co-relation queries the response was YES. [2024-06-28 01:38:07,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17277 conditions, 8977 events. 5221/8977 cut-off events. For 688/688 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 69968 event pairs, 3410 based on Foata normal form. 0/8255 useless extension candidates. Maximal degree in co-relation 17265. Up to 6080 conditions per place. [2024-06-28 01:38:07,484 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 45 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2024-06-28 01:38:07,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 297 flow [2024-06-28 01:38:07,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:38:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:38:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2024-06-28 01:38:07,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7966101694915254 [2024-06-28 01:38:07,486 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 162 flow. Second operand 3 states and 141 transitions. [2024-06-28 01:38:07,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 297 flow [2024-06-28 01:38:07,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:38:07,489 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 154 flow [2024-06-28 01:38:07,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-06-28 01:38:07,489 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2024-06-28 01:38:07,490 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 154 flow [2024-06-28 01:38:07,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 01:38:07,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:07,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:07,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:38:07,491 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:07,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1928908936, now seen corresponding path program 1 times [2024-06-28 01:38:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:07,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231633450] [2024-06-28 01:38:07,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:38:08,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:08,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231633450] [2024-06-28 01:38:08,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231633450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:08,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:08,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:38:08,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107748773] [2024-06-28 01:38:08,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:08,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:38:08,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:08,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:38:08,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:38:08,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:38:08,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:08,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:08,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:38:08,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:11,125 INFO L124 PetriNetUnfolderBase]: 24763/35779 cut-off events. [2024-06-28 01:38:11,125 INFO L125 PetriNetUnfolderBase]: For 8585/8585 co-relation queries the response was YES. [2024-06-28 01:38:11,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77400 conditions, 35779 events. 24763/35779 cut-off events. For 8585/8585 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 240640 event pairs, 17378 based on Foata normal form. 4/34658 useless extension candidates. Maximal degree in co-relation 77387. Up to 32791 conditions per place. [2024-06-28 01:38:11,356 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 65 selfloop transitions, 10 changer transitions 2/91 dead transitions. [2024-06-28 01:38:11,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 404 flow [2024-06-28 01:38:11,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:38:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:38:11,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2024-06-28 01:38:11,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6313559322033898 [2024-06-28 01:38:11,362 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 154 flow. Second operand 4 states and 149 transitions. [2024-06-28 01:38:11,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 404 flow [2024-06-28 01:38:11,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 91 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:38:11,367 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 235 flow [2024-06-28 01:38:11,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2024-06-28 01:38:11,368 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 2 predicate places. [2024-06-28 01:38:11,369 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 235 flow [2024-06-28 01:38:11,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:11,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:11,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:11,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:38:11,370 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:11,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:11,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1744449207, now seen corresponding path program 1 times [2024-06-28 01:38:11,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:11,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759095669] [2024-06-28 01:38:11,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:11,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:12,923 INFO 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 01:38:12,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:12,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759095669] [2024-06-28 01:38:12,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759095669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:12,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:12,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:38:12,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045160508] [2024-06-28 01:38:12,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:12,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:38:12,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:12,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:38:12,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:38:13,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:38:13,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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 01:38:13,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:13,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:38:13,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:16,034 INFO L124 PetriNetUnfolderBase]: 25835/35609 cut-off events. [2024-06-28 01:38:16,035 INFO L125 PetriNetUnfolderBase]: For 16736/16736 co-relation queries the response was YES. [2024-06-28 01:38:16,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85644 conditions, 35609 events. 25835/35609 cut-off events. For 16736/16736 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 220797 event pairs, 14024 based on Foata normal form. 4/35170 useless extension candidates. Maximal degree in co-relation 85629. Up to 34147 conditions per place. [2024-06-28 01:38:16,257 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 90 selfloop transitions, 28 changer transitions 0/131 dead transitions. [2024-06-28 01:38:16,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 131 transitions, 686 flow [2024-06-28 01:38:16,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:38:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:38:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2024-06-28 01:38:16,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6016949152542372 [2024-06-28 01:38:16,259 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 235 flow. Second operand 6 states and 213 transitions. [2024-06-28 01:38:16,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 131 transitions, 686 flow [2024-06-28 01:38:16,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 662 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-28 01:38:16,266 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 394 flow [2024-06-28 01:38:16,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2024-06-28 01:38:16,267 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 8 predicate places. [2024-06-28 01:38:16,267 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 394 flow [2024-06-28 01:38:16,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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 01:38:16,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:16,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:16,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:38:16,268 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:16,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash 823544122, now seen corresponding path program 1 times [2024-06-28 01:38:16,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:16,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412902347] [2024-06-28 01:38:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:17,782 INFO 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 01:38:17,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:17,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412902347] [2024-06-28 01:38:17,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412902347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:17,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:17,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:38:17,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898451267] [2024-06-28 01:38:17,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:17,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:38:17,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:17,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:38:17,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:38:17,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:38:17,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 394 flow. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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 01:38:17,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:17,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:38:17,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:21,136 INFO L124 PetriNetUnfolderBase]: 25838/37713 cut-off events. [2024-06-28 01:38:21,136 INFO L125 PetriNetUnfolderBase]: For 36365/36365 co-relation queries the response was YES. [2024-06-28 01:38:21,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97564 conditions, 37713 events. 25838/37713 cut-off events. For 36365/36365 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 258827 event pairs, 13065 based on Foata normal form. 8/36558 useless extension candidates. Maximal degree in co-relation 97545. Up to 34104 conditions per place. [2024-06-28 01:38:21,406 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 114 selfloop transitions, 21 changer transitions 0/148 dead transitions. [2024-06-28 01:38:21,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 148 transitions, 876 flow [2024-06-28 01:38:21,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:38:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:38:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 242 transitions. [2024-06-28 01:38:21,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.585956416464891 [2024-06-28 01:38:21,410 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 394 flow. Second operand 7 states and 242 transitions. [2024-06-28 01:38:21,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 148 transitions, 876 flow [2024-06-28 01:38:21,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 148 transitions, 831 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-06-28 01:38:21,431 INFO L231 Difference]: Finished difference. Result has 82 places, 87 transitions, 481 flow [2024-06-28 01:38:21,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=481, PETRI_PLACES=82, PETRI_TRANSITIONS=87} [2024-06-28 01:38:21,433 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 15 predicate places. [2024-06-28 01:38:21,433 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 87 transitions, 481 flow [2024-06-28 01:38:21,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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 01:38:21,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:21,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:21,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:38:21,434 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:21,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:21,435 INFO L85 PathProgramCache]: Analyzing trace with hash -584643660, now seen corresponding path program 1 times [2024-06-28 01:38:21,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:21,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159951545] [2024-06-28 01:38:21,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:21,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:22,144 INFO 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 01:38:22,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:22,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159951545] [2024-06-28 01:38:22,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159951545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:22,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:22,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:38:22,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250156104] [2024-06-28 01:38:22,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:22,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:38:22,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:22,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:38:22,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:38:22,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 01:38:22,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 87 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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 01:38:22,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:22,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 01:38:22,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:26,712 INFO L124 PetriNetUnfolderBase]: 30008/43939 cut-off events. [2024-06-28 01:38:26,712 INFO L125 PetriNetUnfolderBase]: For 61268/61268 co-relation queries the response was YES. [2024-06-28 01:38:26,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118483 conditions, 43939 events. 30008/43939 cut-off events. For 61268/61268 co-relation queries the response was YES. Maximal size of possible extension queue 1532. Compared 307265 event pairs, 16389 based on Foata normal form. 6/42772 useless extension candidates. Maximal degree in co-relation 118459. Up to 39612 conditions per place. [2024-06-28 01:38:26,975 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 91 selfloop transitions, 14 changer transitions 0/116 dead transitions. [2024-06-28 01:38:26,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 116 transitions, 779 flow [2024-06-28 01:38:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:38:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:38:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-06-28 01:38:26,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152542372881356 [2024-06-28 01:38:26,976 INFO L175 Difference]: Start difference. First operand has 82 places, 87 transitions, 481 flow. Second operand 5 states and 152 transitions. [2024-06-28 01:38:26,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 116 transitions, 779 flow [2024-06-28 01:38:26,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 116 transitions, 730 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-28 01:38:26,990 INFO L231 Difference]: Finished difference. Result has 84 places, 91 transitions, 506 flow [2024-06-28 01:38:26,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=506, PETRI_PLACES=84, PETRI_TRANSITIONS=91} [2024-06-28 01:38:26,991 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 17 predicate places. [2024-06-28 01:38:26,991 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 91 transitions, 506 flow [2024-06-28 01:38:26,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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 01:38:26,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:26,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:26,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:38:26,992 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:26,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1621089352, now seen corresponding path program 1 times [2024-06-28 01:38:26,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:26,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5189311] [2024-06-28 01:38:26,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:26,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:27,857 INFO 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 01:38:27,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:27,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5189311] [2024-06-28 01:38:27,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5189311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:27,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:27,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:38:27,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689944661] [2024-06-28 01:38:27,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:27,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:38:27,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:27,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:38:27,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:38:27,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 01:38:27,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 91 transitions, 506 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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 01:38:27,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:27,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 01:38:27,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:32,015 INFO L124 PetriNetUnfolderBase]: 30138/43492 cut-off events. [2024-06-28 01:38:32,015 INFO L125 PetriNetUnfolderBase]: For 81540/81540 co-relation queries the response was YES. [2024-06-28 01:38:32,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126051 conditions, 43492 events. 30138/43492 cut-off events. For 81540/81540 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 294155 event pairs, 14632 based on Foata normal form. 6/42296 useless extension candidates. Maximal degree in co-relation 126025. Up to 39686 conditions per place. [2024-06-28 01:38:32,351 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 112 selfloop transitions, 23 changer transitions 0/146 dead transitions. [2024-06-28 01:38:32,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 146 transitions, 1013 flow [2024-06-28 01:38:32,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:38:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:38:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2024-06-28 01:38:32,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.536723163841808 [2024-06-28 01:38:32,353 INFO L175 Difference]: Start difference. First operand has 84 places, 91 transitions, 506 flow. Second operand 6 states and 190 transitions. [2024-06-28 01:38:32,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 146 transitions, 1013 flow [2024-06-28 01:38:32,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 146 transitions, 952 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-28 01:38:32,376 INFO L231 Difference]: Finished difference. Result has 88 places, 104 transitions, 633 flow [2024-06-28 01:38:32,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=633, PETRI_PLACES=88, PETRI_TRANSITIONS=104} [2024-06-28 01:38:32,378 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 21 predicate places. [2024-06-28 01:38:32,378 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 104 transitions, 633 flow [2024-06-28 01:38:32,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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 01:38:32,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:32,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:32,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:38:32,378 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:32,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:32,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1628475412, now seen corresponding path program 2 times [2024-06-28 01:38:32,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:32,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743152635] [2024-06-28 01:38:32,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:32,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:33,279 INFO 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 01:38:33,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:33,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743152635] [2024-06-28 01:38:33,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743152635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:33,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:33,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:38:33,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449499257] [2024-06-28 01:38:33,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:33,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:38:33,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:33,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:38:33,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:38:33,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 01:38:33,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 104 transitions, 633 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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 01:38:33,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:33,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 01:38:33,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:37,591 INFO L124 PetriNetUnfolderBase]: 30120/44098 cut-off events. [2024-06-28 01:38:37,591 INFO L125 PetriNetUnfolderBase]: For 114432/114432 co-relation queries the response was YES. [2024-06-28 01:38:37,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137546 conditions, 44098 events. 30120/44098 cut-off events. For 114432/114432 co-relation queries the response was YES. Maximal size of possible extension queue 1532. Compared 307662 event pairs, 15986 based on Foata normal form. 6/42928 useless extension candidates. Maximal degree in co-relation 137518. Up to 39744 conditions per place. [2024-06-28 01:38:37,879 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 110 selfloop transitions, 16 changer transitions 0/137 dead transitions. [2024-06-28 01:38:37,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 137 transitions, 971 flow [2024-06-28 01:38:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:38:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:38:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-06-28 01:38:37,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084745762711864 [2024-06-28 01:38:37,881 INFO L175 Difference]: Start difference. First operand has 88 places, 104 transitions, 633 flow. Second operand 6 states and 180 transitions. [2024-06-28 01:38:37,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 137 transitions, 971 flow [2024-06-28 01:38:37,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 137 transitions, 931 flow, removed 19 selfloop flow, removed 1 redundant places. [2024-06-28 01:38:37,913 INFO L231 Difference]: Finished difference. Result has 93 places, 104 transitions, 636 flow [2024-06-28 01:38:37,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=636, PETRI_PLACES=93, PETRI_TRANSITIONS=104} [2024-06-28 01:38:37,914 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 26 predicate places. [2024-06-28 01:38:37,914 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 104 transitions, 636 flow [2024-06-28 01:38:37,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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 01:38:37,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:37,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:37,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:38:37,915 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:37,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:37,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1895364755, now seen corresponding path program 1 times [2024-06-28 01:38:37,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:37,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713577614] [2024-06-28 01:38:37,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:37,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:39,181 INFO 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 01:38:39,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:39,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713577614] [2024-06-28 01:38:39,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713577614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:39,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:39,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:38:39,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009556531] [2024-06-28 01:38:39,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:39,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:38:39,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:39,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:38:39,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:38:39,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-28 01:38:39,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 104 transitions, 636 flow. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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 01:38:39,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:39,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-28 01:38:39,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand