./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.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.opt.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.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix043.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:37:59,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:37:59,634 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:59,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:37:59,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:37:59,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:37:59,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:37:59,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:37:59,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:37:59,673 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:37:59,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:37:59,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:37:59,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:37:59,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:37:59,675 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:37:59,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:37:59,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:37:59,676 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:37:59,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:37:59,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:37:59,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:37:59,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:37:59,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:37:59,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:37:59,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:37:59,678 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:37:59,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:37:59,679 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:37:59,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:37:59,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:37:59,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:37:59,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:37:59,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:37:59,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:37:59,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:37:59,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:37:59,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:37:59,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:37:59,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:37:59,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:37:59,683 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:37:59,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:37:59,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:37:59,683 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:59,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:37:59,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:37:59,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:37:59,957 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:37:59,958 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:37:59,959 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.opt.yml/witness.yml [2024-06-28 01:38:00,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:38:00,225 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:38:00,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2024-06-28 01:38:01,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:38:01,700 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:38:01,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2024-06-28 01:38:01,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a142f3561/72d13f92447e4157bc2fa86d2b3c07ab/FLAGd75202dd5 [2024-06-28 01:38:01,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a142f3561/72d13f92447e4157bc2fa86d2b3c07ab [2024-06-28 01:38:01,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:38:01,741 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:38:01,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:38:01,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:38:01,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:38:01,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:38:00" (1/2) ... [2024-06-28 01:38:01,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c2af17 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:38:01, skipping insertion in model container [2024-06-28 01:38:01,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:38:00" (1/2) ... [2024-06-28 01:38:01,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2d0d2b9e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:38:01, skipping insertion in model container [2024-06-28 01:38:01,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:38:01" (2/2) ... [2024-06-28 01:38:01,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c2af17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:01, skipping insertion in model container [2024-06-28 01:38:01,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:38:01" (2/2) ... [2024-06-28 01:38:01,753 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:38:01,883 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:38:01,884 INFO L97 edCorrectnessWitness]: Location invariant before [L853-L853] (((((((((((((((((((((((! multithreaded || (x == 0 || x == 1)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 2))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$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)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 2))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0) [2024-06-28 01:38:01,885 INFO L97 edCorrectnessWitness]: Location invariant before [L855-L855] (((((((((((((((((((((((! multithreaded || (x == 0 || x == 1)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 2))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$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)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 2))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0) [2024-06-28 01:38:01,885 INFO L97 edCorrectnessWitness]: Location invariant before [L856-L856] (((((((((((((((((((((((! multithreaded || (x == 0 || x == 1)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 2))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$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)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 2))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0) [2024-06-28 01:38:01,885 INFO L97 edCorrectnessWitness]: Location invariant before [L851-L851] (((((((((((((((((((((((! multithreaded || (x == 0 || x == 1)) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 2))) && (! multithreaded || ((z == 0 || z == 1) || z == 2))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (a == 0 || a == 1))) && (! multithreaded || (((((((((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$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)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2))) && (! multithreaded || (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1))) && (! multithreaded || (b == 0 || b == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 2))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0) [2024-06-28 01:38:01,885 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:38:01,886 INFO L106 edCorrectnessWitness]: ghost_update [L849-L849] multithreaded = 1; [2024-06-28 01:38:01,939 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:38:02,148 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.opt.i[944,957] [2024-06-28 01:38:02,372 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:38:02,383 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:38:02,418 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.opt.i[944,957] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:38:02,548 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:38:02,597 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:38:02,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:02 WrapperNode [2024-06-28 01:38:02,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:38:02,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:38:02,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:38:02,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:38:02,606 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:02" (1/1) ... [2024-06-28 01:38:02,625 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:02" (1/1) ... [2024-06-28 01:38:02,665 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2024-06-28 01:38:02,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:38:02,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:38:02,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:38:02,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:38:02,679 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:02" (1/1) ... [2024-06-28 01:38:02,679 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:02" (1/1) ... [2024-06-28 01:38:02,683 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:02" (1/1) ... [2024-06-28 01:38:02,712 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:02,713 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:02" (1/1) ... [2024-06-28 01:38:02,713 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:02" (1/1) ... [2024-06-28 01:38:02,741 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:02" (1/1) ... [2024-06-28 01:38:02,743 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:02" (1/1) ... [2024-06-28 01:38:02,755 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:02" (1/1) ... [2024-06-28 01:38:02,757 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:02" (1/1) ... [2024-06-28 01:38:02,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:38:02,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:38:02,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:38:02,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:38:02,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:02" (1/1) ... [2024-06-28 01:38:02,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:38:02,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:38:02,809 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:02,832 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:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:38:02,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:38:02,851 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:38:02,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:38:02,851 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:38:02,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:38:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 01:38:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 01:38:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 01:38:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 01:38:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:38:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:38:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:38:02,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:38:02,857 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:03,026 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:38:03,028 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:38:03,465 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:38:03,465 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:38:03,682 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:38:03,682 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:38:03,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:38:03 BoogieIcfgContainer [2024-06-28 01:38:03,683 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:38:03,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:38:03,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:38:03,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:38:03,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:38:00" (1/4) ... [2024-06-28 01:38:03,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c02363c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:38:03, skipping insertion in model container [2024-06-28 01:38:03,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:38:01" (2/4) ... [2024-06-28 01:38:03,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c02363c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:38:03, skipping insertion in model container [2024-06-28 01:38:03,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:38:02" (3/4) ... [2024-06-28 01:38:03,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c02363c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:38:03, skipping insertion in model container [2024-06-28 01:38:03,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:38:03" (4/4) ... [2024-06-28 01:38:03,693 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.opt.i [2024-06-28 01:38:03,710 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:38:03,711 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-28 01:38:03,711 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:38:03,768 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:38:03,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:38:03,855 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2024-06-28 01:38:03,855 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:38:03,859 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 5. Compared 99 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:03,859 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 59 transitions, 134 flow [2024-06-28 01:38:03,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 55 transitions, 122 flow [2024-06-28 01:38:03,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:38:03,887 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;@b374afb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:38:03,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-28 01:38:03,893 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:38:03,893 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-28 01:38:03,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:38:03,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:03,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:38:03,895 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:03,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:03,905 INFO L85 PathProgramCache]: Analyzing trace with hash 371432573, now seen corresponding path program 1 times [2024-06-28 01:38:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:03,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477035919] [2024-06-28 01:38:03,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:03,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:38:05,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:05,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477035919] [2024-06-28 01:38:05,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477035919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:05,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:05,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:38:05,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083506828] [2024-06-28 01:38:05,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:05,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:38:05,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:05,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:38:05,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:38:05,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2024-06-28 01:38:05,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:05,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:05,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2024-06-28 01:38:05,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:08,437 INFO L124 PetriNetUnfolderBase]: 17474/25862 cut-off events. [2024-06-28 01:38:08,437 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2024-06-28 01:38:08,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49413 conditions, 25862 events. 17474/25862 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 180201 event pairs, 14603 based on Foata normal form. 673/24821 useless extension candidates. Maximal degree in co-relation 49400. Up to 23295 conditions per place. [2024-06-28 01:38:08,625 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 52 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2024-06-28 01:38:08,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 74 transitions, 285 flow [2024-06-28 01:38:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:38:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:38:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-06-28 01:38:08,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7005649717514124 [2024-06-28 01:38:08,639 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 124 transitions. [2024-06-28 01:38:08,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 74 transitions, 285 flow [2024-06-28 01:38:08,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 278 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 01:38:08,646 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 162 flow [2024-06-28 01:38:08,648 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:08,652 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2024-06-28 01:38:08,652 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 162 flow [2024-06-28 01:38:08,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:08,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:08,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:08,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:38:08,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:08,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:08,654 INFO L85 PathProgramCache]: Analyzing trace with hash 464907998, now seen corresponding path program 1 times [2024-06-28 01:38:08,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:08,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662686349] [2024-06-28 01:38:08,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:08,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:09,472 INFO 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:09,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:09,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662686349] [2024-06-28 01:38:09,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662686349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:09,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:09,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:38:09,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290037596] [2024-06-28 01:38:09,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:09,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:38:09,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:09,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:38:09,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:38:09,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 59 [2024-06-28 01:38:09,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:09,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:09,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 59 [2024-06-28 01:38:09,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:12,496 INFO L124 PetriNetUnfolderBase]: 19927/29140 cut-off events. [2024-06-28 01:38:12,497 INFO L125 PetriNetUnfolderBase]: For 4993/4993 co-relation queries the response was YES. [2024-06-28 01:38:12,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62742 conditions, 29140 events. 19927/29140 cut-off events. For 4993/4993 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 201201 event pairs, 14603 based on Foata normal form. 4/27501 useless extension candidates. Maximal degree in co-relation 62730. Up to 26481 conditions per place. [2024-06-28 01:38:12,705 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 68 selfloop transitions, 11 changer transitions 0/94 dead transitions. [2024-06-28 01:38:12,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 94 transitions, 410 flow [2024-06-28 01:38:12,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:38:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:38:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-06-28 01:38:12,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.673728813559322 [2024-06-28 01:38:12,714 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 162 flow. Second operand 4 states and 159 transitions. [2024-06-28 01:38:12,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 94 transitions, 410 flow [2024-06-28 01:38:12,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 94 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:38:12,719 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 220 flow [2024-06-28 01:38:12,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-06-28 01:38:12,721 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 2 predicate places. [2024-06-28 01:38:12,723 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 220 flow [2024-06-28 01:38:12,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:38:12,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:12,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:12,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:38:12,731 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:12,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:12,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1193485375, now seen corresponding path program 1 times [2024-06-28 01:38:12,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:12,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415516477] [2024-06-28 01:38:12,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:14,012 INFO 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:14,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:14,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415516477] [2024-06-28 01:38:14,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415516477] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:14,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:14,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:38:14,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486678945] [2024-06-28 01:38:14,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:14,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:38:14,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:14,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:38:14,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:38:14,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-28 01:38:14,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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:14,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:14,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-28 01:38:14,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:17,157 INFO L124 PetriNetUnfolderBase]: 25298/36762 cut-off events. [2024-06-28 01:38:17,158 INFO L125 PetriNetUnfolderBase]: For 16543/16543 co-relation queries the response was YES. [2024-06-28 01:38:17,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86782 conditions, 36762 events. 25298/36762 cut-off events. For 16543/16543 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 254732 event pairs, 14933 based on Foata normal form. 8/34720 useless extension candidates. Maximal degree in co-relation 86768. Up to 33399 conditions per place. [2024-06-28 01:38:17,401 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 96 selfloop transitions, 20 changer transitions 0/130 dead transitions. [2024-06-28 01:38:17,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 130 transitions, 638 flow [2024-06-28 01:38:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:38:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:38:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2024-06-28 01:38:17,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2024-06-28 01:38:17,405 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 220 flow. Second operand 6 states and 228 transitions. [2024-06-28 01:38:17,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 130 transitions, 638 flow [2024-06-28 01:38:17,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 130 transitions, 602 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-28 01:38:17,413 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 299 flow [2024-06-28 01:38:17,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2024-06-28 01:38:17,414 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 6 predicate places. [2024-06-28 01:38:17,415 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 299 flow [2024-06-28 01:38:17,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 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:17,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:17,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:17,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:38:17,416 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:17,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1783587145, now seen corresponding path program 1 times [2024-06-28 01:38:17,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509361893] [2024-06-28 01:38:17,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:18,713 INFO 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:18,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:18,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509361893] [2024-06-28 01:38:18,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509361893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:18,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:18,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:38:18,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032116181] [2024-06-28 01:38:18,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:18,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:38:18,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:18,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:38:18,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:38:18,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-28 01:38:18,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:18,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:18,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-28 01:38:18,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:21,991 INFO L124 PetriNetUnfolderBase]: 24882/35086 cut-off events. [2024-06-28 01:38:21,991 INFO L125 PetriNetUnfolderBase]: For 27071/27071 co-relation queries the response was YES. [2024-06-28 01:38:22,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92684 conditions, 35086 events. 24882/35086 cut-off events. For 27071/27071 co-relation queries the response was YES. Maximal size of possible extension queue 1321. Compared 230545 event pairs, 11035 based on Foata normal form. 3/33881 useless extension candidates. Maximal degree in co-relation 92667. Up to 32956 conditions per place. [2024-06-28 01:38:22,263 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 81 selfloop transitions, 12 changer transitions 0/106 dead transitions. [2024-06-28 01:38:22,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 106 transitions, 583 flow [2024-06-28 01:38:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:38:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:38:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2024-06-28 01:38:22,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5661016949152542 [2024-06-28 01:38:22,267 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 299 flow. Second operand 5 states and 167 transitions. [2024-06-28 01:38:22,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 106 transitions, 583 flow [2024-06-28 01:38:22,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 106 transitions, 534 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-28 01:38:22,282 INFO L231 Difference]: Finished difference. Result has 75 places, 77 transitions, 326 flow [2024-06-28 01:38:22,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=75, PETRI_TRANSITIONS=77} [2024-06-28 01:38:22,284 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 8 predicate places. [2024-06-28 01:38:22,284 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 326 flow [2024-06-28 01:38:22,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:22,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:22,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:38:22,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:22,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash 939281076, now seen corresponding path program 1 times [2024-06-28 01:38:22,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:22,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257085511] [2024-06-28 01:38:22,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:22,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:23,517 INFO 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:23,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:23,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257085511] [2024-06-28 01:38:23,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257085511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:23,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:23,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:38:23,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640542135] [2024-06-28 01:38:23,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:23,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:38:23,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:23,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:38:23,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:38:23,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:38:23,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 326 flow. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:23,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:23,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:38:23,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:27,282 INFO L124 PetriNetUnfolderBase]: 28470/38788 cut-off events. [2024-06-28 01:38:27,282 INFO L125 PetriNetUnfolderBase]: For 45579/45601 co-relation queries the response was YES. [2024-06-28 01:38:27,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112015 conditions, 38788 events. 28470/38788 cut-off events. For 45579/45601 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 241953 event pairs, 12275 based on Foata normal form. 5/37577 useless extension candidates. Maximal degree in co-relation 111996. Up to 37548 conditions per place. [2024-06-28 01:38:27,578 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 97 selfloop transitions, 26 changer transitions 0/135 dead transitions. [2024-06-28 01:38:27,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 135 transitions, 784 flow [2024-06-28 01:38:27,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:38:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:38:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2024-06-28 01:38:27,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5790960451977402 [2024-06-28 01:38:27,580 INFO L175 Difference]: Start difference. First operand has 75 places, 77 transitions, 326 flow. Second operand 6 states and 205 transitions. [2024-06-28 01:38:27,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 135 transitions, 784 flow [2024-06-28 01:38:27,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 135 transitions, 746 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-28 01:38:27,591 INFO L231 Difference]: Finished difference. Result has 78 places, 87 transitions, 438 flow [2024-06-28 01:38:27,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=78, PETRI_TRANSITIONS=87} [2024-06-28 01:38:27,592 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 11 predicate places. [2024-06-28 01:38:27,592 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 87 transitions, 438 flow [2024-06-28 01:38:27,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:27,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:27,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:38:27,593 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:27,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:27,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1308598794, now seen corresponding path program 2 times [2024-06-28 01:38:27,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:27,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932990050] [2024-06-28 01:38:27,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:27,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:28,711 INFO 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:28,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:28,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932990050] [2024-06-28 01:38:28,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932990050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:28,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:28,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:38:28,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030994455] [2024-06-28 01:38:28,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:28,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:38:28,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:28,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:38:28,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:38:28,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:38:28,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 87 transitions, 438 flow. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:28,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:28,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:38:28,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:32,583 INFO L124 PetriNetUnfolderBase]: 28460/38802 cut-off events. [2024-06-28 01:38:32,583 INFO L125 PetriNetUnfolderBase]: For 65378/65431 co-relation queries the response was YES. [2024-06-28 01:38:32,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120725 conditions, 38802 events. 28460/38802 cut-off events. For 65378/65431 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 242583 event pairs, 12278 based on Foata normal form. 37/37625 useless extension candidates. Maximal degree in co-relation 120705. Up to 37538 conditions per place. [2024-06-28 01:38:32,879 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 91 selfloop transitions, 26 changer transitions 0/129 dead transitions. [2024-06-28 01:38:32,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 129 transitions, 770 flow [2024-06-28 01:38:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:38:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:38:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2024-06-28 01:38:32,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5621468926553672 [2024-06-28 01:38:32,882 INFO L175 Difference]: Start difference. First operand has 78 places, 87 transitions, 438 flow. Second operand 6 states and 199 transitions. [2024-06-28 01:38:32,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 129 transitions, 770 flow [2024-06-28 01:38:32,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 129 transitions, 708 flow, removed 25 selfloop flow, removed 2 redundant places. [2024-06-28 01:38:32,944 INFO L231 Difference]: Finished difference. Result has 82 places, 87 transitions, 440 flow [2024-06-28 01:38:32,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=440, PETRI_PLACES=82, PETRI_TRANSITIONS=87} [2024-06-28 01:38:32,945 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 15 predicate places. [2024-06-28 01:38:32,945 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 87 transitions, 440 flow [2024-06-28 01:38:32,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:32,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:32,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:38:32,946 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:32,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2145886450, now seen corresponding path program 1 times [2024-06-28 01:38:32,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:32,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655660354] [2024-06-28 01:38:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:32,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:38:34,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:34,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655660354] [2024-06-28 01:38:34,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655660354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:34,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:34,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:38:34,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134437577] [2024-06-28 01:38:34,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:34,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:38:34,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:34,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:38:34,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:38:34,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:38:34,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 87 transitions, 440 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:34,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:34,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:38:34,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:37,944 INFO L124 PetriNetUnfolderBase]: 28679/39130 cut-off events. [2024-06-28 01:38:37,944 INFO L125 PetriNetUnfolderBase]: For 68473/68523 co-relation queries the response was YES. [2024-06-28 01:38:38,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121259 conditions, 39130 events. 28679/39130 cut-off events. For 68473/68523 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 244337 event pairs, 12262 based on Foata normal form. 7/37891 useless extension candidates. Maximal degree in co-relation 121237. Up to 37780 conditions per place. [2024-06-28 01:38:38,235 INFO L140 encePairwiseOnDemand]: 42/59 looper letters, 128 selfloop transitions, 40 changer transitions 0/180 dead transitions. [2024-06-28 01:38:38,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 180 transitions, 1086 flow [2024-06-28 01:38:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:38:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:38:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 272 transitions. [2024-06-28 01:38:38,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.576271186440678 [2024-06-28 01:38:38,237 INFO L175 Difference]: Start difference. First operand has 82 places, 87 transitions, 440 flow. Second operand 8 states and 272 transitions. [2024-06-28 01:38:38,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 180 transitions, 1086 flow [2024-06-28 01:38:38,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 180 transitions, 994 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-28 01:38:38,277 INFO L231 Difference]: Finished difference. Result has 86 places, 111 transitions, 632 flow [2024-06-28 01:38:38,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=632, PETRI_PLACES=86, PETRI_TRANSITIONS=111} [2024-06-28 01:38:38,277 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 19 predicate places. [2024-06-28 01:38:38,278 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 111 transitions, 632 flow [2024-06-28 01:38:38,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:38,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:38,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:38,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:38:38,278 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:38,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:38,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1628061830, now seen corresponding path program 2 times [2024-06-28 01:38:38,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:38,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421247507] [2024-06-28 01:38:38,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:38,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:39,641 INFO 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,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:39,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421247507] [2024-06-28 01:38:39,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421247507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:39,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:39,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:38:39,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162603948] [2024-06-28 01:38:39,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:39,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:38:39,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:39,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:38:39,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:38:39,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:38:39,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 111 transitions, 632 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:39,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:38:39,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:43,741 INFO L124 PetriNetUnfolderBase]: 28733/39212 cut-off events. [2024-06-28 01:38:43,741 INFO L125 PetriNetUnfolderBase]: For 96169/96257 co-relation queries the response was YES. [2024-06-28 01:38:43,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131580 conditions, 39212 events. 28733/39212 cut-off events. For 96169/96257 co-relation queries the response was YES. Maximal size of possible extension queue 1437. Compared 244756 event pairs, 12259 based on Foata normal form. 11/37972 useless extension candidates. Maximal degree in co-relation 131556. Up to 37807 conditions per place. [2024-06-28 01:38:44,005 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 125 selfloop transitions, 42 changer transitions 0/179 dead transitions. [2024-06-28 01:38:44,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 179 transitions, 1212 flow [2024-06-28 01:38:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:38:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:38:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2024-06-28 01:38:44,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5738498789346247 [2024-06-28 01:38:44,007 INFO L175 Difference]: Start difference. First operand has 86 places, 111 transitions, 632 flow. Second operand 7 states and 237 transitions. [2024-06-28 01:38:44,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 179 transitions, 1212 flow [2024-06-28 01:38:44,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 179 transitions, 1136 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-28 01:38:44,067 INFO L231 Difference]: Finished difference. Result has 90 places, 116 transitions, 725 flow [2024-06-28 01:38:44,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=725, PETRI_PLACES=90, PETRI_TRANSITIONS=116} [2024-06-28 01:38:44,068 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 23 predicate places. [2024-06-28 01:38:44,068 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 116 transitions, 725 flow [2024-06-28 01:38:44,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:44,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:44,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:44,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:38:44,069 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:44,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:44,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1628066480, now seen corresponding path program 3 times [2024-06-28 01:38:44,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:44,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443898951] [2024-06-28 01:38:44,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:44,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:38:45,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:45,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443898951] [2024-06-28 01:38:45,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443898951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:45,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:45,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:38:45,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186721162] [2024-06-28 01:38:45,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:45,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:38:45,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:45,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:38:45,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:38:45,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:38:45,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 116 transitions, 725 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:45,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:45,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:38:45,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:38:49,467 INFO L124 PetriNetUnfolderBase]: 28787/39270 cut-off events. [2024-06-28 01:38:49,468 INFO L125 PetriNetUnfolderBase]: For 125870/125940 co-relation queries the response was YES. [2024-06-28 01:38:49,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140683 conditions, 39270 events. 28787/39270 cut-off events. For 125870/125940 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 246388 event pairs, 11773 based on Foata normal form. 33/38039 useless extension candidates. Maximal degree in co-relation 140658. Up to 37723 conditions per place. [2024-06-28 01:38:49,761 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 111 selfloop transitions, 63 changer transitions 0/186 dead transitions. [2024-06-28 01:38:49,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 186 transitions, 1419 flow [2024-06-28 01:38:49,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:38:49,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:38:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 241 transitions. [2024-06-28 01:38:49,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5835351089588378 [2024-06-28 01:38:49,763 INFO L175 Difference]: Start difference. First operand has 90 places, 116 transitions, 725 flow. Second operand 7 states and 241 transitions. [2024-06-28 01:38:49,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 186 transitions, 1419 flow [2024-06-28 01:38:49,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 186 transitions, 1270 flow, removed 39 selfloop flow, removed 5 redundant places. [2024-06-28 01:38:49,831 INFO L231 Difference]: Finished difference. Result has 92 places, 126 transitions, 862 flow [2024-06-28 01:38:49,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=862, PETRI_PLACES=92, PETRI_TRANSITIONS=126} [2024-06-28 01:38:49,831 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 25 predicate places. [2024-06-28 01:38:49,832 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 126 transitions, 862 flow [2024-06-28 01:38:49,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:49,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:38:49,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:38:49,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 01:38:49,833 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-28 01:38:49,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:38:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash 30856932, now seen corresponding path program 4 times [2024-06-28 01:38:49,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:38:49,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593654013] [2024-06-28 01:38:49,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:38:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:38:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:38:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:38:50,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:38:50,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593654013] [2024-06-28 01:38:50,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593654013] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:38:50,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:38:50,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:38:50,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303205571] [2024-06-28 01:38:50,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:38:50,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:38:50,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:38:50,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:38:50,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:38:51,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-28 01:38:51,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 126 transitions, 862 flow. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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:51,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:38:51,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-28 01:38:51,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand